oj.uz

답안 #931122

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

Compilation message

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

Subtask #1
40.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2552 KB Output is correct
2 Incorrect 6 ms 5432 KB Output isn't correct
3 Incorrect 9 ms 6508 KB Output isn't correct
4 Incorrect 11 ms 6748 KB Output isn't correct
5 Correct 13 ms 7260 KB Output is correct
6 Correct 14 ms 7004 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 2 ms 4892 KB Output is correct
9 Correct 5 ms 5464 KB Output is correct
10 Incorrect 11 ms 6888 KB Output isn't correct
11 Correct 13 ms 7244 KB Output is correct
12 Incorrect 13 ms 7248 KB Output isn't correct
13 Correct 1 ms 4440 KB Output is correct
14 Incorrect 2 ms 4956 KB Output isn't correct