oj.uz

답안 #627199

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
627199 2022-08-12T11:19:54 Z model_code 디지털 회로 (IOI22_circuit) C++17
100 / 100
 1490 ms 21924 KB 
// correct/solution-prabowo-count-degrees.cpp
// O((N + M)^(1.5) + Q log M)

#include "circuit.h"

#include <algorithm>
#include <functional>
#include <utility>
#include <vector>

const int kMod = 1000002022;

int N;

struct SegTree {
 private:
  int n;
  struct Node {
    int val[2];
    bool lazy;
    Node(int v0=0, int v1=0) {
      val[0] = v0;
      val[1] = v1;
      lazy = false;
    }

    Node operator + (const Node &other) {
      return Node((val[0] + other.val[0]) % kMod,
                  (val[1] + other.val[1]) % kMod);
    }
  };
  std::vector<Node> nodes;

  inline void toggle(int idx) {
    std::swap(nodes[idx].val[0], nodes[idx].val[1]);
    nodes[idx].lazy = !nodes[idx].lazy;
  }

  inline void pull(int idx, int l, int r) {
    int mid = (l + r) >> 1;
    nodes[idx] = nodes[idx + 1] + nodes[idx + (mid - l) * 2];
  }

  inline void push(int idx, int l, int r) {
    if (!nodes[idx].lazy) return;
    int mid = (l + r) >> 1;
    toggle(idx + 1);
    toggle(idx + (mid - l) * 2);
    nodes[idx].lazy = false;
  }

  void build(int idx, int l, int r, const std::vector<std::pair<int, int>> &v) {
    if (l + 1 == r) {
      nodes[idx] = Node(v[l].first, v[l].second);
      return;
    }
    int mid = (l + r) >> 1;
    build(idx + 1, l, mid, v);
    build(idx + (mid - l) * 2, mid, r, v);
    pull(idx, l, r);
  }

  void update(int idx, int l, int r, int ll, int rr) {
    if (l >= rr || r <= ll) {
      return;
    }
    if (l >= ll && r <= rr) {
      return toggle(idx);
    }
    push(idx, l, r);
    int mid = (l + r) >> 1;
    update(idx + 1, l, mid, ll, rr);
    update(idx + (mid - l) * 2, mid, r, ll, rr);
    pull(idx, l, r);
  }

 public:
  void init(const std::vector<std::pair<int, int>> &v) {
    n = static_cast<int>(v.size());
    nodes.resize(2 * n - 1);
    build(0, 0, n, v);
  }

  void update(int l, int r) {
    update(0, 0, n, l, r);
  }

  int query() {
    return nodes[0].val[1];
  }
} segtree;

void init(int _N, int M, std::vector<int> P, std::vector<int> A) {
  N = _N;
  std::vector<std::vector<int>> adj(N + M);
  for (int i = 1; i < N + M; ++i) {
    adj[P[i]].push_back(i);
  }

  std::vector<int> degreeCount(N + M);
  for (int i = 0; i < N; ++i) {
    ++degreeCount[adj[i].size()];
  }
  std::vector<int> degrees;
  for (int deg = 0; deg < N + M; ++deg) {
    if (degreeCount[deg] > 0) {
      degrees.push_back(deg);
    }
  }

  std::vector<std::vector<int>> multiplication(degrees.size());
  for (int i = 0; i < static_cast<int>(degrees.size()); ++i) {
    int deg = degrees[i];
    multiplication[i].resize(degreeCount[deg] + 1);
    multiplication[i][0] = 1;
    for (int j = 1; j <= degreeCount[deg]; ++j) {
      multiplication[i][j] = static_cast<long long>(multiplication[i][j - 1]) *
          deg % kMod;
    }
  }

  std::vector<int> contribution(M);
  std::function<void(int)> dfs = [&](int u) {
    if (u >= N) {
      long long product = 1;
      for (int i = 0; i < static_cast<int>(degrees.size()); ++i) {
        int deg = degrees[i];
        product = product * multiplication[i][degreeCount[deg]] % kMod;
      }
      contribution[u - N] = product;
      return;
    }
    --degreeCount[adj[u].size()];
    for (int v : adj[u]) {
      dfs(v);
    }
    ++degreeCount[adj[u].size()];
  };
  dfs(0);

  std::vector<std::pair<int, int>> v(M);
  for (int i = 0; i < M; ++i) {
    if (A[i]) {
      v[i].second = contribution[i];
    } else {
      v[i].first = contribution[i];
    }
  }
  segtree.init(v);
}

