Submission #1231648

#	Time	Username	Problem	Language	Result	Execution time	Memory
1231648		adriines06	디지털 회로 (IOI22_circuit)	C++20	7 / 100	3004 ms	2162688 KiB

circuit

#include "circuit.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<pair<ll,ll>>dp;
vector<int>a;
vector<vector<int>>adj;
int n,m;
const int MOD=1000002022;
void init(int N, int M, std::vector<int> P, std::vector<int> A) {
  dp.resize(N+M);
  adj.resize(N+M);
  a.resize(M);
  n=N;
  m=M;
  for(int i=1;i<N+M;i++){
    adj[P[i]].push_back(i);
  }
  for(int i=0;i<M;i++){
    a[i]=A[i];
  }

}
void dfs(int u, int p, vector<pair<ll,ll>>&Dp){
  if(u>=n) return;
  ll l,r;
  l=adj[u][1];
  r=adj[u][0];
  
  dfs(l, u, Dp);
  dfs(r, u, Dp);

  Dp[u].first=(Dp[l].second*Dp[r].first)%MOD+(Dp[l].first*Dp[r].second)%MOD+(2*Dp[l].first*Dp[r].first)%MOD;
  Dp[u].second=(Dp[l].second*Dp[r].first)%MOD+(Dp[l].first*Dp[r].second)%MOD+(2*Dp[l].second*Dp[r].second)%MOD;
  Dp[u].first%=MOD;
  Dp[u].second%=MOD;
  return;
}
int count_ways(int L, int R) {
  for(int i=L;i<=R;i++){
    a[i-n]=!a[i-n];
  }
  //f->prendido s->apagado
  for(int i=0;i<m;i++){
    if(a[i]==1){
      dp[n+i].first=1;
      dp[n+i].second=0;
    }
    else{
      dp[n+i].first=0;
      dp[n+i].second=1;
    }
  }
  dfs(0,-1,dp);

  return dp[0].first;
}

• Subtask 1: 0 / 2
• Subtask 2: 7 / 7
• Subtask 3: 0 / 9
• Subtask 4: 0 / 4
• Subtask 5: 0 / 12
• Subtask 6: 0 / 27
• Subtask 7: 0 / 28
• Subtask 8: 0 / 11