Educational Codeforces Round 110 D問題
Problem description
省略
省略
C++に変換後のコードはこちら
//no-unlocked
int K, N, P;
char S[1d6], C;
int dp[];
void calc(int i){
dp[i] = 0;
if(S[i] != '0') dp[i] += dp[2*i+1];
if(S[i] != '1') dp[i] += dp[2*i+2];
}
{
rd(K,S);
N = 1<<K;
reverse(S,S+N-1);
rep(i,N-1,2*N) dp[i] = 1;
rrep(i,N-1) calc(i);
REP(rd_int()){
rd(P,C);
P = N-1-P;
S[P] = C;
while(P >= 0){
calc(P);
P = fDiv(P-1, 2);
}
wt(dp[0]);
}
}
Current time: 2024年04月18日21時16分39秒
Last modified: 2021年06月07日19時40分32秒 (by laycrs)
Tags: Competitive_Programming_Incomplete Codeforces
トップページに戻る
Logged in as: unknown user (not login)