oj.uz

Submission #49119

# Submission time Handle Problem Language Result Execution time Memory
49119 2018-05-22T13:07:07 Z doowey Game (IOI14_game) C++14
0 / 100
 3 ms 1008 KB 
#include "game.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 1509;
int sz[N];
int uni[N];
int y;

void initialize(int n) {
  y = n;
	for(int i = 0;i <= n;i ++ )
    sz[i] = 1,uni[i] = i;
}

int fin(int u){
  while(uni[u] != u){
    u = uni[u];
  }
  return u;
}

void join(int a,int b){
  if(sz[a] > sz[b])
    swap(a,b);
  uni[a] = b;
  sz[b] += sz[a];
}

int hasEdge(int u, int v) {
  u = fin(u);
  v = fin(v);
  if(u == v) 
    return 1; 
  if(sz[u] + sz[v] == y){
    return 0;
  }
  join(u,v);
  return 1;
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 27.0

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

Subtask #3
0 / 58.0

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