# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849344 | LTTrungCHL | Političari (COCI20_politicari) | C++17 | 14 ms | 3628 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.
///***LTT***///
/// ->TUYEN QUOC GIA<- ///
#include<bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("popcnt")
#define int long long
#define endl "\n"
#define F first
#define S second
#define pb push_back
#define CHECKBIT(mask,i) ((mask>>(i) )&1) // == 1 la bat, == 0 la tat
#define OFFBIT(mask,i) ((1<<(i))^mask) // tat bit thu i
#define ONBIT(mask,i) ((1<<(i))mask) // bat bit thu i
using namespace std;
const long long oo = 1e9+7;
const int N = 2 * 1e5 + 10;
int n, a[505][505], k;
vector <int> ans;
bool dd[505][505];
void inp(){
cin >> n >> k;
for (int i = 1;i <= n;i++){
for (int j = 1;j <= n;j++){
cin >> a[i][j];
}
}
return;
}
void solve(){
ans.pb(1);
ans.pb(2);
int tt = 2;
int p = 1;
int u = 2;
int preu = u;
int prep = p;
while (!dd[u][p] and tt <= k){
dd[u][p] = true;
preu = u;
prep = p;
u = a[preu][prep];
p = preu;
if (dd[u][p]) break;
ans.pb(u);
++tt;
}
ans.pop_back();
// for (int i = 0;i < ans.size();i++){
// cout << ans[i] <<"\n";
// }
int sz = ans.size();
int o = k % sz;
if (o == 0) o = sz;
cout << ans[o - 1];
return;
}
signed main(){
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
if (fopen("file.inp", "r")){
freopen("file.inp", "r", stdin);
freopen("file.out", "w", stdout);
}
//int t;
//cin >> t;
//while(t--){
inp();
solve();
//}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |