oj.uz

Submission #1055864

# Submission time Handle Problem Language Result Execution time Memory
1055864 2024-08-13T06:08:02 Z 김은성(#11066) Summer Driving (CCO24_day1problem3) C++17
1 / 25
 199 ms 65108 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[b+1]--;
		pos[0]++;
	}
	for(k=1; a*k<=n; k++){
		if(a*k + (k-1)*b + a >= n){
			pos[a*k + k*b + 1]--;
			pos[max(0, a*k-b)]++;
		}
		else{
			pos[a*k + (k-1)*b]--;
			pos[max(0, a*k-b)]++;
		}
		/*
		for(l=0; l<=(k-1)*b; l++){
			int p = a*k + l;
			if(p >= n)
				continue;
			if(p+a < n){
				pos[max(0, p-b)]++;
				pos[p]--;
			}
			else{
				pos[max(0, p-b)]++;
				pos[min(n, p+b+1)]--;
			}
		}*/
	}
	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

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 112 ms 33876 KB Output is correct
2 Correct 131 ms 32596 KB Output is correct
3 Correct 118 ms 35060 KB Output is correct
4 Correct 121 ms 37968 KB Output is correct
5 Correct 5 ms 14428 KB Output is correct

Subtask #2
0.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 63872 KB Output is correct
2 Correct 199 ms 63876 KB Output is correct
3 Correct 114 ms 65108 KB Output is correct
4 Correct 122 ms 63828 KB Output is correct
5 Incorrect 146 ms 62520 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 14424 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 6 ms 14424 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 35 ms 21880 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 6 ms 14424 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 112 ms 33876 KB Output is correct
2 Correct 131 ms 32596 KB Output is correct
3 Correct 118 ms 35060 KB Output is correct
4 Correct 121 ms 37968 KB Output is correct
5 Correct 5 ms 14428 KB Output is correct
6 Correct 148 ms 63872 KB Output is correct
7 Correct 199 ms 63876 KB Output is correct
8 Correct 114 ms 65108 KB Output is correct
9 Correct 122 ms 63828 KB Output is correct
10 Incorrect 146 ms 62520 KB Output isn't correct
11 Halted 0 ms 0 KB -