Submission #1013943

#TimeUsernameProblemLanguageResultExecution timeMemory
1013943vjudge1Triumphal arch (POI13_luk)C++17
0 / 100
77 ms20564 KiB
#include "bits/stdc++.h" typedef long long ll; using namespace std; vector<vector<int>> g; int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; g.resize(n+1); for(int i = 0; i < n-1; i++){ int a, b; cin >> a >> b; g[a].push_back(b); g[b].push_back(a); } int maxx = -1; for(int i = 1; i <= n; i++){ int siz = g[i].size(); if(i != 1) siz--; maxx = max(maxx, siz); } cout << maxx; }
#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...