제출 #849371

#제출 시각아이디문제언어결과실행 시간메모리
849371vjudge1Političari (COCI20_politicari)C++17
15 / 70
14 ms4316 KiB
#include<bits/stdc++.h> #define int long long #define ll pair<int,int> using namespace std; long long a[505][505]; long long danhdau[505]; vector<int> elt; int vt[505]; int n,k; void dfs(int u,int v) { if (danhdau[v]>n) { int l=vt[v]; int r=vt[u]; int leng=r-l+1; k-=l; k%=leng; cout << elt[k+l] << '\n'; return; } else { danhdau[v]++; elt.push_back(v); vt[v]=elt.size()-1; if (vt[v]==k) { cout << v; return; } dfs(v,a[v][u]); } } signed main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cin >> n >> k; k--; for (int i=1;i<=n;i++) { for (int i2=1;i2<=n;i2++) { cin >> a[i][i2]; } } elt.push_back(1); vt[1]=0; danhdau[1]++; dfs(1,2); }
#Verdict Execution timeMemoryGrader output
Fetching results...