oj.uz

Submission #340730

# Submission time Handle Problem Language Result Execution time Memory
340730 2020-12-28T10:01:46 Z nandonathaniel Game (IOI14_game) C++14
0 / 100
 1 ms 364 KB 
#include "game.h"
#include "bits/stdc++.h"
using namespace std;

int par[1505],N;
int byk[1505];

int find(int x){
	if(par[x]==x)return x;
	return par[x]=find(par[x]);
}

void join(int a,int b){
	par[find(a)]=find(b);
}

void initialize(int n) {
	N=n;
	for(int i=0;i<n;i++)par[i]=i;
}

int hasEdge(int u, int v) {
	byk[u]++;byk[v]++;
	if(byk[u]==N-1 || byk[v]==N-1){
		join(u,v);
		return 1;
	}
	else return 0;
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 27.0

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

Subtask #3
0 / 58.0

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