oj.uz

Submission #797982

# Submission time Handle Problem Language Result Execution time Memory
797982 2023-07-30T08:24:08 Z gesgha Digital Circuit (IOI22_circuit) C++17
22 / 100
 3000 ms 10912 KB 
#include "circuit.h"
#include <bits/stdc++.h>
 
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define fe(x, y) for (auto& x : y)
 
#define fi first
#define se second
#define pb push_back
 
#define all(x) x.begin(), x.end()
#define pw(x) (1LL << (x))
#define sz(x) (int)x.size()
 
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define fbo find_by_order
#define ook order_of_key
template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
template <typename T>
using ve = vector <T>;
 
template <typename T>
bool umx (T& a, T b) { return a < b ? a = b, 1 : 0; }
 
template <typename T>
bool umn (T& a, T b) { return a > b ? a = b, 1 : 0; }
 
using ll = long long;
using ld = long double;
using pll = pair <ll, ll>;
using pii = pair <int, int>;
using ull = unsigned long long;
 
const int oo = 1e9;
const ll OO = 1e18;
const int N = 2e5 + 10;
const int M = 5e3 + 100;
const int mod = 1e9 + 2022;

int a[N];
int dp[N][2];
int n, m;

int add(int a, int b) {
  return a + b < mod ? a + b : a + b - mod;
}
int mul (int a, int b) {
  return 1LL * a * b % mod;
}
ve <int> G[N];

int tin[N];
int tout[N];
int tim;

bool isupper(int u, int v) {
  return tin[u] <= tin[v] && tout[v] <= tout[u];
}

void dfs(int u) {
  tin[u] = tim++;
  if (!sz(G[u])) {
    if(a[u]) {
      dp[u][0] = 0;
      dp[u][1] = 1;
    } else {
      dp[u][0] = 1;
      dp[u][1] = 0;
    }
    tout[u] = tim;
    return;
  }
  for (auto to : G[u]) dfs(to);
  
  ve <ve <int>> d(sz(G[u]) + 1);

  fe (x, d) x.resize(sz(G[u]) + 1);

  d[0][0] = 1;

  for (int i = 0; i < sz(G[u]); i++) {
    int to = G[u][i];
    for (int cnt_al = 0; cnt_al <= i; cnt_al++) {
      d[i + 1][cnt_al + 1] = add(d[i + 1][cnt_al + 1], mul(d[i][cnt_al], dp[to][1]));
      d[i + 1][cnt_al] = add(d[i + 1][cnt_al], mul(d[i][cnt_al], dp[to][0]));
    }
  }
  dp[u][0] = dp[u][1] = 0;
  for (int cnt_al = 0; cnt_al <= sz(G[u]); cnt_al++) {
    dp[u][1] = add(dp[u][1], mul(d[sz(G[u])][cnt_al], max(0, cnt_al)));
    dp[u][0] = add(dp[u][0], mul(d[sz(G[u])][cnt_al], sz(G[u]) - cnt_al));
  }
  tout[u] = tim;
}


void calc(int u, int need) {
  if (!isupper(u, need)) {
      return;
  }
  if (!sz(G[u])) {
    if(a[u]) {
      dp[u][0] = 0;
      dp[u][1] = 1;
    } else {
      dp[u][0] = 1;
      dp[u][1] = 0;
    }
    return;
  }
  for (auto to : G[u]) calc(to, need);
  
  ve <ve <int>> d(sz(G[u]) + 1);

  fe (x, d) x.resize(sz(G[u]) + 1);

  d[0][0] = 1;

  for (int i = 0; i < sz(G[u]); i++) {
    int to = G[u][i];
    for (int cnt_al = 0; cnt_al <= i; cnt_al++) {
      d[i + 1][cnt_al + 1] = add(d[i + 1][cnt_al + 1], mul(d[i][cnt_al], dp[to][1]));
      d[i + 1][cnt_al] = add(d[i + 1][cnt_al], mul(d[i][cnt_al], dp[to][0]));
    }
  }
  dp[u][0] = dp[u][1] = 0;
  for (int cnt_al = 0; cnt_al <= sz(G[u]); cnt_al++) {
    dp[u][1] = add(dp[u][1], mul(d[sz(G[u])][cnt_al], max(0, cnt_al)));
    dp[u][0] = add(dp[u][0], mul(d[sz(G[u])][cnt_al], sz(G[u]) - cnt_al));
  }
}


void init(int N, int M, std::vector<int> P, std::vector<int> A) {
  n = N;
  m = M;
  for (int i = 0; i < M; i++) a[i + N] = A[i];
  for (int i = 1; i < N + M; i++) G[P[i]].pb(i);
  dfs(0);
}

int count_ways(int L, int R) {
  for (int i = L; i <= R; i++) {
    a[i] = 1 - a[i];
    if(L == R) calc(0, i);
  }
  if(L != R) dfs(0);
  return dp[0][1];
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 2 ms 4944 KB Output is correct
3 Correct 20 ms 8820 KB Output is correct
4 Correct 20 ms 9020 KB Output is correct
5 Correct 21 ms 9048 KB Output is correct
6 Correct 21 ms 8976 KB Output is correct
7 Correct 21 ms 8968 KB Output is correct
8 Correct 22 ms 9040 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 3 ms 4944 KB Output is correct
4 Correct 3 ms 4944 KB Output is correct
5 Correct 3 ms 4944 KB Output is correct
6 Correct 3 ms 5072 KB Output is correct
7 Correct 4 ms 5072 KB Output is correct
8 Correct 3 ms 5080 KB Output is correct
9 Correct 3 ms 5072 KB Output is correct
10 Correct 3 ms 5200 KB Output is correct
11 Correct 3 ms 5200 KB Output is correct
12 Correct 3 ms 5072 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 2 ms 4944 KB Output is correct
3 Correct 20 ms 8820 KB Output is correct
4 Correct 20 ms 9020 KB Output is correct
5 Correct 21 ms 9048 KB Output is correct
6 Correct 21 ms 8976 KB Output is correct
7 Correct 21 ms 8968 KB Output is correct
8 Correct 22 ms 9040 KB Output is correct
9 Correct 2 ms 4944 KB Output is correct
10 Correct 3 ms 4944 KB Output is correct
11 Correct 3 ms 4944 KB Output is correct
12 Correct 3 ms 4944 KB Output is correct
13 Correct 3 ms 4944 KB Output is correct
14 Correct 3 ms 5072 KB Output is correct
15 Correct 4 ms 5072 KB Output is correct
16 Correct 3 ms 5080 KB Output is correct
17 Correct 3 ms 5072 KB Output is correct
18 Correct 3 ms 5200 KB Output is correct
19 Correct 3 ms 5200 KB Output is correct
20 Correct 3 ms 5072 KB Output is correct
21 Correct 3 ms 5072 KB Output is correct
22 Correct 3 ms 5072 KB Output is correct
23 Correct 3 ms 4944 KB Output is correct
24 Correct 3 ms 5072 KB Output is correct
25 Correct 4 ms 5072 KB Output is correct
26 Correct 3 ms 5072 KB Output is correct
27 Correct 4 ms 5072 KB Output is correct
28 Correct 4 ms 5072 KB Output is correct
29 Correct 26 ms 8976 KB Output is correct
30 Correct 21 ms 8996 KB Output is correct
31 Correct 3 ms 5200 KB Output is correct
32 Correct 3 ms 5072 KB Output is correct
33 Correct 3 ms 5072 KB Output is correct
34 Correct 3 ms 5072 KB Output is correct
35 Correct 6 ms 5232 KB Output is correct
36 Correct 3 ms 5200 KB Output is correct
37 Correct 21 ms 9168 KB Output is correct
38 Correct 23 ms 9248 KB Output is correct
39 Correct 4 ms 5072 KB Output is correct
40 Correct 3 ms 4944 KB Output is correct
41 Correct 4 ms 4952 KB Output is correct
42 Correct 3 ms 5072 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 755 ms 7896 KB Output is correct
2 Correct 1074 ms 10812 KB Output is correct
3 Correct 1018 ms 10912 KB Output is correct
4 Correct 1107 ms 10880 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 755 ms 7896 KB Output is correct
2 Correct 1074 ms 10812 KB Output is correct
3 Correct 1018 ms 10912 KB Output is correct
4 Correct 1107 ms 10880 KB Output is correct
5 Execution timed out 3006 ms 7888 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 3 ms 4944 KB Output is correct
4 Correct 3 ms 4944 KB Output is correct
5 Correct 3 ms 4944 KB Output is correct
6 Correct 3 ms 5072 KB Output is correct
7 Correct 4 ms 5072 KB Output is correct
8 Correct 3 ms 5080 KB Output is correct
9 Correct 3 ms 5072 KB Output is correct
10 Correct 3 ms 5200 KB Output is correct
11 Correct 3 ms 5200 KB Output is correct
12 Correct 3 ms 5072 KB Output is correct
13 Correct 755 ms 7896 KB Output is correct
14 Correct 1074 ms 10812 KB Output is correct
15 Correct 1018 ms 10912 KB Output is correct
16 Correct 1107 ms 10880 KB Output is correct
17 Execution timed out 3006 ms 7888 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 2 ms 4944 KB Output is correct
3 Correct 20 ms 8820 KB Output is correct
4 Correct 20 ms 9020 KB Output is correct
5 Correct 21 ms 9048 KB Output is correct
6 Correct 21 ms 8976 KB Output is correct
7 Correct 21 ms 8968 KB Output is correct
8 Correct 22 ms 9040 KB Output is correct
9 Correct 2 ms 4944 KB Output is correct
10 Correct 3 ms 4944 KB Output is correct
11 Correct 3 ms 4944 KB Output is correct
12 Correct 3 ms 4944 KB Output is correct
13 Correct 3 ms 4944 KB Output is correct
14 Correct 3 ms 5072 KB Output is correct
15 Correct 4 ms 5072 KB Output is correct
16 Correct 3 ms 5080 KB Output is correct
17 Correct 3 ms 5072 KB Output is correct
18 Correct 3 ms 5200 KB Output is correct
19 Correct 3 ms 5200 KB Output is correct
20 Correct 3 ms 5072 KB Output is correct
21 Correct 3 ms 5072 KB Output is correct
22 Correct 3 ms 5072 KB Output is correct
23 Correct 3 ms 4944 KB Output is correct
24 Correct 3 ms 5072 KB Output is correct
25 Correct 4 ms 5072 KB Output is correct
26 Correct 3 ms 5072 KB Output is correct
27 Correct 4 ms 5072 KB Output is correct
28 Correct 4 ms 5072 KB Output is correct
29 Correct 26 ms 8976 KB Output is correct
30 Correct 21 ms 8996 KB Output is correct
31 Correct 3 ms 5200 KB Output is correct
32 Correct 3 ms 5072 KB Output is correct
33 Correct 3 ms 5072 KB Output is correct
34 Correct 3 ms 5072 KB Output is correct
35 Correct 6 ms 5232 KB Output is correct
36 Correct 3 ms 5200 KB Output is correct
37 Correct 21 ms 9168 KB Output is correct
38 Correct 23 ms 9248 KB Output is correct
39 Correct 4 ms 5072 KB Output is correct
40 Correct 3 ms 4944 KB Output is correct
41 Correct 4 ms 4952 KB Output is correct
42 Correct 3 ms 5072 KB Output is correct
43 Execution timed out 3011 ms 5200 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 2 ms 4944 KB Output is correct
3 Correct 20 ms 8820 KB Output is correct
4 Correct 20 ms 9020 KB Output is correct
5 Correct 21 ms 9048 KB Output is correct
6 Correct 21 ms 8976 KB Output is correct
7 Correct 21 ms 8968 KB Output is correct
8 Correct 22 ms 9040 KB Output is correct
9 Correct 2 ms 4944 KB Output is correct
10 Correct 3 ms 4944 KB Output is correct
11 Correct 3 ms 4944 KB Output is correct
12 Correct 3 ms 4944 KB Output is correct
13 Correct 3 ms 4944 KB Output is correct
14 Correct 3 ms 5072 KB Output is correct
15 Correct 4 ms 5072 KB Output is correct
16 Correct 3 ms 5080 KB Output is correct
17 Correct 3 ms 5072 KB Output is correct
18 Correct 3 ms 5200 KB Output is correct
19 Correct 3 ms 5200 KB Output is correct
20 Correct 3 ms 5072 KB Output is correct
21 Correct 3 ms 5072 KB Output is correct
22 Correct 3 ms 5072 KB Output is correct
23 Correct 3 ms 4944 KB Output is correct
24 Correct 3 ms 5072 KB Output is correct
25 Correct 4 ms 5072 KB Output is correct
26 Correct 3 ms 5072 KB Output is correct
27 Correct 4 ms 5072 KB Output is correct
28 Correct 4 ms 5072 KB Output is correct
29 Correct 26 ms 8976 KB Output is correct
30 Correct 21 ms 8996 KB Output is correct
31 Correct 3 ms 5200 KB Output is correct
32 Correct 3 ms 5072 KB Output is correct
33 Correct 3 ms 5072 KB Output is correct
34 Correct 3 ms 5072 KB Output is correct
35 Correct 6 ms 5232 KB Output is correct
36 Correct 3 ms 5200 KB Output is correct
37 Correct 21 ms 9168 KB Output is correct
38 Correct 23 ms 9248 KB Output is correct
39 Correct 4 ms 5072 KB Output is correct
40 Correct 3 ms 4944 KB Output is correct
41 Correct 4 ms 4952 KB Output is correct
42 Correct 3 ms 5072 KB Output is correct
43 Correct 755 ms 7896 KB Output is correct
44 Correct 1074 ms 10812 KB Output is correct
45 Correct 1018 ms 10912 KB Output is correct
46 Correct 1107 ms 10880 KB Output is correct
47 Execution timed out 3006 ms 7888 KB Time limit exceeded
48 Halted 0 ms 0 KB -