Submission

Score: 0

User: C12

Problemset: forex

Language: cpp

Time: 0.136 second

Submitted On: 2025-12-31 23:00:00

#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pii pair<ll,ll>
#define puii pair<ull,ull>
#define piii pair<ll,pii>
#define ll long long
#define ull unsigned long long
#define mp make_pair
 
#define mpiii(a,b,c) make_pair(a,make_pair(b,c));
ll mod = 1000000007;

float change[32][32];

void solve(){
    ll n;

    cin >> n;

    queue<pair<ll,pair<ll,float>>>q;

    for(int i = 0;i < n;i++){
        for(int j = 0;j < n;j++){
            cin >> change[i][j];

            // cout << change[i][j] << '\n';
        }
        q.push(mp(i,mp(i,1.00)));
    }

    ll size,cnt,ori,num;
    float cur;

    cnt = 0;

    while(1){
        cnt++;
        size = q.size();
        while(size-- && !q.empty()){
            ori = q.front().f;
            num = q.front().s.f;
            cur = q.front().s.s;
            // cout << ori << ' ' << num << ' ' << cur << '\n';
            q.pop();
            for(int i = 0;i < n;i++){
                if(cur * change[num][i] <= 1.00){
                    continue;
                }
                if(cur * change[num][i] * change[i][ori] > 1.01){
                    cout << (ori + 1) << ' ' << (cnt + 1);
                    return; 
                }
                q.push(mp(ori,mp(i,cur * change[num][i])));
            }
        }
        if(cnt > n*n*n || q.empty()){
            cout << -1;
            return;
        }
        // cout << '\n';
    }

    return;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    ll q;
 
    // cin >> q;

    // while(q--)
        solve(); 

    return 0;
}