Submission #1143268

#TimeUsernameProblemLanguageResultExecution timeMemory
1143268laurentiu_tTriumphal arch (POI13_luk)C++20
0 / 100
140 ms17204 KiB
#include<bits/stdc++.h> using namespace std; int n; vector<int> a[300001]; int main() { cin>>n; for(int i=1;i<n;i++) { int x,y; cin>>x>>y; a[x].push_back(y); a[y].push_back(x); } int ma=0; for(int i=1;i<=n;i++) ma=max(ma,int(a[i].size())-1); cout<<ma; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...