oj.uz

Submission #28935

# Submission time Handle Problem Language Result Execution time Memory
28935 2017-07-18T01:24:33 Z 김현수 (지각충2)(#1233) Triumphal arch (POI13_luk) C++14
30 / 100
 369 ms 21292 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 300005;

int n, v[N], c[N], ans;
vector<int> adj[N];

void solve (int C, int P) {
	c[C] = c[P] + 1;
	v[C] = v[P] + adj[C].size();
	if(P) v[C]--;
	ans = max(ans, (v[C] + c[C] - 1) / c[C]);
	for(auto &T : adj[C]) {
		if(T == P) continue;
		solve(T, C);
	}
}

int main()
{
	scanf("%d",&n);
	for(int i=1;i<n;i++) {
		int A, B;
		scanf("%d%d",&A,&B);
		adj[A].push_back(B);
		adj[B].push_back(A);
	}
	solve(1, 0);
	printf("%d\n",ans);
}

Compilation message

luk.cpp: In function 'int main()':
luk.cpp:21:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
luk.cpp:24:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&A,&B);
                      ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11392 KB Output is correct
2 Correct 0 ms 11392 KB Output is correct
3 Correct 0 ms 11392 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 11392 KB Output is correct
2 Correct 0 ms 11392 KB Output is correct
3 Correct 0 ms 11392 KB Output is correct
4 Correct 3 ms 11392 KB Output is correct
5 Correct 0 ms 11392 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 11392 KB Output is correct
2 Correct 3 ms 11392 KB Output is correct
3 Correct 0 ms 11392 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 14692 KB Output is correct
2 Correct 73 ms 15932 KB Output is correct
3 Incorrect 46 ms 15092 KB Output isn't correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 369 ms 21292 KB Output isn't correct

Subtask #10
0 / 10.0

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