Submission #1143116

#TimeUsernameProblemLanguageResultExecution timeMemory
1143116andreifilimon새로운 문제 (POI13_luk)C++20
0 / 100
103 ms1584 KiB
#include <iostream> #include <vector> using namespace std; int main() { int n, i, a, b; cin >> n; vector<int> adj(n + 1, 0); for(i = 0; i < n - 1; i++) { cin >> a >> b; adj[a]++; adj[b]++; } int maxx = adj[1]; for(i = 2; i <= n; i++) maxx = max(maxx, adj[i] - 1); 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...