Submission #887486

#TimeUsernameProblemLanguageResultExecution timeMemory
887486TahirAliyevGame (IOI14_game)C++17
15 / 100
1 ms604 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; const int MAX = 1505; int asked[MAX]; bool isCon[MAX]; int m = 0; int edges = 0; int N; void initialize(int n) { N = n; } int hasEdge(int u, int v) { asked[u]++; asked[v]++; m++; if(asked[u] == N - 1 && !isCon[u]){ edges++; isCon[u] = 1; isCon[v] = 1; return 1; } if(asked[v] == N - 1 && !isCon[v]){ edges++; isCon[u] = 1; isCon[v] = 1; return 1; } if(edges + ((N * (N - 1) / 2) - m + 1) == N - 1){ edges++; isCon[u] = 1; isCon[v] = 1; return 1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...