# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
731452 | 2023-04-27T12:53:53 Z | eneskav | Političari (COCI20_politicari) | C++17 | 22 ms | 4204 KB |
#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; } int vis[n + 1][n + 1]; memset(vis, 0, sizeof(vis)); int p = 0, c = 1; vector<int> v; v.push_back(1); a[c][p] = 2; int cycle = 0; for (int i = 1; i < k * 3; ++i) { int t = c; c = a[c][p]; p = t; if (vis[c][p]) { cycle = vis[c][p]; v.pop_back(); break; } vis[c][p] = i; v.push_back(c); } // print v /* for (auto i : v) cout << i << " "; cout << endl; */ --cycle; // cout << "cycle " << cycle << endl; // cout << "cycle length " << v.size() - cycle << endl; if (k < v.size()) { cout << v[k - 1]; return 0; } cout << v[((k - cycle) - 1) % (v.size() - cycle)]; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 4 ms | 980 KB | Output isn't correct |
3 | Incorrect | 13 ms | 2772 KB | Output isn't correct |
4 | Incorrect | 14 ms | 3448 KB | Output isn't correct |
5 | Incorrect | 16 ms | 4200 KB | Output isn't correct |
6 | Incorrect | 22 ms | 4192 KB | Output isn't correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Incorrect | 3 ms | 596 KB | Output isn't correct |
9 | Incorrect | 4 ms | 1108 KB | Output isn't correct |
10 | Incorrect | 13 ms | 3412 KB | Output isn't correct |
11 | Incorrect | 21 ms | 4176 KB | Output isn't correct |
12 | Incorrect | 16 ms | 4204 KB | Output isn't correct |
13 | Incorrect | 1 ms | 340 KB | Output isn't correct |
14 | Incorrect | 2 ms | 596 KB | Output isn't correct |