Submission #931127

#	Time	Username	Problem	Language	Result	Execution time	Memory
931127		Whisper	Političari (COCI20_politicari)	C++17	35 / 70	476 ms	524288 KiB

politicari

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 5e2 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nPeople, nShow;
int a[MAX][MAX];
int vis[MAX][MAX], d[MAX][MAX];
void Whisper(){
    cin >> nPeople >> nShow;
    FOR(i, 1, nPeople) FOR(j, 1, nPeople) cin >> a[i][j];
    int cur = 2, prv = 1;
    if (nShow == 1) return void(cout << 1);
    vector<int> cyc = {1, 2};
    while (true){
        int x = cur, y = prv; prv = cur;
        cur = a[x][y];
        cyc.push_back(cur);
        if ((int)cyc.size() > nShow) break;
    }
    cout << cyc[nShow - 1];
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

• Subtask 1: 35 / 70