Submission #595263

#	Time	Username	Problem	Language	Result	Execution time	Memory
595263		birthdaycake	Game (IOI14_game)	C++17	15 / 100	36 ms	47444 KiB

game

#include "game.h"
#include<bits/stdc++.h>
#define endl '\n'
#define mod 1000000007
using namespace std;

vector<int>cnt[2000001];
int adj[1501][1501];
int dsu[2000001],rnk[2000001];
set<pair<int,int>>d;
int N;
int Find(int x){
    if(dsu[x] == x) return x;
    return dsu[x] = Find(dsu[x]);
}

void Unite(int a, int b){
    a = Find(a); b = Find(b);
    if(rnk[a] < rnk[b]) swap(a,b);
    rnk[a] += rnk[b];
    dsu[b] = a;
    for(auto s: cnt[b]){
        adj[a][s] += adj[b][s];
    }
    
    
}
void initialize(int n) {
    N = n;
    for(int i = 1; i <= n; i++) {
        dsu[i] = i;
        rnk[i] = 1;
    }
    
}

int hasEdge(int u, int v) {
    u++; v++;
    int set_a = Find(u), set_b = Find(v);
    if(set_a == set_b) return 0;
    vector<int>x,y;
    
    cnt[set_a].push_back(set_b);
    cnt[set_b].push_back(set_a);
    adj[set_a][set_b]++;
    adj[set_b][set_a]++;
    if(adj[set_a][set_b] != rnk[set_b] * rnk[set_a]) return 0;
    if(adj[set_b][set_a] != rnk[set_a] * rnk[set_b]) return 0;
    Unite(u,v);
    
    return 1;
}

 

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