# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
738800 | 2023-05-09T13:52:20 Z | LIF | Triumphal arch (POI13_luk) | C++14 | 794 ms | 27700 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 = 1; 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
# | 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 | 5 ms | 7348 KB | Output is correct |
# | 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 | 6 ms | 7316 KB | Output is correct |
4 | Correct | 4 ms | 7344 KB | Output is correct |
5 | Incorrect | 5 ms | 7252 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 7252 KB | Output is correct |
2 | Correct | 4 ms | 7348 KB | Output is correct |
3 | Correct | 4 ms | 7252 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 7380 KB | Output is correct |
2 | Correct | 5 ms | 7356 KB | Output is correct |
3 | Correct | 5 ms | 7380 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 13 ms | 7764 KB | Output is correct |
2 | Correct | 13 ms | 8000 KB | Output is correct |
3 | Correct | 12 ms | 7768 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 50 ms | 8656 KB | Output is correct |
2 | Correct | 37 ms | 9680 KB | Output is correct |
3 | Correct | 26 ms | 8780 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 122 ms | 11728 KB | Output is correct |
2 | Correct | 145 ms | 14124 KB | Output is correct |
3 | Correct | 102 ms | 12116 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 425 ms | 16588 KB | Output is correct |
2 | Correct | 461 ms | 22220 KB | Output is correct |
3 | Correct | 209 ms | 17096 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 750 ms | 21256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 794 ms | 21156 KB | Output is correct |
2 | Correct | 793 ms | 27700 KB | Output is correct |
3 | Correct | 331 ms | 21904 KB | Output is correct |