oj.uz

Submission #883811

# Submission time Handle Problem Language Result Execution time Memory
883811 2023-12-06T06:03:39 Z vjudge1 Političari (COCI20_politicari) C++17
70 / 70
 17 ms 2672 KB 
#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
    const int lim=2e5+100;
#else
    const int lim=2e3+100;
#endif

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

#define int long long
#define pb push_back

const int mod=1e9+7;
using pii=pair<int,int>;

inline void solve(){
    int n,k;
    cin>>n>>k;
    int a[n+1][n+1];
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cin>>a[i][j];
        }
    }
    if(k==1){
        cout<<1;
        return;
    }
    unordered_map<int,int>all,rev;
    int now=2,past=1,time=2;
    while(!all.count(now*n+past)){
        if(k==time){
            cout<<now<<"\n";
            return;
        }
        all[now*n+past]=time;
        rev[time]=now;
        past=a[now][past];
        swap(now,past);
        time++;
    }
    int loopy=all[now*n+past];
    k-=loopy;
    k%=time-loopy;
    k+=loopy;
    cout<<rev[k]<<"\n";
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
#ifdef Local  
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
#else
    //freopen("grass.in","r",stdin);
    //freopen("grass.out","w",stdout);
#endif
    int t=1;
    //cin>>t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 3 ms 860 KB Output is correct
3 Correct 8 ms 1628 KB Output is correct
4 Correct 10 ms 1884 KB Output is correct
5 Correct 12 ms 2396 KB Output is correct
6 Correct 12 ms 2396 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 3 ms 856 KB Output is correct
10 Correct 15 ms 1884 KB Output is correct
11 Correct 17 ms 2672 KB Output is correct
12 Correct 12 ms 2412 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 420 KB Output is correct