Submission #370897

#TimeUsernameProblemLanguageResultExecution timeMemory
370897FystyGame (IOI14_game)C++17
0 / 100
1 ms492 KiB
#include <bits/stdc++.h> #define rep(i,n) for(int i=0;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define F first #define S second #define pb push_back int N,d[1505],cnt=0; void initialize(int n) { N=n; } int hasEdge(int u,int v) { if(d[u]==N-2||d[v]==N-2) { d[u]++,d[v]++; return 1; } else if(cnt==N*(N-1)/2-(N-1)) { d[u]++,d[v]++; return 1; } else { cnt++; return 0; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...