oj.uz

Submission #1058000

# Submission time Handle Problem Language Result Execution time Memory
1058000 2024-08-14T07:54:56 Z aykhn Digital Circuit (IOI22_circuit) C++17
0 / 100
 3000 ms 14676 KB 
#include <bits/stdc++.h>
#include "circuit.h"
 
using namespace std;
 
#define int long long
 
const int MXN = 2e5 + 5;
const int mod = 1e9 + 2022;
 
int n, m, res = 0;
vector<int> A, P;
vector<int> adj[MXN];
int dp[2][MXN], SZ[MXN];
int cnt = 0;
 
void calc(int a)
{
  dp[0][a] = dp[1][a] = 0;
  if (adj[a].empty())
  {
    dp[0][a] = A[a] ^ 1;
    dp[1][a] = A[a];
    return;
  }
  int sz = adj[a].size();
  vector<int> dp1(sz + 1, 0);
  dp1[0] = 1;
  for (int &v : adj[a])
  {
    for (int i = sz; i >= 0; i--)
    {
      dp1[i] = (dp1[i] * dp[0][v]) % mod;
      if (i) dp1[i] = (dp1[i] + ((dp1[i - 1] * dp[1][v]) % mod)) % mod;
    }
  }
  for (int i = 0; i <= sz; i++)
  {
    dp[0][a] = (dp[0][a] + (((sz - i) * dp1[i]) % mod)) % mod;
    dp[1][a] = (dp[1][a] +  ((i * dp1[i]) % mod)) % mod;
  }
}
 
void dfs(int a)
{
  for (int &v : adj[a])
  {
    dfs(v);
  }
  calc(a);
}

int val[MXN];
array<int, 2> st[MXN << 2];
int lz[MXN << 2];

void relax(int l, int r, int x)
{
  if (!lz[x]) return;
  swap(st[x][0], st[x][1]);
  if (l == r)
  {
    lz[x] = 0;
    return;
  }
  lz[2*x] ^= lz[x], lz[2*x + 1] ^= lz[x];
  lz[x] = 0;
}

void upd(int l, int r, int x, int lx, int rx)
{
  relax(l, r, x);
  if (l > rx || r < lx) return;
  if (l >= lx && r <= rx)
  {
    lz[x] ^= 1;
    relax(l, r, x);
    return;
  }
  int mid = (l + r) >> 1;
  upd(l, mid, 2*x, lx, rx);
  upd(mid + 1, r, 2*x + 1, lx, rx);
  st[x][0] = st[2*x][0] + st[2*x + 1][0];
  st[x][1] = st[2*x][1] + st[2*x + 1][1];
}

void build(int l, int r, int x)
{
  if (l == r)
  {
    st[x][0] = A[l] * val[l];
    st[x][1] = (A[l] ^ 1) * val[l];
    return;
  }
  int mid = (l + r) >> 1;
  build(l, mid, 2*x);
  build(mid +1 , r, 2*x + 1);
  st[x][0] = st[2*x][0] + st[2*x + 1][0];
  st[x][1] = st[2*x][1] + st[2*x + 1][1];
}
 
void init(int32_t N, int32_t M, vector<int32_t> PP, vector<int32_t> AA) 
{
  n = N, m = M;
  for (int32_t &i : PP) P.push_back(i);
  for (int32_t &i : AA) A.push_back(i);
  reverse(A.begin(), A.end());
  A.resize(N + M, 0);
  reverse(A.begin(), A.end());
  for (int i = 1; i < N + M; i++) adj[P[i]].push_back(i);
  vector<int> prev = A;
  A.assign(N + M, 0);
  dfs(0);
  int org = dp[1][0];
  for (int i = N; i < N + M; i++)
  {
    A[i] = 1;
    dfs(0);
    val[i] = (dp[1][0] - org + mod) % mod;
    A[i] = 0;
  }
  A = prev;
  build(N, N + M - 1, 1);
}
 
int32_t count_ways(int32_t L, int32_t R) {
  upd(n, n + m - 1, 1, L, R);
  return st[1][0];
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 13400 KB Output is correct
2 Correct 2 ms 13400 KB Output is correct
3 Correct 2802 ms 13624 KB Output is correct
4 Execution timed out 3006 ms 13620 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 13400 KB Output is correct
2 Incorrect 6 ms 13400 KB 1st lines differ - on the 1st token, expected: '52130940', found: '-1782334720'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 13400 KB Output is correct
2 Correct 2 ms 13400 KB Output is correct
3 Correct 2802 ms 13624 KB Output is correct
4 Execution timed out 3006 ms 13620 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3058 ms 14676 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 3058 ms 14676 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 13400 KB Output is correct
2 Incorrect 6 ms 13400 KB 1st lines differ - on the 1st token, expected: '52130940', found: '-1782334720'
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 13400 KB Output is correct
2 Correct 2 ms 13400 KB Output is correct
3 Correct 2802 ms 13624 KB Output is correct
4 Execution timed out 3006 ms 13620 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 13400 KB Output is correct
2 Correct 2 ms 13400 KB Output is correct
3 Correct 2802 ms 13624 KB Output is correct
4 Execution timed out 3006 ms 13620 KB Time limit exceeded
5 Halted 0 ms 0 KB -