제출 #876016

#제출 시각아이디문제언어결과실행 시간메모리
876016Darren0724게임 (IOI14_game)C++17
0 / 100
1 ms2496 KiB
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
const int N=1500;
int c[N][N];
int pa[N];
int Find(int k){
    if(pa[k]==k){
        return k;
    }
    return pa[k]=Find(pa[k]);
}
void onion(int a,int b){
    pa[b]=a;
    for(int i=0;i<N;i++){
        if(i==Find(i))c[a][i]+=c[b][i];
    }
    
}
void initialize(int n) {
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(i!=j)c[i][j]=1;
        }
        pa[i]=i;
    }
}

int hasEdge(int u, int v) {
    if(u>v)swap(u,v);
    c[u][v]--;
    c[v][u]--;
    if(!c[u][v]){
        onion(u,v);
        return 1;
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...