| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1333761 | YSH2020 | Laser Strike (EGOI25_laserstrike) | C++20 | 1 ms | 432 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);
int counts[N]; memset(counts,0,sizeof(counts));
for (int i = 0; i < N - 1; ++i) {
cin >> a[i] >> b[i];
counts[a[i]]++;
counts[b[i]]++;
}
string message = "0";
if (counts[N-1]==N-1) message="1";
vector<int> l(N - 1);
for (int i = 0; i < N; i++) if (counts[i]==1) l[i]=i;
cout << message << endl;
for (int i = 0; i < N - 1; ++i) {
cout << l[i] << endl;
}
} else {
cin.ignore(100, '\n');
string message;
getline(cin, message);
int core=-1;
if (message=="1") core=N-1;
for (int i = 0; i < N - 1; ++i) {
int a, b;
cin >> a >> b;
if (a==core) cout << b << endl;
else {
cout << a << endl;
core = b;
}
}
}
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
