제출 #217159

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
217159		NONAME	Političari (COCI20_politicari)	C++17	35 / 70	24 ms	18688 KiB

politicari

#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;

    rs[0] = 0;
    rs[1] = 1;

    was[lst][cr] = 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];
        k -= was[cr][nxt];
        int ps = was[cr][nxt] + (k % len);

        cout << rs[ps - 1] + 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
}

• Subtask 1: 35 / 70