Submission #1750686
Source Code Expand
#include"bits/stdc++.h" #define PB push_back #define PF push_front #define LB lower_bound #define UB upper_bound #define fr(x) freopen(x,"r",stdin) #define fw(x) freopen(x,"w",stdout) #define iout(x) printf("%d\n",x) #define lout(x) printf("%lld\n",x) #define REP(x,l,u) for(ll x = (l);x<=(u);x++) #define RREP(x,l,u) for(ll x = (l);x>=(u);x--) #define mst(x,a) memset(x,a,sizeof(x)) #define PII pair<int,int> #define PLL pair<ll,ll> #define MP make_pair #define se second #define fi first #define dbg(x) cout<<#x<<" = "<<(x)<<endl; #define sz(x) ((int)x.size()) #define cl(x) x.clear() typedef long long ll; typedef unsigned long long ull; typedef double db; typedef long double ld; using namespace std; const int maxn = 100010; const int mod = 1e9+7; const int MAX = 1000000010; const double eps = 1e-6; const double PI = acos(-1); template<typename T> inline void read(T &x){ x=0;T f=1;char ch;do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f; } template<typename A,typename B> inline void read(A&x,B&y){read(x);read(y);} template<typename A,typename B,typename C> inline void read(A&x,B&y,C&z){read(x);read(y);read(z);} template<typename A,typename B,typename C,typename D> inline void read(A&x,B&y,C&z,D&w){read(x);read(y);read(z);read(w);} template<typename A,typename B> inline A fexp(A x,B p){A ans=1;for(;p;p>>=1,x=1LL*x*x%mod)if(p&1)ans=1LL*ans*x%mod;return ans;} template<typename A,typename B> inline A fexp(A x,B p,A mo){A ans=1;for(;p;p>>=1,x=1LL*x*x%mo)if(p&1)ans=1LL*ans*x%mo;return ans;} int n; vector<int> G[maxn]; int Ans[maxn],vis[maxn]; void dfs(int u,int f){ int t=0; for(auto v:G[u])if(v!=f){ dfs(v,u); t|=vis[u]&vis[v]; vis[u]|=vis[v]; } while((1<<Ans[u])<=t||((vis[u]>>Ans[u])&1))Ans[u]++; vis[u]&=~((1<<Ans[u])-1); vis[u]|=1<<Ans[u]; } void Work(){ dfs(1,0); int ans=0; REP(i,1,n)ans=max(ans,Ans[i]); iout(ans); } void Init(){ read(n); REP(i,2,n){ int u,v; read(u,v); G[u].PB(v);G[v].PB(u); } } int main(){ Init(); Work(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Uninity |
User | yanQval |
Language | C++14 (GCC 5.4.1) |
Score | 1400 |
Code Size | 2152 Byte |
Status | AC |
Exec Time | 39 ms |
Memory | 12160 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1400 / 1400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 57.txt, 58.txt, 59.txt, 60.txt, 61.txt, 62.txt, 63.txt, 64.txt, 65.txt, 66.txt, 67.txt, 68.txt, 69.txt, 70.txt, 71.txt, 72.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 35 ms | 6652 KB |
02.txt | AC | 34 ms | 6656 KB |
03.txt | AC | 34 ms | 6656 KB |
04.txt | AC | 35 ms | 6656 KB |
05.txt | AC | 33 ms | 6656 KB |
06.txt | AC | 33 ms | 6656 KB |
07.txt | AC | 34 ms | 6656 KB |
08.txt | AC | 34 ms | 6656 KB |
09.txt | AC | 24 ms | 8192 KB |
10.txt | AC | 29 ms | 9728 KB |
11.txt | AC | 13 ms | 6016 KB |
12.txt | AC | 14 ms | 6272 KB |
13.txt | AC | 39 ms | 12160 KB |
14.txt | AC | 34 ms | 11648 KB |
15.txt | AC | 38 ms | 10880 KB |
16.txt | AC | 37 ms | 8448 KB |
17.txt | AC | 23 ms | 6520 KB |
18.txt | AC | 23 ms | 6516 KB |
19.txt | AC | 26 ms | 6784 KB |
20.txt | AC | 26 ms | 6656 KB |
21.txt | AC | 27 ms | 6656 KB |
22.txt | AC | 28 ms | 6656 KB |
23.txt | AC | 23 ms | 6520 KB |
24.txt | AC | 23 ms | 6520 KB |
25.txt | AC | 29 ms | 6780 KB |
26.txt | AC | 30 ms | 6784 KB |
27.txt | AC | 31 ms | 6784 KB |
28.txt | AC | 32 ms | 6784 KB |
29.txt | AC | 33 ms | 6784 KB |
30.txt | AC | 36 ms | 6784 KB |
31.txt | AC | 37 ms | 6784 KB |
32.txt | AC | 33 ms | 6656 KB |
33.txt | AC | 34 ms | 6656 KB |
34.txt | AC | 34 ms | 6656 KB |
35.txt | AC | 33 ms | 6656 KB |
36.txt | AC | 34 ms | 6656 KB |
37.txt | AC | 35 ms | 6656 KB |
38.txt | AC | 34 ms | 6528 KB |
39.txt | AC | 38 ms | 6528 KB |
40.txt | AC | 33 ms | 6656 KB |
41.txt | AC | 34 ms | 6656 KB |
42.txt | AC | 36 ms | 6528 KB |
43.txt | AC | 35 ms | 6528 KB |
44.txt | AC | 29 ms | 7040 KB |
45.txt | AC | 29 ms | 7168 KB |
46.txt | AC | 30 ms | 7040 KB |
47.txt | AC | 31 ms | 7040 KB |
48.txt | AC | 32 ms | 7040 KB |
49.txt | AC | 32 ms | 6912 KB |
50.txt | AC | 34 ms | 6784 KB |
51.txt | AC | 34 ms | 6784 KB |
52.txt | AC | 35 ms | 6656 KB |
53.txt | AC | 35 ms | 6656 KB |
54.txt | AC | 35 ms | 6656 KB |
55.txt | AC | 35 ms | 6656 KB |
56.txt | AC | 23 ms | 6520 KB |
57.txt | AC | 33 ms | 10620 KB |
58.txt | AC | 32 ms | 10620 KB |
59.txt | AC | 35 ms | 6656 KB |
60.txt | AC | 35 ms | 6656 KB |
61.txt | AC | 27 ms | 8056 KB |
62.txt | AC | 28 ms | 8056 KB |
63.txt | AC | 3 ms | 2560 KB |
64.txt | AC | 3 ms | 2560 KB |
65.txt | AC | 3 ms | 2560 KB |
66.txt | AC | 3 ms | 2560 KB |
67.txt | AC | 3 ms | 2560 KB |
68.txt | AC | 3 ms | 2560 KB |
69.txt | AC | 3 ms | 2560 KB |
70.txt | AC | 3 ms | 2560 KB |
71.txt | AC | 3 ms | 2560 KB |
72.txt | AC | 3 ms | 2560 KB |
s1.txt | AC | 3 ms | 2560 KB |
s2.txt | AC | 3 ms | 2560 KB |