Submission #31712

#TimeUsernameProblemLanguageResultExecution timeMemory
31712top34051게임 (IOI14_game)C++14
0 / 100
0 ms10808 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; #define maxn 1505 int n,ok; int cnt[maxn]; void initialize(int N) { n = N; ok = n*(n-1)/2 - (n-1); memset(cnt,0,sizeof(cnt)); } int hasEdge(int u, int v) { if(ok && cnt[u]+1<n-1 && cnt[v]+1!=n-1) { cnt[u]++; cnt[v]++; ok--; return 0; } ok++; return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...