제출 #731397

#제출 시각아이디문제언어결과실행 시간메모리
731397eneskavPolitičari (COCI20_politicari)C++17
10 / 70
17 ms3376 KiB
#include <iostream> #include <vector> #include <cstring> #define int long long using namespace std; #define fastio \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); \ cout.tie(NULL); signed main() { fastio; int n, k; cin >> n >> k; int a[n + 1][n + 1]; for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) cin >> a[i][j]; if (k <= 2) { cout << k; return 0; } bool vis[n + 1][n + 1]; memset(vis, false, sizeof(vis)); int p = 0, c = 1; vector<int> v; v.push_back(1); a[c][p] = 2; for (int i = 1; i < k; ++i) { int t = c; c = a[c][p]; p = t; if (vis[c][p]) { v.pop_back(); break; } vis[c][p] = true; v.push_back(c); } // print v /* for (auto i : v) cout << i << " "; cout << endl; */ cout << v[(k - 1) % v.size()]; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...