# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
210697 | peuch | 게임 (IOI14_game) | C++17 | 0 ms | 0 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;
const int MAXN = 1600;
int ingrau[MAXN];
int N, t;
void initialize(int n) {
N = n;
for(int i = 0; i < n; i++){
for(int j = i + 1; j < n; j++){
ingrau[i]++;
ingrau[j]++;
}
}
}
int hasEdge(int u, int v){
//printf("\t%d\n", ponte[u][v]);
if(ingrau[i] <= 2 || ingrau[j] <= 2) return 1;
else{
ingrau[i]--;
ingrau[j]--;
return 0;
}
}