제출 #1333809

#제출 시각아이디문제언어결과실행 시간메모리
1333809gelastropodLaser Strike (EGOI25_laserstrike)C++20
8 / 100
4 ms412 KiB
#include <bits/stdc++.h>

using namespace std;

int main() {
    int P, N;
    cin >> P >> N;
    if (P == 1) {
        vector<int> a(N - 1);
        vector<int> b(N - 1);
        vector<int> freq(N, 0);
        for (int i = 0; i < N - 1; ++i) {
            cin >> a[i] >> b[i];
            freq[a[i]]++;
            freq[b[i]]++;
        }
        int spec = 0;
        for (int i = 0; i < N; i++) if (freq[i] > 1) spec = i;
        if (spec == 0) cout << "1" << endl;
        else cout << "0" << endl;
        for (int i = 0; i < N; ++i) {
            if (i != spec) cout << i << endl;
        }
    }
    else {
        cin.ignore(100, '\n');
        string message;
        getline(cin, message);
        int a, b, spec = 0; cin >> a >> b;
        if (message == "0") spec = max(a, b);
        if (a == spec) cout << b << endl;
        else cout << a << endl;
        for (int i = 1; i < N - 1; ++i) {
            int a, b;
            cin >> a >> b;


            bool guess_a = (spec == b);

            if (guess_a) {
                cout << a << endl;
            }
            else {
                cout << b << endl;
            }
        }
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...