Submission #790459

#	Time	Username	Problem	Language	Result	Execution time	Memory
790459		borisAngelov	Digital Circuit (IOI22_circuit)	C++17	0 / 100	8 ms	2256 KiB

circuit

#include "circuit.h"

#include <bits/stdc++.h>

using namespace std;

const int maxn = 1005;
const long long mod = 1e9 + 2022;

int n, m;

long long dp[maxn][2];
int color[maxn];

vector<int> tree[2 * maxn];

void dfs(int node)
{
    dp[node][0] = 0;
    dp[node][1] = 0;

    if (tree[node].empty())
    {
        dp[node][1] = color[node];
        dp[node][0] = 1 - dp[node][1];
        return;
    }

    int l = tree[node][0];
    int r = tree[node][1];

    dfs(l);
    dfs(r);

    dp[node][0] = (dp[l][0] * dp[r][1]) % mod + (dp[l][1] * dp[r][0]) % mod + (2LL * dp[l][0] * dp[r][0]) % mod;
    dp[node][0] %= mod;

    dp[node][1] = (dp[l][0] * dp[r][1]) % mod + (dp[l][1] * dp[r][0]) % mod + (2LL * dp[l][1] * dp[r][1]) % mod;
    dp[node][1] %= mod;
}

void init(int N, int M, vector<int> P, vector<int> A)
{
    n = N;
    m = M;

    for (int i = 1; i < P.size(); ++i)
    {
        tree[P[i] + 1].push_back(i + 1);
    }

    for (int i = n + 1; i <= n + m; ++i)
    {
        color[i] = A[n - i - 1];
    }
}

int count_ways(int L, int R)
{
    int l = ++L;
    int r = ++R;

    for (int i = l; i <= r; ++i)
    {
        color[i] = 1 - color[i];
    }

    dfs(1);

    return dp[1][1];
}

Compilation message (stderr)

circuit.cpp: In function 'void init(int, int, std::vector<int>, std::vector<int>)':
circuit.cpp:47:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for (int i = 1; i < P.size(); ++i)
      |                     ~~^~~~~~~~~~

• 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