oj.uz

Submission #48312

# Submission time Handle Problem Language Result Execution time Memory
48312 2018-05-11T16:38:18 Z jeong Game (IOI14_game) C++17
0 / 100
 2 ms 484 KB 
#include <stdio.h>
#define N (1500)
int deg[N], par[N];
bool visit[N];
void initialize(int n){for(int i=0; i<n; i++)par[i]=i,deg[i]=n-1,visit[i]=false;}
int find(int x){
	if(par[x] == x)return x;
	return par[x] = find(par[x]);
}
int hasEdge(int u, int v){
	u = find(u), v = find(v);
	if(!visit[u] && !visit[v]){
		visit[u]=visit[v]=true;
		deg[u] += deg[v]-2;
		deg[v]=0; par[v] = u;
		return 1;
	}
	if(u == v)return 0;
	else{
		if(deg[u] == 0 || deg[v] == 0){
			visit[u]=visit[v]=true;
			deg[u] += deg[v];
			deg[v] = 0;par[v] = u;
			return 1;
		}
		return 0;
	}
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 484 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 484 KB Output isn't correct
2 Halted 0 ms 0 KB -