oj.uz

답안 #931153

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931153 2024-02-21T10:14:09 Z Whisper Političari (COCI20_politicari) C++17
70 / 70
 19 ms 6236 KB 
#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};
    FOR(i, 1, nPeople) vis[i][i] = 1;
    vis[2][1] = 1;
    d[2][1] = 2;
    int x, y;
    while (true){
        x = cur, y = prv; prv = cur;
        cur = a[x][y];
        cyc.push_back(cur);
        if (vis[cur][prv]) break;
        d[cur][prv] = d[x][y] + 1;
        vis[cur][prv] = 1;
    }
    if (nShow <= cyc.size()){
        cout << cyc[nShow - 1];
        return;
    }
    nShow -= d[cur][prv];
    nShow %= ((int)cyc.size() - d[cur][prv]);
    if (nShow == 0) cout << cur;
    else cout << cyc[d[cur][prv] + nShow - 1];
}


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

Compilation message

politicari.cpp: In function 'void Whisper()':
politicari.cpp:67:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     if (nShow <= cyc.size()){
      |         ~~~~~~^~~~~~~~~~~~~

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 3 ms 5212 KB Output is correct
3 Correct 8 ms 5724 KB Output is correct
4 Correct 10 ms 5936 KB Output is correct
5 Correct 15 ms 6236 KB Output is correct
6 Correct 19 ms 6236 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 3 ms 5212 KB Output is correct
10 Correct 11 ms 6156 KB Output is correct
11 Correct 13 ms 6236 KB Output is correct
12 Correct 13 ms 6236 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct