oj.uz

Submission #82712

# Submission time Handle Problem Language Result Execution time Memory
82712 2018-11-01T11:38:48 Z farukkastamonuda Triumphal arch (POI13_luk) C++14
100 / 100
 1090 ms 47068 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define lo long long 
#define inf 1000000009
#define md 1000000007
#define li 300005
#define mp make_pair
#define pb push_back
using namespace std;
int n,a,b,sz[li],sz2[li];
vector<int> v[li];
lo int dfs(int node,int ata,int val){
	lo int D=0;
	for(int i=0;i<(int)v[node].size();i++){
		int go=v[node][i];
		if(go==ata) continue;
		D+=dfs(go,node,val)+1;
	}
	return max(0LL,D-val);
}
bool ok(int val){
	return (dfs(1,-1,val)==0);
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<n;i++){
		scanf("%d %d",&a,&b);
		v[a].pb(b);
		v[b].pb(a);
	}
	int bas=0,son=n-1;
	while(bas<=son){
		int mid=(bas+son)/2;
		if(ok(mid)) son=mid-1;
		else bas=mid+1;
	}
	printf("%d\n",bas);
	return 0;
}

Compilation message

luk.cpp: In function 'int main()':
luk.cpp:26:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
luk.cpp:28:8: 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 11 ms 7288 KB Output is correct
2 Correct 9 ms 7416 KB Output is correct
3 Correct 9 ms 7656 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7656 KB Output is correct
2 Correct 9 ms 7788 KB Output is correct
3 Correct 9 ms 7788 KB Output is correct
4 Correct 9 ms 7788 KB Output is correct
5 Correct 9 ms 7788 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7788 KB Output is correct
2 Correct 9 ms 7788 KB Output is correct
3 Correct 9 ms 7792 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7796 KB Output is correct
2 Correct 9 ms 7932 KB Output is correct
3 Correct 9 ms 7932 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 8240 KB Output is correct
2 Correct 24 ms 8464 KB Output is correct
3 Correct 28 ms 8560 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 9460 KB Output is correct
2 Correct 46 ms 10688 KB Output is correct
3 Correct 34 ms 10688 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 13636 KB Output is correct
2 Correct 207 ms 16736 KB Output is correct
3 Correct 146 ms 16736 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 679 ms 21796 KB Output is correct
2 Correct 584 ms 28868 KB Output is correct
3 Correct 196 ms 28868 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 980 ms 34016 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 959 ms 38056 KB Output is correct
2 Correct 1090 ms 47068 KB Output is correct
3 Correct 372 ms 47068 KB Output is correct