# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1055831 | 2024-08-13T05:56:52 Z | 김은성(#11066) | Summer Driving (CCO24_day1problem3) | C++17 | 170 ms | 60328 KB |
#include <bits/stdc++.h> using namespace std; vector<int> graph[300009]; int par[300009], depth[300009]; vector<int> child[300009]; int pos[1000009]; 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); int k, l; for(k=0; a*k<=n; k++){ for(l=0; l<k && l<a; l++){ int p = a*k + b*l; if(p+a < n){ pos[max(0, p-b)]++; pos[p]--; } else{ pos[max(0, p-b)]++; pos[min(n, p+b)]--; } } } for(i=1; i<n; i++) pos[i] += pos[i-1]; for(i=1; i<=n; i++){ if(pos[depth[i]] > 0){ printf("%d\n", i); return 0; } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 14428 KB | Output is correct |
2 | Correct | 7 ms | 14400 KB | Output is correct |
3 | Correct | 5 ms | 14428 KB | Output is correct |
4 | Correct | 5 ms | 14428 KB | Output is correct |
5 | Correct | 5 ms | 14428 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 170 ms | 60080 KB | Output is correct |
2 | Correct | 154 ms | 60184 KB | Output is correct |
3 | Correct | 118 ms | 60328 KB | Output is correct |
4 | Correct | 166 ms | 60028 KB | Output is correct |
5 | Incorrect | 163 ms | 58524 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 14516 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 14516 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 42 ms | 20344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 14516 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 14428 KB | Output is correct |
2 | Correct | 7 ms | 14400 KB | Output is correct |
3 | Correct | 5 ms | 14428 KB | Output is correct |
4 | Correct | 5 ms | 14428 KB | Output is correct |
5 | Correct | 5 ms | 14428 KB | Output is correct |
6 | Correct | 170 ms | 60080 KB | Output is correct |
7 | Correct | 154 ms | 60184 KB | Output is correct |
8 | Correct | 118 ms | 60328 KB | Output is correct |
9 | Correct | 166 ms | 60028 KB | Output is correct |
10 | Incorrect | 163 ms | 58524 KB | Output isn't correct |
11 | Halted | 0 ms | 0 KB | - |