제출 #241110

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
241110		ant101	게임 (IOI14_game)	C++14	100 / 100	563 ms	25464 KiB

game

#include <iostream>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <cmath>
#include <vector>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <stack>
#include <queue>
#include <assert.h>
#include <limits>
#include <cstdio>
#include "game.h"
using namespace std;

//#define RDEBUG 1
#ifdef RDEBUG
#define D(x) x
#else
#define D(x)
#endif
#define inf 0x7fffffff
#define MOD 1000000007

typedef long long ll;


ll add(ll a, ll b) {
    a += b;
    if(a >= MOD) {
        a -= MOD;
    }
    return a;
}
ll sub(ll a, ll b) {
    a -= b;
    if(a < 0) {
        a += MOD;
    }
    return a;
}

ll mul(ll a, ll b) {
    return (a * b)%MOD;
}

void add_self(ll& a, ll b) {
    a = add(a, b);
}
void sub_self(ll& a, ll b) {
    a = sub(a, b);
}
void mul_self(ll& a, ll b) {
    a = mul(a, b);
}


const ll MAXN = 200010;

int m;
int cnt[1505][1505];

struct disj{
    int pa[1505], size[1505];
    void init(int n) {
        for(int i=0; i<n; i++) pa[i] = i, size[i] = 1;
    }
    int find(int x){
        return pa[x] = (pa[x] == x ? x : find(pa[x]));
    }
    void uni(int p, int q){
        pa[q] = p;
        size[p] += size[q];
    }
    int get_size(int x){
        return size[find(x)];
    }
}disj;

void initialize(int n){
    m = n;
    disj.init(n);
}

int hasEdge(int u, int v){
    u = disj.find(u);
    v = disj.find(v);
    cnt[u][v]++;
    cnt[v][u]++;
    if(cnt[u][v] == disj.get_size(u) * disj.get_size(v)){
        disj.pa[v] = u;
        disj.size[u] += disj.size[v];
        for (int i=0; i<m; i++) {
            cnt[u][i] += cnt[v][i];
            cnt[i][u] += cnt[i][v];
        }
        return 1;
    }
    return 0;
}

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