oj.uz

답안 #109804

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
109804 2019-05-08T05:12:10 Z arman_ferdous 게임 (IOI14_game) C++17
0 / 100
 3 ms 512 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 1510;
int p[N], cnt[N];

void initialize(int n) {
	for(int i = 0; i <= n; i++)
		p[i] = i, cnt[i] = n-1;
}

int find(int u) {
	if(p[u] == u) return u;
	return p[u] = find(p[u]);
}

int hasEdge(int u, int v) {
	cnt[u]--;
	cnt[v]--;
    if(find(u) == find(v)) {
    	return 0;
    }
    if(cnt[u] == 0 || cnt[v] == 0) {
    	p[find(u)] = find(v);
    	return 1;
    } return 0;
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Incorrect 2 ms 384 KB Output isn't correct
5 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 376 KB Output is correct
4 Incorrect 2 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -