oj.uz

답안 #870062

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
870062 2023-11-06T19:56:22 Z Ludissey 디지털 회로 (IOI22_circuit) C++17
0 / 100
 385 ms 12872 KB 
#include "circuit.h"
 
#include <bits/stdc++.h>
 
using namespace std;
#define int long long
 
int N,M;
const int MOD=1e9+2022;
vector<vector<int>> tree;
vector<int> p;
vector<vector<bool>> toChange;
vector<int> state;
vector<int> depth;
vector<int> poss;
vector<vector<int>> memo;
 
int dfs(int i, int on){
  if(i>=N){
    toChange[i][on]=false;
    if(on) return state[i];
    else return 1-state[i];
  }
  if(memo[i][on]!=-1&&!toChange[i][on]) return memo[i][on];
  int lo=dfs(tree[i][0],true)%MOD, lf=dfs(tree[i][0],false)%MOD;
  int ro=dfs(tree[i][1],true)%MOD, rf=dfs(tree[i][1],false)%MOD;
  int ret=(lo*rf)%MOD+(ro*lf)%MOD;
  toChange[i][on]=false;
  if(on) ret+=(lo*ro*2)%MOD;
  else ret+=(2*lf*rf)%MOD;
  return memo[i][on]=ret%MOD;
}

void changeVec(int i){
  if(toChange[i][0]) return;
  toChange[i][0]=true;
  toChange[i][1]=true;
  if(i==0) return;
  changeVec(p[i]);
}

void init(signed n, signed m, std::vector<signed> P, std::vector<signed> A) {
  N=n; M=m;
  p.resize(N+M);
  for (int i = 0; i < N+M; i++) p[i]=P[i];
  tree.resize(N+M); state.resize(N+M);
  toChange.resize(N+M,vector<bool>(2, false));
  memo.resize(N+M, vector<int>(2,-1));
  for (int i = 1; i < N+M; i++) tree[P[i]].push_back(i);
  for (int i = N; i < N+M; i++) state[i] = A[i-N];
  dfs(0,true);
}
 
signed count_ways(signed L, signed R) {
  for (int i = L; i <= R; i++) state[i] = 1-state[i];
  for (int i = L; i <= R; i++) changeVec(i);
  signed d=dfs(0,true)%MOD;
  return d;
}

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 2nd lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 2nd lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 2nd lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 385 ms 12872 KB 2nd lines differ - on the 1st token, expected: '394586018', found: '431985922'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 385 ms 12872 KB 2nd lines differ - on the 1st token, expected: '394586018', found: '431985922'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 2nd lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 2nd lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 2nd lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -