oj.uz

답안 #1057283

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057283 2024-08-13T16:21:36 Z esomer 디지털 회로 (IOI22_circuit) C++17
4 / 100
 580 ms 14168 KB 
#include "circuit.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int MOD = 1000002022;

struct segTree{
  vector<pair<ll, ll>> v;
  vector<int> upd;
  int sz;
  void init(int n){
    sz = 1;
    while(sz < n) sz *= 2;
    v.assign(2 * sz, {0, 0});
    upd.assign(2 * sz, 0);
  }
  void set(int i, pair<ll, ll> p, int x, int lx, int rx){
    if(rx - lx == 1){
      v[x] = p;
      return;
    }
    int m = (lx + rx) / 2;
    if(i < m) set(i, p, 2 * x + 1, lx, m);
    else set(i, p, 2 * x + 2, m, rx);
    v[x].first = (v[2 * x + 1].first + v[2 * x + 2].first) % MOD;
    v[x].second = (v[2 * x + 1].second + v[2 * x + 2].second) % MOD;
  }
  void set(int i, pair<ll, ll> p){
    set(i, p, 0, 0, sz);
  }
  void push(int x){
    if(upd[x]){
      upd[2 * x + 1] ^= 1;
      swap(v[2 * x + 1].first, v[2 *  x + 1].second);
      upd[2 * x + 2] ^= 1;
      swap(v[2 * x + 2].first, v[2 *  x + 2].second);
    }
  }
  void change(int l, int r, int x, int lx, int rx){
    if(lx >= l && rx <= r){
      swap(v[x].first, v[x].second);
      upd[x] ^= 1;
      return;
    }else if(lx >= r || rx <= l) return;
    int m = (lx + rx) / 2;
    push(x);
    change(l, r, 2 * x + 1, lx, m);
    change(l, r, 2 * x + 2, m, rx);
    v[x].first = (v[2 * x + 1].first + v[2 * x + 2].first) % MOD;
    v[x].second = (v[2 * x + 1].second + v[2 * x + 2].second) % MOD;
  }
  void change(int l, int r){
    change(l, r, 0, 0, sz);
  }
};

void getSub(int x, vector<vector<int>>& adj, vector<ll>& subtree){
  ll opt = (int)adj[x].size();
  subtree[x] = opt;
  for(int node : adj[x]){
    getSub(node, adj, subtree);
    if(!adj[node].empty()){
      subtree[x] *= subtree[node];
      subtree[x] %= MOD;
    }
  }
  // cout << "x " << x << " subtree " << subtree[x] << endl;
}

void DFS(int x, vector<vector<int>>& adj, vector<ll>& subtree, vector<ll>& dp, ll curr = 1){
  int sz = (int)adj[x].size();
  dp[x] = curr;
  if(!sz) return;
  vector<ll> suf(sz+1, 1);
  for(int i = sz - 1; i >= 0; i--){
    suf[i] = suf[i+1] * max(subtree[adj[x][i]], 1ll);
    suf[i] %= MOD;
  }
  ll nw = 1;
  for(int i = 0; i < sz; i++){
    ll all = nw * suf[i+1]; all %= MOD;
    DFS(adj[x][i], adj, subtree, dp, (curr * all) % MOD);
    nw *= max(subtree[adj[x][i]], 1ll); nw %= MOD;
  }
}

segTree st; 

void init(int N, int M, vector<int> P, vector<int> A) {
  vector<vector<int>> adj(N+M);
  for(int i = 1; i < N + M; i++){
    adj[P[i]].push_back(i);
  }
  vector<ll> subtree(N+M);
  getSub(0, adj, subtree);
  vector<ll> dp(N+M, 0);
  DFS(0, adj, subtree, dp);
  st.init(N+M);
  for(int i = N; i < N+M; i++){
    // cout << "i " << i << " dp " << dp[i] << "\n";
    pair<ll, ll> p = {dp[i], 0};
    if(!A[i-N]) swap(p.first, p.second);
    st.set(i, p);
  }
}

int count_ways(int L, int R) {
  st.change(L, R + 1);
  return st.v[0].first;
}

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 344 KB 5th lines differ - on the 1st token, expected: '481', found: '491'
4 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 344 KB 5th lines differ - on the 1st token, expected: '70832346', found: '563623630'
4 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 344 KB 5th lines differ - on the 1st token, expected: '481', found: '491'
4 Halted 0 ms 0 KB -

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 384 ms 7256 KB Output is correct
2 Correct 577 ms 14168 KB Output is correct
3 Correct 580 ms 14168 KB Output is correct
4 Correct 576 ms 14168 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 384 ms 7256 KB Output is correct
2 Correct 577 ms 14168 KB Output is correct
3 Correct 580 ms 14168 KB Output is correct
4 Correct 576 ms 14168 KB Output is correct
5 Incorrect 451 ms 7256 KB 5th lines differ - on the 1st token, expected: '882566410', found: '40177750'
6 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 344 KB 5th lines differ - on the 1st token, expected: '70832346', found: '563623630'
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 344 KB 5th lines differ - on the 1st token, expected: '481', found: '491'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 344 KB 5th lines differ - on the 1st token, expected: '481', found: '491'
4 Halted 0 ms 0 KB -