Submission #849207

#	Time	Username	Problem	Language	Result	Execution time	Memory
849207		vjudge1	Političari (COCI20_politicari)	C++17	35 / 70	13 ms	4208 KiB

politicari

#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define fi first
#define se second
#define int long long
#define pii pair<int,int>
#define piii pair<int, pair<int, int>>
#define v(int) vector<int>
#define si size()
#define foe(i,a,b) for(int i=a;i<=b;++i)
#define fol(i,a,b) for(int i=a;i<b;++i)
#define pb push_back
#define Bit(mask,i) (1<<i)&mask
#define offBit(mask,i) (1<<i)^mask
#define onBit(mask,i) (1<<i)mask
#define CNT(x) __builtin_popcountll(x)
const int mod = 1e9+7;
const int base = 2309;
const int inf = 1e18;
const int N = 1e6+10;
const int LG = 20;
// ▄  ▄ ▄  ▄ ▄  ▄ ▄  ▄ ▄  ▄ ▄▄ ▄ ▄▄▄▄
// █▄▄█ █  █ █  █ █▄▄█ █  █ ██ █ █ ▄▄
// █  █ █▄▄█ █▄▄█ █  █ █▄▄█ █ ██ █▄▄█

int n, k;
int a[510][510];
int dem = 2;
int ans = 2;
v(pii) save;
int dd[510][510];

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> k;
    foe(i,1,n)
    {
        foe(j,1,n)
        {
            cin >> a[i][j];
        }
    }
    if(k == 1)
    {
        cout << 1;
        return 0;
    }
    if(k == 2)
    {
        cout << 2;
        return 0;
    }
    if(k <= 1e5)
    {
        int i = 2;
        int j = 1;
        while(dem < k)
        {
    //        cout << i << " " << j << "\n";
            ans = a[i][j];
            int x = i;
            int y = j;
            i = a[x][y];
            j = x;
            ++ dem;
        }
        cout << ans;
    }
//    else
//    {
//        int i = 2;
//        int j = 1;
//        dd[i][j] = 1;
//        while(dem < k)
//        {
//            save.pb({i, j});
//            int x = i;
//            int y = j;
//            i = a[x][y];
//            j = x;
//            ++ dem;
//            if(dd[i][j] == 1)
//            {
//                break;
//            }
//            else
//                dd[i][j] = 1;
//        }
//        k -= 2;
//        k %= save.si;
//        if(k == 0)
//            k = save.si;
//        k -= 1;
//        ans = a[save[k].fi][save[k].se];
//        cout << ans;
//    }
    cerr << "\n" << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
    return 0;
}

• Subtask 1: 35 / 70