oj.uz

답안 #120452

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
120452 2019-06-24T14:02:54 Z anayk 게임 (IOI14_game) C++14
0 / 100
 2 ms 412 KB 
#include <iostream>

#define MAXN 2000

int N;
int cross[MAXN][MAXN];
int par[MAXN];

int root(int u)
{
	if(par[u] < 0)
		return u;
	par[u] = root(par[u]);
	return par[u];
}

void merge(int u, int v)
{
	if(par[u] > par[v])
		u ^= v ^= u ^= v;

	par[u] += par[v];
	par[v] = u;

	for(int i = 0; i < N; i++)
	{
		cross[u][i] += cross[v][i];
		cross[i][u] = cross[u][i];
	}
}

void initialize(int n)
{
	N = n;

	for(int i = 0; i < N; i++)
		par[i] = -1;
}

int hasEdge(int u, int v)
{
	int x = root(u);
	int y = root(v);

	if(cross[x][y] + 1 == par[x]*par[y])
	{
		merge(x, y);
		return 1;
	}
	else
	{
		cross[x][y]++;
		return 0;
	}
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 368 KB Output is correct
7 Incorrect 2 ms 412 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Incorrect 1 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 356 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Incorrect 2 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -