Submission #1013758

#TimeUsernameProblemLanguageResultExecution timeMemory
1013758vjudge1Triumphal arch (POI13_luk)C++17
0 / 100
95 ms21152 KiB
//B - Triumphal arch #include <bits/stdc++.h> #define endl '\n' #define mod 1000000007 using namespace std; vector<vector<int>> v(300003); int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, ans=0; cin>>n; for(int i=0; i<n; i++) { int a,b; cin>>a>>b; v[a].push_back(b); v[b].push_back(a); } for(int i=1; i<=n; i++) { int a=v[i].size(); ans=max(ans, a-1); } cout<<ans<<endl; return 0; }
#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...