Submission #947529

#	Time	Username	Problem	Language	Result	Execution time	Memory
947529		steveonalex	Game (IOI14_game)	C++11	100 / 100	311 ms	25468 KiB

game

#include <bits/stdc++.h>
#include "game.h"

 
using namespace std;

 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

struct DSU{
    int n;
    vector<int> parent, sz;

    DSU(int _n){
        n = _n;
        parent.resize(n+1); sz.resize(n+1, 1);
        for(int i = 0; i<=n; ++i) parent[i] = i;
    }

    int find_set(int u){return (u == parent[u]) ? u : (parent[u] = find_set(parent[u]));}
    bool same_set(int u, int v){return find_set(u) == find_set(v);}
    bool join_set(int u, int v){
        u = find_set(u), v = find_set(v);
        if (u != v){
            if (sz[u] < sz[v]) swap(u, v);
            parent[v] = u;
            sz[u] += sz[v];
            return true;
        }
        return false;
    }
};

const int N = 1505;
DSU G(N);
int cnt[N][N];

int n;
void initialize(int _n){
    n = _n;
    for(int i = 0; i<n; ++i)
    for(int j = i + 1; j<n; ++j) cnt[i][j] = cnt[j][i] = 1;
}

int hasEdge(int u, int v){
    u = G.find_set(u), v = G.find_set(v);
    if (u == v) return 0;
    cnt[u][v]--;
    cnt[v][u]--;
    if (cnt[u][v] > 0){
        return 0;
    }
    G.join_set(u, v);
    if (u != G.find_set(u)) swap(u, v);
    for(int i= 0; i<n; ++i){
        cnt[u][i] += cnt[v][i];
        cnt[i][u] += cnt[i][v];
        cnt[v][i] = cnt[i][v] = 0;
    }
    return 1;
}

// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     initialize(10);
//     for(int i= 0; i<n; ++i)
//     for(int j= i+1; j<n; ++j) {
//         if (hasEdge(i, j)) cout << i << " " << j << endl;
//     }

//     return 0;
// }

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