제출 #1012427

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1012427		c2zi6	게임 (IOI14_game)	C++14	100 / 100	234 ms	26448 KiB

game

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "game.h"

const int MAXN = 1530;
int par[MAXN];
int qani[MAXN][MAXN];
int n;

int get(int u) {
    return par[u] = (u == par[u] ? u : get(par[u]));
}
int join(int u, int v) {
    u = get(u);
    v = get(v);
    if (rand()%2) swap(u, v);
    par[v] = u;
    return u;
}

void initialize(int N) {
    srand(time(0));
    n = N;
    rep(i, n) par[i] = i;
    rep(i, n) rep(j, n) qani[i][j] = 1;
}

int hasEdge(int u, int v) {
    int a = get(u);
    int b = get(v);
    if (a == b) return false;
    if (qani[a][b] == 1) {
        int c = join(a, b);
        rep(x, n) if (x == par[x] && x != c) {
            qani[c][x] = qani[x][c] = qani[a][x] + qani[b][x];
        }
        return true;
    }
    qani[a][b]--;
    qani[b][a]--;
    return false;
}

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