# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1005626 | spensa | Game (IOI14_game) | C++14 | 1 ms | 348 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 <bits/stdc++.h>
using namespace std;
// #include <vector>
int N;
void initialize(int n) {
N = n;
}
const int MXN = 1500 + 20;
int par[MXN] = {0};
// int notpar[MXN];
// vector<vector<int>> notpar(MXN);
set<int> notpar[MXN];
int hasEdge(int u, int v) {
if(u>v){
int tmp = u;
u = v;
v = tmp;
//swap(u, v);
}
if((notpar[v].size())==(v-2)){
par[v] = u;
return 1;
}
notpar[v].insert(u);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |