Submission #1143118

#TimeUsernameProblemLanguageResultExecution timeMemory
1143118asaass새로운 문제 (POI13_luk)C++17
0 / 100
5 ms9800 KiB
#include <iostream> #include <algorithm> #include <vector> using namespace std; typedef long long ll; ll n,m,i,j,k,l,d[400000],t[400000]; vector<ll>g[400000]; ll df(ll v){ m=max(m,++t[d[v]]); for(auto i:g[v]) if(d[i]==0) d[i]=d[v]+1,df(i); } int main() { cin>>n; /*for(k=1;k<n;k++) cin>>i>>j,g[i].emplace_back(j),g[j].emplace_back(i); d[1]=1; df(1);*/ cout<<m; }

Compilation message (stderr)

luk.cpp: In function 'll df(ll)':
luk.cpp:13:1: warning: no return statement in function returning non-void [-Wreturn-type]
   13 | }
      | ^
#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...