oj.uz

Submission #30452

# Submission time Handle Problem Language Result Execution time Memory
30452 2017-07-23T11:30:53 Z ozaslan Game (IOI14_game) C++14
15 / 100
 0 ms 18712 KB 
#include "game.h"
using namespace std;

int p[1500], rank[1500], s[1500];
int dp[1500][1500], N;


void linkSet(int x, int y) {
	if (rank[x] > rank[y]) {
		p[y] = x;
		s[x] += s[y];

		for(int i = 0; i < N; i++)
			dp[x][i] += dp[y][i];
	}

	else {
		p[x] = y;
		rank[y]++;
		s[y] += s[x];

		for(int i = 0; i < N; i++)
			dp[y][i] += dp[x][i];
		for(int i = 0; i < N; i++)
			dp[x][i] += dp[y][i];
	}
}
int findSet(int x) {
	if(x != p[x])
		p[x] = findSet(p[x]);
	return p[x];
}
void makeSet(int x) {p[x] = x, rank[x] = 0, s[x] = 1; }
void unionSet(int x, int y) { linkSet(findSet(x), findSet(y)); }


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


int hasEdge(int u, int v) {
	int x = findSet(u);
	int y = findSet(v);
	
	if(x == y) return 0;

	if(dp[x][y] == s[x]*s[y]-1) {
		unionSet(x, y);
		return 1;
	}

	dp[x][y]++;
	dp[y][x]++;
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 18712 KB Output is correct
2 Correct 0 ms 18712 KB Output is correct
3 Correct 0 ms 18712 KB Output is correct
4 Correct 0 ms 18712 KB Output is correct
5 Correct 0 ms 18712 KB Output is correct
6 Correct 0 ms 18712 KB Output is correct
7 Correct 0 ms 18712 KB Output is correct
8 Correct 0 ms 18712 KB Output is correct
9 Correct 0 ms 18712 KB Output is correct
10 Correct 0 ms 18712 KB Output is correct
11 Correct 0 ms 18712 KB Output is correct
12 Correct 0 ms 18712 KB Output is correct
13 Correct 0 ms 18712 KB Output is correct
14 Correct 0 ms 18712 KB Output is correct
15 Correct 0 ms 18712 KB Output is correct
16 Correct 0 ms 18712 KB Output is correct
17 Correct 0 ms 18712 KB Output is correct
18 Correct 0 ms 18712 KB Output is correct
19 Correct 0 ms 18712 KB Output is correct
20 Correct 0 ms 18712 KB Output is correct
21 Correct 0 ms 18712 KB Output is correct
22 Correct 0 ms 18712 KB Output is correct
23 Correct 0 ms 18712 KB Output is correct
24 Correct 0 ms 18712 KB Output is correct

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 18712 KB Output is correct
2 Correct 0 ms 18712 KB Output is correct
3 Correct 0 ms 18712 KB Output is correct
4 Correct 0 ms 18712 KB Output is correct
5 Correct 0 ms 18712 KB Output is correct
6 Correct 0 ms 18712 KB Output is correct
7 Correct 0 ms 18712 KB Output is correct
8 Correct 0 ms 18712 KB Output is correct
9 Correct 0 ms 18712 KB Output is correct
10 Correct 0 ms 18712 KB Output is correct
11 Correct 0 ms 18712 KB Output is correct
12 Correct 0 ms 18712 KB Output is correct
13 Correct 0 ms 18712 KB Output is correct
14 Correct 0 ms 18712 KB Output is correct
15 Correct 0 ms 18712 KB Output is correct
16 Correct 0 ms 18712 KB Output is correct
17 Correct 0 ms 18712 KB Output is correct
18 Correct 0 ms 18712 KB Output is correct
19 Correct 0 ms 18712 KB Output is correct
20 Correct 0 ms 18712 KB Output is correct
21 Correct 0 ms 18712 KB Output is correct
22 Correct 0 ms 18712 KB Output is correct
23 Correct 0 ms 18712 KB Output is correct
24 Correct 0 ms 18712 KB Output is correct
25 Incorrect 0 ms 18712 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 18712 KB Output is correct
2 Correct 0 ms 18712 KB Output is correct
3 Correct 0 ms 18712 KB Output is correct
4 Correct 0 ms 18712 KB Output is correct
5 Correct 0 ms 18712 KB Output is correct
6 Correct 0 ms 18712 KB Output is correct
7 Correct 0 ms 18712 KB Output is correct
8 Correct 0 ms 18712 KB Output is correct
9 Correct 0 ms 18712 KB Output is correct
10 Correct 0 ms 18712 KB Output is correct
11 Correct 0 ms 18712 KB Output is correct
12 Correct 0 ms 18712 KB Output is correct
13 Correct 0 ms 18712 KB Output is correct
14 Correct 0 ms 18712 KB Output is correct
15 Correct 0 ms 18712 KB Output is correct
16 Correct 0 ms 18712 KB Output is correct
17 Correct 0 ms 18712 KB Output is correct
18 Correct 0 ms 18712 KB Output is correct
19 Correct 0 ms 18712 KB Output is correct
20 Correct 0 ms 18712 KB Output is correct
21 Correct 0 ms 18712 KB Output is correct
22 Correct 0 ms 18712 KB Output is correct
23 Correct 0 ms 18712 KB Output is correct
24 Correct 0 ms 18712 KB Output is correct
25 Incorrect 0 ms 18712 KB Output isn't correct
26 Halted 0 ms 0 KB -