oj.uz

Submission #738803

# Submission time Handle Problem Language Result Execution time Memory
738803 2023-05-09T13:53:32 Z LIF Triumphal arch (POI13_luk) C++14
100 / 100
 986 ms 23676 KB 
#include<bits/stdc++.h>
#include<vector>
using namespace std;
int n;
vector<int> vv[300005];
int check(int cur,int now,int pre)
{
	int siz = 0;
	for(int i=0;i<vv[now].size();i++)
	{
		int xx = vv[now][i];
		if(xx != pre)
		{
			siz++;
			siz += check(cur,xx,now);
		}
	}
	siz -= cur;
	return max(siz,0);
}
int main()
{
	cin>>n;
	for(int i=1;i<=n-1;i++)
	{
		int xx,yy;
		cin>>xx>>yy;
		vv[xx].push_back(yy);
		vv[yy].push_back(xx);
	}
	int l = 0;
	int r = n;
	int ans = 0;
	while(l<=r)
	{
		int mid = (l+r)>>1;
		if(check(mid,1,-1) > 0)
		{
			l = mid +1;
		}
		else
		{
			ans = mid;
			r = mid-1;
		}
	}
	cout<<ans<<endl;
	
	
	
	
	
	
	return 0;
}

Compilation message

luk.cpp: In function 'int check(int, int, int)':
luk.cpp:9:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |  for(int i=0;i<vv[now].size();i++)
      |              ~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 4 ms 7304 KB Output is correct
3 Correct 4 ms 7252 KB Output is correct
4 Correct 4 ms 7252 KB Output is correct
5 Correct 6 ms 7252 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7252 KB Output is correct
2 Correct 7 ms 7380 KB Output is correct
3 Correct 6 ms 7380 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 7648 KB Output is correct
2 Correct 16 ms 7944 KB Output is correct
3 Correct 15 ms 7636 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 8316 KB Output is correct
2 Correct 46 ms 9428 KB Output is correct
3 Correct 29 ms 8404 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 10540 KB Output is correct
2 Correct 192 ms 12968 KB Output is correct
3 Correct 112 ms 10936 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 557 ms 14052 KB Output is correct
2 Correct 514 ms 19736 KB Output is correct
3 Correct 255 ms 14596 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 840 ms 17252 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 898 ms 17264 KB Output is correct
2 Correct 986 ms 23676 KB Output is correct
3 Correct 381 ms 18120 KB Output is correct