Submission #1366562

#TimeUsernameProblemLanguageResultExecution timeMemory
1366562enzyGame (IOI14_game)C++20
100 / 100
160 ms15952 KiB
#include "game.h"
#include<bits/stdc++.h>
using namespace std;


const int maxn=1510;
int qtd[maxn][maxn], pai[maxn], N;

int find(int a){
    if(pai[a]==a) return a;
    return pai[a]=find(pai[a]);
}

void merge(int a, int b){
    pai[a]=b;
    qtd[a][b]=qtd[b][a]=0;
    for(int i=0;i<N;i++) if(i!=a&&i!=b) qtd[b][i]+=qtd[a][i];
    for(int i=0;i<N;i++) if(i!=a&&i!=b) qtd[i][b]=qtd[i][a]+qtd[i][b];
}

void initialize(int n){
    N=n;
    for(int i=0;i<n;i++){
        pai[i]=i;
        for(int j=0;j<n;j++) if(i!=j) qtd[i][j]=1;
    }
}

int hasEdge(int u, int v){
    u=find(u); v=find(v);
    // cerr << "! " << u << ' ' << v << " -> " << qtd[u][v] << ' ' << qtd[v][u] << '\n';
    if(qtd[u][v]==1){
        merge(u,v);
        return 1;
    }else{
        qtd[u][v]--; 
        qtd[v][u]--;
        return 0;
    }
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...