제출 #1123139

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1123139		SalihSahin	게임 (IOI14_game)	C++20	100 / 100	445 ms	16104 KiB

game

#include <bits/stdc++.h>
#define pb push_back
//#define int long long
using namespace std;
#include "game.h"


int N;
vector<int> par;

struct DSU{
    vector<int> arr;
};

vector<DSU> dsuarr;
vector<vector<int> > edge;

int fnd(int a){
    if(a == par[a]) return a;
    else return par[a] = fnd(par[a]);
}

void merge(int a, int b){
    int olda = a, oldb = b;
    a = fnd(a), b = fnd(b);

    par[b] = a;
    for(auto itr: dsuarr[b].arr){
        dsuarr[a].arr.pb(itr);
    }
    edge[olda][oldb] = edge[oldb][olda] = 1;
}

void initialize(int n) {
    N = n;
    edge.resize(n);
    for(int i = 0; i < n; i++){
        edge[i].resize(n);
        edge[i][i] = -1;
    }
    dsuarr.resize(n);
    for(int i = 0; i < n; i++){
        dsuarr[i].arr.pb(i);
    }
    par.resize(n);
    for(int i = 0; i < n; i++){
        par[i] = i;
    }
}


int hasEdge(int u, int v) {
    int uset = fnd(u), vset = fnd(v);

    int choices = 0;
    for(auto itr: dsuarr[uset].arr){
        for(auto itr2: dsuarr[vset].arr){
            if(edge[itr][itr2] == 0) choices++;
            if(choices > 1) break;
        }
        if(choices > 1) break;
    }

    if(choices == 1){
        merge(u, v);
        return 1;
    }
    else{
        edge[u][v] = edge[v][u] = -1;
        return 0;
    }
    return 0;
}

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