oj.uz

Submission #23690

# Submission time Handle Problem Language Result Execution time Memory
23690 2017-05-21T10:49:32 Z Hiasat Game (IOI14_game) C++14
0 / 100
 0 ms 10824 KB 
#include "game.h"
#include <iostream>
#include <cstdio>
#include <set>
#include <vector>

using namespace std;

int dsu[2010];
int rem[2010];

int find(int u){
	return dsu[u] == u ? u : dsu[u] = find(dsu[u]);
}
void initialize(int n) {
	for (int i = 0; i < n; ++i){
		dsu[i] = i;
		rem[i] = n-1;
	}
}

int hasEdge(int u, int v) {
	int a = find(u);
	int b = find(v);
	rem[a]--;
	rem[b]--;
	if(a == b){
		return 0;
	}
	if(rem[a] == 0 || rem[b] == 0){
		rem[b] += rem[a];
		dsu[a] = b;
		return 1;
	}
    return 0;
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 27.0

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

Subtask #3
0 / 58.0

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