제출 #682074

#제출 시각아이디문제언어결과실행 시간메모리
682074t6twotwoGame (IOI14_game)C++17
42 / 100
1078 ms3320 KiB
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
int n;
vector<vector<bool>> qd;
vector<vector<int>> cnt, s;
vector<int> p;
int find(int x) {
  return x == p[x] ? x : p[x] = find(p[x]);
}
void unite(int u, int v) {
  u = find(u);
  v = find(v);
  if (s[u].size() > s[v].size()) {
    swap(u, v);
  }
  for (int x : s[u]) {
    p[x] = v;
    s[v].push_back(x);
  }
  for (int i = 0; i < n; i++) {
    if (i == v) {
      continue;
    }
    cnt[i][v] += cnt[i][u];
    cnt[v][i] += cnt[u][i];
  }
}
void initialize(int _n) {
  n = _n;
  qd = vector(n, vector<bool>(n));
  cnt = vector(n, vector<int>(n));
  s.resize(n);
  p.resize(n);
  for (int i = 0; i < n; i++) {
    p[i] = i;
    s[i].push_back(i);
  }
}
int hasEdge(int u, int v) {
  int a(find(u));
  int b(find(v));
  bool flag(true);
  for (int x : s[a]) {
    for (int y : s[b]) {
      if (x == u && y == v) {
        continue;
      }
      if (!qd[x][y]) {
        flag = false;
      }
    }
  }
  qd[u][v] = true;
  qd[v][u] = true;
  cnt[a][b]++;
  cnt[b][a]++;
  if (!flag) {
    return 0;
  }
  unite(u, v);
  return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...