Submission #835764

#	Time	Username	Problem	Language	Result	Execution time	Memory
835764		Lobo	게임 (IOI14_game)	C++17	42 / 100	1081 ms	121880 KiB

game

#include "game.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fr first
#define sc second

const int maxn = 1510;

int made[maxn][maxn], ds[maxn];
vector<int> dsv[maxn];
unordered_map<int,int> ask[maxn];

int find(int v) {
    if(v == ds[v]) return v;
    return ds[v] = find(ds[v]);
}

void join(int u, int v) {
    if(dsv[u].size() < dsv[v].size()) swap(u,v);
    for(auto x : dsv[v]) {
        dsv[u].pb(x);
    }
    for(auto X : ask[v]) {
        int x = X.fr;
        ask[u][x]+= ask[v][x];
        ask[x][u]+= ask[x][v];
    }
    ds[v] = u;
}

void initialize(int n) {
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            made[i][j] = 0;
            if(i != j) {
                ask[i][j] = 1;
                ask[j][i] = 1;
            }
        }
    }
    for(int i = 0; i < n; i++) {
        ds[i] = i;
        dsv[i].pb(i);
    }
}


int hasEdge(int u, int v) {
    made[u][v] = 1;
    made[v][u] = 1;
    u = find(u);
    v = find(v);
    ask[u][v]--;
    ask[v][u]--;
    if(find(u) == find(v)) return 0;
    // assert(u != v);

    bool ok = true;
    // for(auto x : dsv[u]) {
    //     for(auto y : dsv[v]) {
    //         if(made[x][y] == 0) ok = false;
    //     }
    // }

    if(ask[u][v] != 0) ok = false;

    if(ok) {
        join(u,v);
        return 1;
    }
    else {
        return 0;
    }
}

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