oj.uz

Submission #28942

# Submission time Handle Problem Language Result Execution time Memory
28942 2017-07-18T01:39:44 Z 김동현(#1232) Triumphal arch (POI13_luk) C++14
30 / 100
 353 ms 18952 KB 
#include <bits/stdc++.h>
using namespace std;

int n, ans;
vector<int> e[300010];

void f(int x, int p, int d, int s){
	s += e[x].size() - !!p;
	ans = max(ans, (s + d - 1) / d);
	for(auto &i : e[x]){
		if(i != p) f(i, x, d + 1, s);
	}
}

int main(){
	scanf("%d", &n);
	for(int i = 0, x, y; i < n - 1; i++){
		scanf("%d%d", &x, &y);
		e[x].push_back(y);
		e[y].push_back(x);
	}
	f(1, 0, 1, 0);
	printf("%d\n", ans);
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 9052 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 9448 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 12352 KB Output is correct
2 Correct 89 ms 14092 KB Output is correct
3 Incorrect 43 ms 12752 KB Output isn't correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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