# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1055809 | 2024-08-13T05:41:37 Z | 김은성(#11066) | Summer Driving (CCO24_day1problem3) | C++17 | 175 ms | 58960 KB |
#include <bits/stdc++.h> using namespace std; vector<int> graph[300009]; int par[300009], depth[300009]; vector<int> child[300009]; void settree(int v){ for(int u: graph[v]){ if(par[v] == u) continue; par[u] = v; child[v].push_back(u); depth[u] = depth[v] + 1; settree(u); } } int main(){ int n, r, a, b, i, u, v; scanf("%d %d %d %d", &n, &r, &a, &b); if(a <= b){ printf("1\n"); return 0; } for(i=1; i<n; i++){ scanf("%d %d", &u, &v); graph[u].push_back(v); graph[v].push_back(u); } settree(r); for(i=1; i<=n; i++){ if(a-b <= depth[i]%a || (1 <= depth[i]%a && depth[i]%a<= b) || (i!=r && graph[i].size()==1)){ printf("%d\n", i); return 0; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 14428 KB | Output is correct |
2 | Correct | 6 ms | 14528 KB | Output is correct |
3 | Correct | 5 ms | 14428 KB | Output is correct |
4 | Correct | 5 ms | 14356 KB | Output is correct |
5 | Correct | 6 ms | 14380 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 175 ms | 58960 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 14404 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 14404 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 34 ms | 20060 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 14404 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 14428 KB | Output is correct |
2 | Correct | 6 ms | 14528 KB | Output is correct |
3 | Correct | 5 ms | 14428 KB | Output is correct |
4 | Correct | 5 ms | 14356 KB | Output is correct |
5 | Correct | 6 ms | 14380 KB | Output is correct |
6 | Incorrect | 175 ms | 58960 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |