oj.uz

Submission #627212

# Submission time Handle Problem Language Result Execution time Memory
627212 2022-08-12T11:20:53 Z model_code Digital Circuit (IOI22_circuit) C++17
46 / 100
 2500 ms 3656 KB 
// time_limit/solution-prabowo-quadratic-init.cpp
// O((N + M)^2 + 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<bool> path(N);
  std::vector<int> contribution(M, 1);
  std::function<void(int)> dfs = [&](int u) {
    if (u >= N) {
      for (int i = 0; i < N; ++i) {
        if (path[i]) continue;
        contribution[u - N] = 1LL * contribution[u - N] * adj[i].size() % kMod;
      }
      return;
    }
    path[u] = true;
    for (int v : adj[u]) {
      dfs(v);
    }
    path[u] = false;
  };
  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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 3 ms 336 KB Output is correct
4 Correct 3 ms 336 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 5 ms 336 KB Output is correct
7 Correct 9 ms 380 KB Output is correct
8 Correct 9 ms 336 KB Output is correct
9 Correct 9 ms 336 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 7 ms 460 KB Output is correct
12 Correct 8 ms 384 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Correct 3 ms 336 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 5 ms 336 KB Output is correct
15 Correct 9 ms 380 KB Output is correct
16 Correct 9 ms 336 KB Output is correct
17 Correct 9 ms 336 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 7 ms 460 KB Output is correct
20 Correct 8 ms 384 KB Output is correct
21 Correct 7 ms 336 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 3 ms 336 KB Output is correct
24 Correct 9 ms 384 KB Output is correct
25 Correct 8 ms 376 KB Output is correct
26 Correct 9 ms 376 KB Output is correct
27 Correct 9 ms 336 KB Output is correct
28 Correct 8 ms 440 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 9 ms 336 KB Output is correct
33 Correct 5 ms 336 KB Output is correct
34 Correct 3 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 6 ms 464 KB Output is correct
37 Correct 2 ms 464 KB Output is correct
38 Correct 2 ms 464 KB Output is correct
39 Correct 3 ms 336 KB Output is correct
40 Correct 4 ms 344 KB Output is correct
41 Correct 3 ms 344 KB Output is correct
42 Correct 1 ms 364 KB Output is correct

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3031 ms 3656 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3031 ms 3656 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 3 ms 336 KB Output is correct
4 Correct 3 ms 336 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 5 ms 336 KB Output is correct
7 Correct 9 ms 380 KB Output is correct
8 Correct 9 ms 336 KB Output is correct
9 Correct 9 ms 336 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 7 ms 460 KB Output is correct
12 Correct 8 ms 384 KB Output is correct
13 Execution timed out 3031 ms 3656 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Correct 3 ms 336 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 5 ms 336 KB Output is correct
15 Correct 9 ms 380 KB Output is correct
16 Correct 9 ms 336 KB Output is correct
17 Correct 9 ms 336 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 7 ms 460 KB Output is correct
20 Correct 8 ms 384 KB Output is correct
21 Correct 7 ms 336 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 3 ms 336 KB Output is correct
24 Correct 9 ms 384 KB Output is correct
25 Correct 8 ms 376 KB Output is correct
26 Correct 9 ms 376 KB Output is correct
27 Correct 9 ms 336 KB Output is correct
28 Correct 8 ms 440 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 9 ms 336 KB Output is correct
33 Correct 5 ms 336 KB Output is correct
34 Correct 3 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 6 ms 464 KB Output is correct
37 Correct 2 ms 464 KB Output is correct
38 Correct 2 ms 464 KB Output is correct
39 Correct 3 ms 336 KB Output is correct
40 Correct 4 ms 344 KB Output is correct
41 Correct 3 ms 344 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 770 ms 592 KB Output is correct
44 Correct 1168 ms 632 KB Output is correct
45 Correct 998 ms 616 KB Output is correct
46 Correct 1202 ms 940 KB Output is correct
47 Correct 1284 ms 936 KB Output is correct
48 Correct 1128 ms 956 KB Output is correct
49 Correct 878 ms 988 KB Output is correct
50 Correct 1110 ms 936 KB Output is correct
51 Correct 737 ms 672 KB Output is correct
52 Correct 707 ms 676 KB Output is correct
53 Correct 816 ms 976 KB Output is correct
54 Correct 1293 ms 924 KB Output is correct
55 Correct 1014 ms 772 KB Output is correct
56 Correct 988 ms 736 KB Output is correct
57 Correct 942 ms 656 KB Output is correct
58 Correct 1099 ms 1312 KB Output is correct
59 Correct 991 ms 1364 KB Output is correct
60 Correct 927 ms 1364 KB Output is correct
61 Correct 1010 ms 724 KB Output is correct
62 Correct 989 ms 560 KB Output is correct
63 Correct 859 ms 648 KB Output is correct
64 Correct 917 ms 668 KB Output is correct
65 Correct 564 ms 544 KB Output is correct
66 Correct 1524 ms 832 KB Output is correct
67 Correct 929 ms 720 KB Output is correct
68 Correct 1094 ms 712 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 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 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Correct 3 ms 336 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 5 ms 336 KB Output is correct
15 Correct 9 ms 380 KB Output is correct
16 Correct 9 ms 336 KB Output is correct
17 Correct 9 ms 336 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 7 ms 460 KB Output is correct
20 Correct 8 ms 384 KB Output is correct
21 Correct 7 ms 336 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 3 ms 336 KB Output is correct
24 Correct 9 ms 384 KB Output is correct
25 Correct 8 ms 376 KB Output is correct
26 Correct 9 ms 376 KB Output is correct
27 Correct 9 ms 336 KB Output is correct
28 Correct 8 ms 440 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 9 ms 336 KB Output is correct
33 Correct 5 ms 336 KB Output is correct
34 Correct 3 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 6 ms 464 KB Output is correct
37 Correct 2 ms 464 KB Output is correct
38 Correct 2 ms 464 KB Output is correct
39 Correct 3 ms 336 KB Output is correct
40 Correct 4 ms 344 KB Output is correct
41 Correct 3 ms 344 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Execution timed out 3031 ms 3656 KB Time limit exceeded
44 Halted 0 ms 0 KB -