oj.uz

답안 #638393

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
638393 2022-09-05T17:58:10 Z NeroZein Političari (COCI20_politicari) C++14
45 / 70
 16 ms 2016 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, 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
45.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Incorrect 4 ms 212 KB Output isn't correct
4 Incorrect 2 ms 212 KB Output isn't correct
5 Incorrect 6 ms 212 KB Output isn't correct
6 Incorrect 5 ms 212 KB Output isn't correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 5 ms 1236 KB Output is correct
10 Correct 14 ms 1804 KB Output is correct
11 Correct 16 ms 2016 KB Output is correct
12 Correct 16 ms 2004 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 724 KB Output is correct