# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
741502 | josanneo22 | Game (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 <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define int long long
#include "game.h"
vector<int> cnt;
int cur_need;
void initialize(int n) {
cnt.resize(n);
cur_need=n-1;
for(int i=0;i<n;i++){
cnt[i]=0;
}
}
int hasEdge(int u, int v) {
int nw=max(u,v);
return ++cnt[nw]==nw;
}