oj.uz

답안 #1055909

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1055909 2024-08-13T06:30:51 Z 김은성(#11066) Summer Driving (CCO24_day1problem3) C++17
1 / 25
 172 ms 120664 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);
	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;
	if(a >= n){
		pos[min(n, b+1)]--;
		pos[0]++;
	}
	for(k=1; a*k<n; k++){
		if(a*k + k*b + a >= n){
			pos[min(n, a*k + k*b + b + 1)]--;
			pos[max(n-a, a*k-b)]++;
		}
		pos[min(n, a*k + (k-1)*b)]--;
		pos[max(0, a*k-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;
		}
	}
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:26:9: warning: unused variable 'l' [-Wunused-variable]
   26 |  int k, l;
      |         ^
Main.cpp:19:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |  scanf("%d %d %d %d", &n, &r, &a, &b);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:21:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |   scanf("%d %d", &u, &v);
      |   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 120 ms 32596 KB Output is correct
2 Correct 111 ms 32420 KB Output is correct
3 Correct 121 ms 33224 KB Output is correct
4 Correct 113 ms 36944 KB Output is correct
5 Correct 5 ms 14428 KB Output is correct

Subtask #2
0.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 63500 KB Output is correct
2 Correct 149 ms 63568 KB Output is correct
3 Correct 116 ms 63824 KB Output is correct
4 Correct 117 ms 63876 KB Output is correct
5 Correct 142 ms 62292 KB Output is correct
6 Correct 165 ms 63900 KB Output is correct
7 Correct 144 ms 63812 KB Output is correct
8 Correct 163 ms 64084 KB Output is correct
9 Runtime error 172 ms 120664 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #3
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 14428 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 14428 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 31 ms 21588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 14428 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 120 ms 32596 KB Output is correct
2 Correct 111 ms 32420 KB Output is correct
3 Correct 121 ms 33224 KB Output is correct
4 Correct 113 ms 36944 KB Output is correct
5 Correct 5 ms 14428 KB Output is correct
6 Correct 151 ms 63500 KB Output is correct
7 Correct 149 ms 63568 KB Output is correct
8 Correct 116 ms 63824 KB Output is correct
9 Correct 117 ms 63876 KB Output is correct
10 Correct 142 ms 62292 KB Output is correct
11 Correct 165 ms 63900 KB Output is correct
12 Correct 144 ms 63812 KB Output is correct
13 Correct 163 ms 64084 KB Output is correct
14 Runtime error 172 ms 120664 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -