oj.uz

Submission #381626

# Submission time Handle Problem Language Result Execution time Memory
381626 2021-03-25T11:24:30 Z ritul_kr_singh Game (IOI14_game) C++17
0 / 100
 1 ms 364 KB 
#include "game.h"
#include "bits/stdc++.h"
using namespace std;

vector<int> e;
int n;
int find(int u){
	return e[u] < 0 ? u : e[u] = find(e[u]);
}
int sz(int u){
	return -e[find(u)];
}
void unite(int u, int v){
	u = find(u), v = find(v);
	if(u==v) return;
	if(e[u] > e[v]) swap(u, v);
	e[u] += e[v], e[v] = u;
	--n;
}


void initialize(int N){
	n = N;
	e.assign(n+1, -1);
}

int hasEdge(int u, int v){
	if(find(u)==find(v) or n>1){
		unite(u, v);
		return 1;
	}
	return 0;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -