Submission #1334208

#TimeUsernameProblemLanguageResultExecution timeMemory
1334208nicolo_010Digital Circuit (IOI22_circuit)C++20
0 / 100
1511 ms2162688 KiB
#include "circuit.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
vector<int> a;
vector<vector<int>> adj;
int n, m;

const ll MOD = 1000002022;

void init(int N, int M, std::vector<int> P, std::vector<int> A) {
    n = N, m = M;
    adj.assign(n+m, {});
    for (int i=1; i<n+m; i++) {
        adj[P[i]].push_back(i);
    }
    a = A;
}

const int mxN = 1000+5;

ll f[mxN][2];

void dfs(int u) {
    if (adj[u].size()==0) return;
    int l = adj[u][0];
    int r = adj[u][1];
    dfs(l);
    dfs(r);
    f[u][0] = f[l][0]*f[r][1] + f[l][1]*f[r][0] + 2*f[l][0]*f[r][0];//formas de hacer u 0
    f[u][0] %= MOD;
    f[u][1] = f[l][0]*f[r][1] + f[l][1]*f[r][0] + 2*f[l][1]*f[r][1];
    f[u][1] %= MOD;
}

int count_ways(int L, int R) {
    for (int i=L; i<=R; i++) {
        a[i-n] ^= 1;
    }
    memset(f, 0, sizeof(f));
    for (int i=n; i<n+m; i++) {
        f[i][a[i-n]] = 1;
    }
    dfs(0);
    return f[0][1];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...