제출 #1236107

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1236107		Zbyszek99	Game (IOI14_game)	C++20	100 / 100	245 ms	15908 KiB

game

#include "game.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int rep_[1501];
int siz_[1501];
int n;

int fint(int v)
{
    if(rep_[v] == v) return v;
    rep_[v] = fint(rep_[v]);
    return rep_[v];
}

int edges[1501][1501];

void initialize(int N) 
{
    n = N;
    rep(i,n)
    {
        rep_[i] = i;
        siz_[i] = 1;
    }
}

void onion(int a, int b)
{
    a = fint(a);
    b = fint(b);
    rep(i,n)
    {
        if(fint(i) == i && fint(i) != a && fint(i) != b)
        {
            edges[i][b] += edges[i][a];
            edges[b][i] += edges[a][i];
        }
    }
    rep_[a] = b;
    siz_[b] += siz_[a];
}

int hasEdge(int u, int v) 
{
    if(siz_[fint(u)] * siz_[fint(v)] == edges[fint(u)][fint(v)]+1)
    {
        onion(u,v);
        return 1;
    }
    else
    {
        edges[fint(u)][fint(v)]++;
        edges[fint(v)][fint(u)]++;
        return 0;
    }
}

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