| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1333711 | enson | Laser Strike (EGOI25_laserstrike) | C++20 | 1 ms | 432 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 << (int)(c > adjlist[c][0]) << endl;
int V[N] = {false};
for(int i = 0; i < N-1; i++){
cout << c << endl;
if (i == N-2) break;
if (!V[adjlist[c][0]]){
c = adjlist[c][0];
V[adjlist[c][0]] = true;
} else {
c = adjlist[c][1];
V[adjlist[c][1]] = true;
}
}
} else {
int a, b, c;
cin >> c;
cin >> a >> b;
int prev;
if ((a > b && c) || (a < b) && !c){
cout << a << endl;
prev = b;
} else {
cout << b << endl;
prev = a;
}
for(int i = 0; i < N-2; i++){
cin >> a >> b;
if (a == prev){
cout << a << endl;
prev = b;
} else {
cout << b << endl;
prev = a;
}
}
}
}
| # | 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... | ||||
