# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
239153 | tleontest1 | 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 <cstdio>
#include <cassert>
//~ #include "game.h"
int read_int() {
int x;
assert(scanf("%d", &x) == 1);
return x;
}
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000016000000064;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int m,b[li],a[li],k,flag,t,cev,vis[li],cev1;
string s;
vector<int> v;
void initialize(int n) {
for(int i=0;i<n;i++)vis[i]=n-1;
}
int hasEdge(int u, int v) {
vis[u]--;
vis[v]--;
cev1++;
if(vis[u]==0 || vis[v]==0){
//~ vis[u]=0;
//~ vis[v]=0;
cev++;
return 1;
}
if(m*(m-1)/2-cev1<m-1-cev){cev++;return 1;}
return 0;
}
int main() {
int n, u, v;
n = read_int();
m=n;
initialize(n);
for (int i = 0; i < n * (n - 1) / 2; i++) {
u = read_int();
v = read_int();
printf("%d\n", hasEdge(u, v));
}
return 0;
}