# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
217151 | NONAME | Političari (COCI20_politicari) | C++17 | 24 ms | 18816 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>
#include <time.h>
//#include <random>
//#ifndef _LOCAL
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#endif
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 3 * 100500
#define oo ll(1e16)
#define pii pair <int, int>
#define pll pair <ll, ll>
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
#define re return
#define nins 4294967295
using namespace std;
typedef long long ll;
typedef long double ld;
//mt19937 rnd(0);
int n, k, g[1000][1000], was[1000][1000], rs[N];
void solve() {
cin >> n >> k;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> g[i][j], g[i][j]--;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
was[i][j] = -1;
for (int i = 0; i < k; i++)
rs[i] = 0;
int lst = 0, cr = 1;
was[lst][cr] = 0;
rs[0] = 0;
rs[1] = 1;
for (int i = 2; i < k; i++) {
int nxt = g[cr][lst];
if (was[cr][nxt] == -1) {
was[cr][nxt] = i;
rs[i] = nxt;
lst = cr;
cr = nxt;
continue;
}
int len = i - was[cr][nxt] - 1;
k -= was[cr][lst];
int ps = was[cr][lst] + ((k + 1 - was[cr][nxt]) % len);
cout << rs[ps] + 1;
return;
}
cout << rs[k - 1] + 1;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef _LOCAL
in("input.txt");
int t = 1;
cin >> t;
for (int i = 1; i <= t; i++) {
cout << "Test #" << i << elf;
clock_t start_time = clock();
solve();
cerr.precision(4); cerr << fixed;
cerr << elf;
cerr << "Time :: " << ld(clock() - start_time) / CLOCKS_PER_SEC << elf;
cout << elf;
}
#else
int t = 1;
// cin >> t;
while (t--) {
solve();
cout << el;
}
#endif
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |