Submission #526547

#	Time	Username	Problem	Language	Result	Execution time	Memory
526547		brayden04	Političari (COCI20_politicari)	C++14	0 / 70	714 ms	524292 KiB

politicari

#include <bits/stdc++.h>
#define endl '\n'
#define int long long

using namespace std;

vector<int> adjlst[505];
vector<int> pattern;

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int N, K;
    cin >> N >> K;

    for (int i = 1; i <= N; i++){
        for (int i2 = 1; i2 <= N; i2++){
            int temp = 0;
            cin >> temp;
            adjlst[i].push_back(temp);
        }
    }
    
    
    int curPerson = 1;
    int prevShow = 0;

    int person1 = 0;
    int person2 = 0;

    int i = 0;

    while (true){
        if (prevShow == 0){
            curPerson += 1;
            person1 = curPerson;
            prevShow = 1;
            pattern.push_back(curPerson);
        }
        else{
            int tempPrev = prevShow;
            person1 = curPerson;
            prevShow = curPerson;
            curPerson = adjlst[curPerson][tempPrev-1];
            person2 = curPerson;
            pattern.push_back(curPerson);
        }

        if (i > 2 && pattern[0] == person1 && pattern[1] == person2){
            break;
        }
        i++;
    }

    pattern.pop_back();
    pattern.pop_back();

    cout << pattern[K % pattern.size()] << endl;
}

• Subtask 1: 0 / 70