Submission #928619

#	Time	Username	Problem	Language	Result	Execution time	Memory
928619		OAleksa	Game (IOI14_game)	C++14	100 / 100	247 ms	26456 KiB

game

#include "game.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1569;
int n, p[N], sz[N], c[N][N];
int root(int v) {
   if (p[v] == v)
      return v;
   return p[v] = root(p[v]);
}
void initialize(int n1) {
   n = n1;
   for (int i = 0;i < n;i++) {
      p[i] = i, sz[i] = 1;
   }
   for (int i = 0;i < n;i++) {
      for (int j = 0;j < n;j++) {
         if (i == j)
            continue;
         c[i][j] = 1;
      }
   }
}

int hasEdge(int u, int v) {
   int a = root(u);
   int b = root(v);
   --c[a][b], --c[b][a];
   if (a == b)
      return 1;
   if (c[a][b] > 0)
      return 0;
   if (sz[a] < sz[b])
      swap(a, b);
   p[b] = a;
   sz[a] += sz[b];
   for (int i = 0;i < n;i++) {
      if (i == a || i == b)
         continue;
      c[a][i] += c[b][i];
      c[i][a] += c[b][i];
   }
   return 1;
}

• Subtask 1: 15 / 15
• Subtask 2: 27 / 27
• Subtask 3: 58 / 58