oj.uz

Submission #1055921

# Submission time Handle Problem Language Result Execution time Memory
1055921 2024-08-13T06:35:19 Z 김은성(#11066) Summer Driving (CCO24_day1problem3) C++17
1 / 25
 192 ms 185936 KB 
#include <bits/stdc++.h>
using namespace std;
vector<int> graph[1000009];
int par[1000009], depth[1000009];
vector<int> child[1000009];
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;
		}
	}
	printf("1\n");
	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

# Verdict Execution time Memory Grader output
1 Correct 137 ms 65616 KB Output is correct
2 Correct 141 ms 65364 KB Output is correct
3 Correct 125 ms 66132 KB Output is correct
4 Correct 131 ms 68436 KB Output is correct
5 Correct 18 ms 47196 KB Output is correct

Subtask #2
0.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 95596 KB Output is correct
2 Correct 158 ms 95568 KB Output is correct
3 Correct 123 ms 95360 KB Output is correct
4 Correct 131 ms 95108 KB Output is correct
5 Correct 148 ms 93780 KB Output is correct
6 Correct 168 ms 95548 KB Output is correct
7 Correct 151 ms 95368 KB Output is correct
8 Correct 155 ms 95568 KB Output is correct
9 Runtime error 192 ms 185936 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #3
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 47448 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 47448 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 48 ms 54336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 47448 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 65616 KB Output is correct
2 Correct 141 ms 65364 KB Output is correct
3 Correct 125 ms 66132 KB Output is correct
4 Correct 131 ms 68436 KB Output is correct
5 Correct 18 ms 47196 KB Output is correct
6 Correct 157 ms 95596 KB Output is correct
7 Correct 158 ms 95568 KB Output is correct
8 Correct 123 ms 95360 KB Output is correct
9 Correct 131 ms 95108 KB Output is correct
10 Correct 148 ms 93780 KB Output is correct
11 Correct 168 ms 95548 KB Output is correct
12 Correct 151 ms 95368 KB Output is correct
13 Correct 155 ms 95568 KB Output is correct
14 Runtime error 192 ms 185936 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -