# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
477033 | mychecksedad | Političari (COCI20_politicari) | C++17 | 24 ms | 1656 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
ans.pb(x);
b[y][x] = 1;
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 = 1; 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);
dfs(2, 1);
// for(int v: ans) cout << v << '\n';
--k;
ll a = k % (ll(ans.size()) - 1);
cout << ans[a];
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |