제출 #1013794

#제출 시각아이디문제언어결과실행 시간메모리
1013794vjudge1새로운 문제 (POI13_luk)C++17
0 / 100
128 ms19208 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); ll n; cin>>n; vector<ll> v[n]; for(int i=0;i<n-1;i++){ ll x,y; cin>>x>>y;x--;y--; v[x].push_back(y); v[y].push_back(x); } ll mx=0; for(int i=0;i<n;i++){ mx=max((ll)v[i].size(),mx); } cout<<mx-1; }
#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...