oj.uz

답안 #940742

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
940742 2024-03-07T14:40:09 Z evenvalue 게임 (IOI14_game) C++17
100 / 100
 286 ms 27400 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;

template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using max_heap = priority_queue<T, vector<T>, less<T>>;

using int64 = long long;
using ld = long double;

constexpr int kInf = 1e9 + 10;
constexpr int64 kInf64 = 1e15 + 10;
constexpr int kMod = 1e9 + 7;

class dsu {
  int n;
  std::vector<int> e;

  int pfind(const int x) {
    return (e[x] < 0 ? x : e[x] = pfind(e[x]));
  }

public:
  dsu() : n(0), comp(0) {}
  explicit dsu(const int n) : n(n), comp(n), e(n, -1) {}

  int comp;

  int find(const int x) {
    assert(0 <= x and x < n);
    return pfind(x);
  }

  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if (x == y) return false;
    if (e[x] > e[y]) swap(x, y);
    e[x] += e[y];
    e[y] = x;
    comp--;
    return true;
  }

  bool same(const int x, const int y) {
    return (find(x) == find(y));
  }

  int size(const int x) {
    return -e[find(x)];
  }

  std::vector<std::vector<int>> components() {
    std::vector<std::vector<int>> res(n);
    for (int x = 0; x < n; x++) {
      res[pfind(x)].push_back(x);
    }
    res.erase(
        std::remove_if(res.begin(), res.end(), [&](const std::vector<int> &v) { return v.empty(); }),
        res.end());
    return res;
  }
};

int n;
dsu d;
vector<vector<int>> edges;

void initialize(const int N) {
  n = N;
  d = dsu(n);
  edges = vector<vector<int>>(n, vector<int>(n));
}

int hasEdge(int x, int y) {
  x = d.find(x);
  y = d.find(y);

  edges[x][y]++, edges[y][x]++;
  const int cur = edges[x][y];
  const int req = d.size(x) * d.size(y);

  if (cur == req) {
    d.unite(x, y);
    if (x != d.find(x)) swap(x, y);
    for (int z = 0; z < n; z++) {
      if (d.find(z) != z) continue;
      edges[x][z] += edges[y][z];
      edges[z][x] += edges[z][y];
    }
  }

  return (cur == req);
}

Compilation message

game.cpp: In constructor 'dsu::dsu(int)':
game.cpp:29:7: warning: 'dsu::comp' will be initialized after [-Wreorder]
   29 |   int comp;
      |       ^~~~
game.cpp:19:20: warning:   'std::vector<int> dsu::e' [-Wreorder]
   19 |   std::vector<int> e;
      |                    ^
game.cpp:27:12: warning:   when initialized here [-Wreorder]
   27 |   explicit dsu(const int n) : n(n), comp(n), e(n, -1) {}
      |            ^~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 356 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 444 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 0 ms 440 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 456 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 2 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 2 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct

Subtask #3
58.0 / 58.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 444 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 352 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 444 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 496 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 456 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 504 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 2 ms 456 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 2 ms 344 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 34 ms 4688 KB Output is correct
56 Correct 28 ms 4520 KB Output is correct
57 Correct 29 ms 4692 KB Output is correct
58 Correct 29 ms 4620 KB Output is correct
59 Correct 29 ms 4700 KB Output is correct
60 Correct 29 ms 4692 KB Output is correct
61 Correct 28 ms 4540 KB Output is correct
62 Correct 31 ms 4700 KB Output is correct
63 Correct 29 ms 4692 KB Output is correct
64 Correct 28 ms 4700 KB Output is correct
65 Correct 28 ms 4844 KB Output is correct
66 Correct 36 ms 4684 KB Output is correct
67 Correct 32 ms 4720 KB Output is correct
68 Correct 32 ms 4688 KB Output is correct
69 Correct 29 ms 4688 KB Output is correct
70 Correct 30 ms 4696 KB Output is correct
71 Correct 28 ms 4628 KB Output is correct
72 Correct 29 ms 4536 KB Output is correct
73 Correct 30 ms 4692 KB Output is correct
74 Correct 28 ms 4956 KB Output is correct
75 Correct 29 ms 4692 KB Output is correct
76 Correct 65 ms 6740 KB Output is correct
77 Correct 83 ms 6736 KB Output is correct
78 Correct 65 ms 6880 KB Output is correct
79 Correct 66 ms 6744 KB Output is correct
80 Correct 66 ms 6740 KB Output is correct
81 Correct 65 ms 6748 KB Output is correct
82 Correct 67 ms 6788 KB Output is correct
83 Correct 64 ms 6740 KB Output is correct
84 Correct 76 ms 6812 KB Output is correct
85 Correct 116 ms 9904 KB Output is correct
86 Correct 114 ms 10064 KB Output is correct
87 Correct 114 ms 10064 KB Output is correct
88 Correct 113 ms 10068 KB Output is correct
89 Correct 114 ms 10068 KB Output is correct
90 Correct 123 ms 10312 KB Output is correct
91 Correct 122 ms 10064 KB Output is correct
92 Correct 115 ms 10104 KB Output is correct
93 Correct 129 ms 10124 KB Output is correct
94 Correct 257 ms 26376 KB Output is correct
95 Correct 257 ms 27000 KB Output is correct
96 Correct 286 ms 27172 KB Output is correct
97 Correct 273 ms 27168 KB Output is correct
98 Correct 255 ms 27000 KB Output is correct
99 Correct 257 ms 27140 KB Output is correct
100 Correct 266 ms 27400 KB Output is correct