Submission #600516

#	Time	Username	Problem	Language	Result	Execution time	Memory
600516		wiwiho	Game (IOI14_game)	C++14	100 / 100	404 ms	25400 KiB

game

#include "game.h"

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

vector<int> dsu, sz;
vector<vector<int>> e;
int n;

int findDSU(int a){
    if(dsu[a] != a) dsu[a] = findDSU(dsu[a]);
    return dsu[a];
}

void unionDSU(int a, int b){
    a = findDSU(a);
    b = findDSU(b);
    if(a == b) return;
    vector<int> cnt(n);
    for(int i = 0; i < n; i++){
        cnt[i] = e[b][i];
        e[b][i] -= cnt[i];
        if(i != b) e[i][b] -= cnt[i];
    }
    for(int i = 0; i < n; i++){
        if(i == a) continue;
        e[a][i] += cnt[i];
        e[i][a] += cnt[i];
    }
    dsu[b] = a;
    sz[a] += sz[b];
}

void initialize(int _n){
    n = _n;
    dsu.resize(n);
    iota(iter(dsu), 0);
    e.resize(n, vector<int>(n));
    sz.resize(n, 1);
}

int hasEdge(int u, int v){
    u = findDSU(u);
    v = findDSU(v);
    if(u == v) return 0;
    
    e[u][v]++;
    e[v][u]++;
    if(e[u][v] != sz[u] * sz[v]) return 0;
    
    unionDSU(u, v);
    return 1;
}

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