int count_ways(int L, int R) {
  segtree.update(L - N, R - N + 1);
  return segtree.query();
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 372 KB Output is correct
6 Correct 1 ms 368 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 384 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 236 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 336 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 372 KB Output is correct
6 Correct 1 ms 368 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 236 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 372 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 420 KB Output is correct
33 Correct 1 ms 376 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 504 KB Output is correct
37 Correct 1 ms 512 KB Output is correct
38 Correct 1 ms 512 KB Output is correct
39 Correct 1 ms 376 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 384 KB Output is correct

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 671 ms 5164 KB Output is correct
2 Correct 1113 ms 10052 KB Output is correct
3 Correct 1160 ms 10012 KB Output is correct
4 Correct 893 ms 10044 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 671 ms 5164 KB Output is correct
2 Correct 1113 ms 10052 KB Output is correct
3 Correct 1160 ms 10012 KB Output is correct
4 Correct 893 ms 10044 KB Output is correct
5 Correct 994 ms 5156 KB Output is correct
6 Correct 1282 ms 10064 KB Output is correct
7 Correct 1178 ms 10024 KB Output is correct
8 Correct 1026 ms 9996 KB Output is correct
9 Correct 534 ms 572 KB Output is correct
10 Correct 1110 ms 896 KB Output is correct
11 Correct 918 ms 880 KB Output is correct
12 Correct 977 ms 848 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 236 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 671 ms 5164 KB Output is correct
14 Correct 1113 ms 10052 KB Output is correct
15 Correct 1160 ms 10012 KB Output is correct
16 Correct 893 ms 10044 KB Output is correct
17 Correct 994 ms 5156 KB Output is correct
18 Correct 1282 ms 10064 KB Output is correct
19 Correct 1178 ms 10024 KB Output is correct
20 Correct 1026 ms 9996 KB Output is correct
21 Correct 534 ms 572 KB Output is correct
22 Correct 1110 ms 896 KB Output is correct
23 Correct 918 ms 880 KB Output is correct
24 Correct 977 ms 848 KB Output is correct
25 Correct 1158 ms 14860 KB Output is correct
26 Correct 1207 ms 15152 KB Output is correct
27 Correct 1185 ms 15112 KB Output is correct
28 Correct 862 ms 15096 KB Output is correct
29 Correct 1198 ms 21448 KB Output is correct
30 Correct 1145 ms 21348 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 372 KB Output is correct
6 Correct 1 ms 368 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 236 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 372 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 420 KB Output is correct
33 Correct 1 ms 376 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 504 KB Output is correct
37 Correct 1 ms 512 KB Output is correct
38 Correct 1 ms 512 KB Output is correct
39 Correct 1 ms 376 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 784 ms 720 KB Output is correct
44 Correct 663 ms 720 KB Output is correct
45 Correct 839 ms 720 KB Output is correct
46 Correct 823 ms 976 KB Output is correct
47 Correct 842 ms 1004 KB Output is correct
48 Correct 1114 ms 976 KB Output is correct
49 Correct 1117 ms 976 KB Output is correct
50 Correct 1075 ms 976 KB Output is correct
51 Correct 648 ms 696 KB Output is correct
52 Correct 1018 ms 688 KB Output is correct
53 Correct 949 ms 876 KB Output is correct
54 Correct 1058 ms 1024 KB Output is correct
55 Correct 1032 ms 876 KB Output is correct
56 Correct 690 ms 768 KB Output is correct
57 Correct 1008 ms 676 KB Output is correct
58 Correct 979 ms 1280 KB Output is correct
59 Correct 937 ms 1360 KB Output is correct
60 Correct 964 ms 1360 KB Output is correct
61 Correct 744 ms 764 KB Output is correct
62 Correct 824 ms 592 KB Output is correct
63 Correct 941 ms 668 KB Output is correct
64 Correct 777 ms 692 KB Output is correct
65 Correct 453 ms 568 KB Output is correct
66 Correct 984 ms 848 KB Output is correct
67 Correct 1048 ms 848 KB Output is correct
68 Correct 998 ms 848 KB Output is correct

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 372 KB Output is correct
6 Correct 1 ms 368 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 236 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 372 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 420 KB Output is correct
33 Correct 1 ms 376 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 504 KB Output is correct
37 Correct 1 ms 512 KB Output is correct
38 Correct 1 ms 512 KB Output is correct
39 Correct 1 ms 376 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 671 ms 5164 KB Output is correct
44 Correct 1113 ms 10052 KB Output is correct
45 Correct 1160 ms 10012 KB Output is correct
46 Correct 893 ms 10044 KB Output is correct
47 Correct 994 ms 5156 KB Output is correct
48 Correct 1282 ms 10064 KB Output is correct
49 Correct 1178 ms 10024 KB Output is correct
50 Correct 1026 ms 9996 KB Output is correct
51 Correct 534 ms 572 KB Output is correct
52 Correct 1110 ms 896 KB Output is correct
53 Correct 918 ms 880 KB Output is correct
54 Correct 977 ms 848 KB Output is correct
55 Correct 1158 ms 14860 KB Output is correct
56 Correct 1207 ms 15152 KB Output is correct
57 Correct 1185 ms 15112 KB Output is correct
58 Correct 862 ms 15096 KB Output is correct
59 Correct 1198 ms 21448 KB Output is correct
60 Correct 1145 ms 21348 KB Output is correct
61 Correct 784 ms 720 KB Output is correct
62 Correct 663 ms 720 KB Output is correct
63 Correct 839 ms 720 KB Output is correct
64 Correct 823 ms 976 KB Output is correct
65 Correct 842 ms 1004 KB Output is correct
66 Correct 1114 ms 976 KB Output is correct
67 Correct 1117 ms 976 KB Output is correct
68 Correct 1075 ms 976 KB Output is correct
69 Correct 648 ms 696 KB Output is correct
70 Correct 1018 ms 688 KB Output is correct
71 Correct 949 ms 876 KB Output is correct
72 Correct 1058 ms 1024 KB Output is correct
73 Correct 1032 ms 876 KB Output is correct
74 Correct 690 ms 768 KB Output is correct
75 Correct 1008 ms 676 KB Output is correct
76 Correct 979 ms 1280 KB Output is correct
77 Correct 937 ms 1360 KB Output is correct
78 Correct 964 ms 1360 KB Output is correct
79 Correct 744 ms 764 KB Output is correct
80 Correct 824 ms 592 KB Output is correct
81 Correct 941 ms 668 KB Output is correct
82 Correct 777 ms 692 KB Output is correct
83 Correct 453 ms 568 KB Output is correct
84 Correct 984 ms 848 KB Output is correct
85 Correct 1048 ms 848 KB Output is correct
86 Correct 998 ms 848 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 495 ms 13444 KB Output is correct
89 Correct 1083 ms 9536 KB Output is correct
90 Correct 1072 ms 9452 KB Output is correct
91 Correct 885 ms 15244 KB Output is correct
92 Correct 1115 ms 15160 KB Output is correct
93 Correct 948 ms 15256 KB Output is correct
94 Correct 762 ms 15272 KB Output is correct
95 Correct 1018 ms 15208 KB Output is correct
96 Correct 892 ms 8560 KB Output is correct
97 Correct 1166 ms 8660 KB Output is correct
98 Correct 714 ms 13592 KB Output is correct
99 Correct 1292 ms 15112 KB Output is correct
100 Correct 708 ms 11628 KB Output is correct
101 Correct 930 ms 10324 KB Output is correct
102 Correct 1490 ms 8552 KB Output is correct
103 Correct 1084 ms 21288 KB Output is correct
104 Correct 1145 ms 21924 KB Output is correct
105 Correct 859 ms 21832 KB Output is correct
106 Correct 1277 ms 10312 KB Output is correct
107 Correct 924 ms 8368 KB Output is correct
108 Correct 1059 ms 8596 KB Output is correct
109 Correct 1061 ms 8648 KB Output is correct