# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
442860 | ivandasfs | Game (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 <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#include "game.h"
using namespace std;
#define mp make_pair
#define pb push_back
#define x first
#define y second
typedef long long ll;
const ll INF = 1e9+5;
const ll MOD = 1e9+7;
int cnt[1505];
void initialize(int n) {
}
int hasEdge(int u, int v) {
if (u > v) swap(u, v);
cnt[u]++;
if (cnt[u] == n-u) return 1;
else return 0;
}