oj.uz

Submission #638394

# Submission time Handle Problem Language Result Execution time Memory
638394 2022-09-05T17:58:42 Z NeroZein Političari (COCI20_politicari) C++14
70 / 70
 18 ms 4052 KB 
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define int long long

using namespace std;

const int N = 505;
int n, k, g[N][N], vis[N][N]; 

signed main(){

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cin>>n>>k;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            cin>>g[i][j];
    
    if (k == 1)return cout<<1,0;

    k-=2;
    vis[2][1] = 2;  
    pair<int,int>cur = {2,1};

    while(k){
        k--;
        pair<int,int> to = {g[cur.first][cur.second],cur.first};
        if (vis[to.first][to.second]&&k>2500){
            int len = vis[cur.first][cur.second]-vis[to.first][to.second]+1;
            k %= len;
        }
        vis[g[cur.first][cur.second]][cur.first] = vis[cur.first][cur.second]+1;
        cur = to;
    }
    cout<<cur.first;
}

Subtask #1
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 4 ms 2120 KB Output is correct
3 Correct 10 ms 3204 KB Output is correct
4 Correct 13 ms 3536 KB Output is correct
5 Correct 16 ms 4052 KB Output is correct
6 Correct 17 ms 3832 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 2 ms 1108 KB Output is correct
9 Correct 6 ms 2080 KB Output is correct
10 Correct 18 ms 2808 KB Output is correct
11 Correct 15 ms 3412 KB Output is correct
12 Correct 15 ms 3284 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 2 ms 1236 KB Output is correct