# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
926884 | Nurislam | 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 "game.h"
#include <bits/stdc++.h>
//~ #include "grader.cpp"
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define int long long
///* __ __ __ */
///* ====== _ /| /| __ _ / | | /| | @ | | | | / /| |\ | / | | @ | / */
///* \- || |_| |_ / |/ | | | |_ |- | |--| /-| | | \ \ |==| |- /=| | \ | | |--| | |- */
///* || | | |_ / | |__| _| |_ \__ | | / | |__ | __| | | | \ / | | \| \__ | | | | \ */
///*
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
const int N = 1600;
set<int> g[N];
void initialize(int n) {
for(int i = 0; i < n; i++){
for(int j = i+1; j < n; j++){
g[i].insert(j);
g[j].insert(i);
}
}
}
int hasEdge(int u, int v) {
if(g[u].size() == 1)return 1;
g[u].erase(v);
g[v].erase(u);
return 0;
}