Submission #1029990

#TimeUsernameProblemLanguageResultExecution timeMemory
1029990codexistentGame (IOI14_game)C++14
0 / 100
1 ms436 KiB
#include <bits/stdc++.h> using namespace std; #define MAXN 1505 #define FOR(i, a, b) for(int i = a; i <= b; i++) int N, ec[MAXN], r = 0, e = 0; void initialize(int n){ N = n; FOR(i, 1, N) ec[i] = 0; n = N - 1; r = N * (N - 1) / 2 + 1; } int hasEdge(int u, int v){ r--; ec[u]++, ec[v]++; if(ec[u] == N - 1 || ec[v] == N - 1) { e--; return 1; } if(e == r){ e--; return 1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...