oj.uz

Submission #638395

# Submission time Handle Problem Language Result Execution time Memory
638395 2022-09-05T17:59:34 Z NeroZein Političari (COCI20_politicari) C++14
70 / 70
 16 ms 2068 KB 
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

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

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 1108 KB Output is correct
3 Correct 11 ms 1712 KB Output is correct
4 Correct 13 ms 1864 KB Output is correct
5 Correct 16 ms 1996 KB Output is correct
6 Correct 15 ms 1748 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 4 ms 1236 KB Output is correct
10 Correct 12 ms 1776 KB Output is correct
11 Correct 16 ms 2068 KB Output is correct
12 Correct 15 ms 2004 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 2 ms 852 KB Output is correct