oj.uz

Submission #477030

# Submission time Handle Problem Language Result Execution time Memory
477030 2021-09-29T20:59:39 Z mychecksedad Političari (COCI20_politicari) C++17
5 / 70
 24 ms 2552 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define all(x) x.begin(), x.end()
const int N = 550, M = 1e5+10, F = 2147483646, K = 20;


int n, arr[N][N];
ll k;
vector<int> ans;
bool b[N][N];
void dfs(int x, int y){
    if(b[y][x]){
        return;
    }
    dfs(arr[x][y], x);
}
int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    cin >> n >> k;
    for(int i = 1; i <= n; i++) for(int j = 0; j <= n; j++) cin >> arr[i][j];
    for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) b[i][j] = 0;
    ans.pb(1);
    b[1][2] = 1;
    dfs(2, 1);
    ll a = (k % ll(ans.size()) == 0 ? ll(ans.size()) - 1 : k % ll(ans.size()));
    cout << ans[a];

    return 0;
}

Subtask #1
5.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 4 ms 972 KB Output isn't correct
3 Incorrect 12 ms 1872 KB Output isn't correct
4 Incorrect 15 ms 2256 KB Output isn't correct
5 Incorrect 21 ms 2508 KB Output isn't correct
6 Incorrect 24 ms 2552 KB Output isn't correct
7 Incorrect 1 ms 332 KB Output isn't correct
8 Incorrect 2 ms 716 KB Output isn't correct
9 Incorrect 4 ms 1100 KB Output isn't correct
10 Incorrect 14 ms 2252 KB Output isn't correct
11 Incorrect 17 ms 2524 KB Output isn't correct
12 Incorrect 17 ms 2508 KB Output isn't correct
13 Incorrect 1 ms 460 KB Output isn't correct
14 Incorrect 2 ms 716 KB Output isn't correct