제출 #1151296

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1151296		AmirMakaM	게임 (IOI14_game)	C++20	0 / 100	0 ms	328 KiB

game

#include <bits/stdc++.h>
#include "game.h"
using namespace std;
#define ull unsigned long long
#define ll long long
#define ld long double
#define pb push_back
#define f first
#define s second 
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define pii pair<int,int> 
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define pdd pair<double,double>
#define mp make_pair   
#define AmirMakaM ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
// solve it
const ull SEED = chrono::steady_clock::now().time_since_epoch().count();
mt19937_64 mrand(SEED);
ull rnd(ull x = ~(0ull)) {return mrand() % x;} 
const ll MOD = 998244353;
const ll INF = 1e16+20;
const int inf = 1e9 + 7;
const ll N = 3e5+1;
const ll M = 2e3+1;
const double pi = 2*acos(0.0);
const int dx[] = {1,-1,0,0}, dy[] = {0,0,1,-1};

int n, p[1500], sz[1500];

int get(int x) {
    return p[x] = (p[x] == x ? x : get(p[x]));
}

void initialize(int N) {
    n = N;
    for(int i=0; i<n; i++) {
        p[i] = i, sz[i] = 1;
    }
}

int hasEdge(int a, int b) {
    int x = get(a), y = get(b);
    if(x!=y && sz[x] + sz[y] == n) {
        return 0;
    } else {
        if(sz[x] > sz[y]) swap(x,y);
        p[x] = y;
        sz[y] += sz[x];
        return 1;
    }
}

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