| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1333686 | enson | Laser Strike (EGOI25_laserstrike) | C++20 | 4 ms | 472 KiB |
#include <bits/stdc++.h>
using namespace std;
signed main(){
int P, N;
cin >> P >> N;
if (P == 1){
vector<int>adjlist[N];
int a, b;
for(int i = 0; i < N-1; i++){
cin >> a >> b;
adjlist[a].push_back(b);
adjlist[b].push_back(a);
}
int c = -1;
for(int i = 0; i < N; i++){
if (adjlist[i].size() > 1) c = i;
}
cout << c % 2 << endl;
if (c % 2 == 1){
for(int i = 0; i < N; i+=2){
if (i == c) continue;
cout << i << endl;
}
for(int i = 1; i < N; i+=2){
if (i == c) continue;
cout << i << endl;
}
} else {
for(int i = 1; i < N; i+=2){
if (i == c) continue;
cout << i << endl;
}
for(int i = 0; i < N; i+=2){
if (i == c) continue;
cout << i << endl;
}
}
} else {
int a, b, c, d;
cin >> c;
cin >> a >> b;
if (a % 2 == c){
d = a;
cout << b << endl;
} else {
d = b;
cout << a << endl;
}
for(int i = 0; i < N-2; i++){
cin >> a >> b;
if (a == d) cout << b << endl;
else cout << a << endl;
}
}
}
| # | 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... | ||||
