# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
422150 | daanolav | Game (IOI14_game) | C++14 | 0 ms | 204 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "game.h"
#include <vector>
using namespace std;
#define MAXN 100000001
typedef vector<int> vi;
int n;
int blocks[MAXN];
void initialize(int n) {
::n = n;
for(int i = 0; i < n; ++i) {
blocks[i] = 0;
}
}
int hasEdge(int u,int v) {
if(blocks[u] >= (n - 3) || blocks[v] >= (n - 3)) {
return 1;
}
++blocks[u];
++blocks[v];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |