제출 #643777

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
643777		jiahng	Game (IOI14_game)	C++14	0 / 100	1 ms	308 KiB

game

#include "game.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int32_t, int32_t> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 200010
#define INF (ll)1e9
#define MOD 1000000007
typedef pair <vi, int> pvi;
typedef pair <int,pi> ipi;
typedef vector <pii> vpii;

int p[maxn], ncomp;
int fl(int x){
    if (p[x] == x) return x;
    return p[x] = fl(p[x]);
}
void initialize(int n) {
    FOR(i,0,n-1) p[i] = i;
    ncomp = n;
}

int hasEdge(int u, int v) {
    if (ncomp == 2) return 0;
    else{
        if (fl(u) != fl(v)) ncomp--;
        p[fl(u)] = fl(v);
        return 1;
    }
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 27
• Subtask 3: 0 / 58