Submission #1074587

#	Time	Username	Problem	Language	Result	Execution time	Memory
1074587		Zicrus	Digital Circuit (IOI22_circuit)	C++17	0 / 100	3068 ms	3924 KiB

circuit

#include <bits/stdc++.h>
#include "circuit.h"
using namespace std;

typedef long long ll;

int n, m;
vector<int> p, a, mark;
vector<vector<int>> adj;
vector<vector<ll>> dp;

ll getDp(int state, int i) {
    if (i >= n) return state == a[i-n];
    return dp[state][i];
}

void update(int i) {
    ll numOff = 0, numOn = 0;
    for (ll mask = 0; mask < (1ll << adj[i].size()); mask++) {
        ll valOff = adj[i].size() - __builtin_popcount(mask);
        ll valOn = __builtin_popcount(mask);
        for (int b = 0; b < adj[i].size(); b++) {
            valOff *= getDp((mask >> b) & 1, adj[i][b]);
            valOn *= getDp((mask >> b) & 1, adj[i][b]);
            valOff %= 1000002022;
            valOn %= 1000002022;
        }
        numOff += valOff;
        numOn += valOn;
        numOff %= 1000002022;
        numOn %= 1000002022;
    }
    dp[0][i] = numOff;
    dp[1][i] = numOn;
}

void init(int N, int M, vector<int> P, vector<int> A) {
    n = N, m = M; p = P; a = A;
    mark = vector<int>(n);
    adj = vector<vector<int>>(n);
    dp = vector<vector<ll>>(2, vector<ll>(n));
    for (int i = 1; i < n+m; i++) {
        adj[p[i]].push_back(i);
    }
    for (int i = n-1; i >= 0; i--) {
        update(i);
    }
}

int count_ways(int L, int R) {
    L -= n; R -= n;
    
    for (int i = L; i <= R; i++) {
        a[i] = !a[i];
    }
    ll res = 0;
    for (auto &e : a) res += e;
    return res;
}

#ifdef TEST
#include "grader.cpp"
#endif

Compilation message (stderr)

circuit.cpp: In function 'void update(int)':
circuit.cpp:22:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |         for (int b = 0; b < adj[i].size(); b++) {
      |                         ~~^~~~~~~~~~~~~~~

• Subtask 1: 0 / 2
• Subtask 2: 0 / 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