# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
349250 | David_M | 게임 (IOI14_game) | C++14 | 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 <algorithm>
#include <queue>
using namespace std;
int a[1505];
bool b[1501][1501];
void initialize(int n){ for (int i=2; i<=n; i++)a[i]=1; }
int hasEdge(int u, int v){
int e=0;
if(a[u])swap(v, u);
if(!a[u]){
a[v]--;
if(!a[v]) for (int i=1; i<=n; i++)a[i]+=(!b[v][i]&&(i!=v));
}else b[v][u]=b[u][v]=1;
return e;
}