제출 #817185

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
817185		finn__	디지털 회로 (IOI22_circuit)	C++17	22 / 100	3079 ms	11672 KiB

circuit

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

constexpr size_t N = 100000;
constexpr int64_t MOD = 1'000'002'022;

size_t n, m, p[2 * N];
vector<size_t> g[2 * N];
bitset<2 * N> state;
int64_t f[2 * N][2];

void dfs(size_t u)
{
    if (g[u].empty())
        return;

    size_t max_p = g[u].size();
    vector<int64_t> h(max_p + 1);
    h[0] = 1;
    for (auto const &v : g[u])
    {
        dfs(v);
        for (size_t i = max_p; i; --i)
            h[i] = (h[i] * f[v][0] + h[i - 1] * f[v][1]) % MOD;
        h[0] = (h[0] * f[v][0]) % MOD;
    }

    for (size_t i = max_p - 1; i; --i)
        h[i] += h[i + 1];
    f[u][1] = 0;
    for (size_t i = 1; i <= max_p; ++i)
        f[u][1] += h[i];
    f[u][1] %= MOD;

    f[u][0] = max_p;
    for (auto const &v : g[u])
        f[u][0] = (f[u][0] * (f[v][0] + f[v][1])) % MOD;
    f[u][0] = (f[u][0] - f[u][1] + MOD) % MOD;
}

void recompute_state(size_t u)
{
    while (u != SIZE_MAX)
    {
        if (!g[u].empty())
        {
            size_t max_p = g[u].size();
            vector<int64_t> h(max_p + 1);
            h[0] = 1;
            for (auto const &v : g[u])
            {
                for (size_t i = max_p; i; --i)
                    h[i] = (h[i] * f[v][0] + h[i - 1] * f[v][1]) % MOD;
                h[0] = (h[0] * f[v][0]) % MOD;
            }

            for (size_t i = max_p - 1; i; --i)
                h[i] += h[i + 1];
            f[u][1] = 0;
            for (size_t i = 1; i <= max_p; ++i)
                f[u][1] += h[i];
            f[u][1] %= MOD;

            f[u][0] = max_p;
            for (auto const &v : g[u])
                f[u][0] = (f[u][0] * (f[v][0] + f[v][1])) % MOD;
            f[u][0] = (f[u][0] - f[u][1] + MOD) % MOD;
        }
        u = p[u];
    }
}

void init(int n_, int m_, vector<int> p_, vector<int> a)
{
    n = n_, m = m_;
    for (size_t i = 0; i < n + m; ++i)
        p[i] = p_[i];
    for (size_t i = 0; i < n + m; ++i)
        if (p[i] != -1)
            g[p[i]].push_back(i);
    for (size_t i = 0; i < m; ++i)
        state[n + i] = a[i], f[n + i][state[n + i]] = 1, f[n + i][!state[n + i]] = 0;
    dfs(0);
}

int count_ways(int l, int r)
{
    for (size_t i = l; i <= r; ++i)
        state[i] = !state[i], f[i][state[i]] = 1, f[i][!state[i]] = 0;
    if (l == r)
        recompute_state(l);
    else
        dfs(0);
    return f[0][1];
}

컴파일 시 표준 에러 (stderr) 메시지

circuit.cpp: In function 'void init(int, int, std::vector<int>, std::vector<int>)':
circuit.cpp:80:18: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   80 |         if (p[i] != -1)
      |             ~~~~~^~~~~
circuit.cpp: In function 'int count_ways(int, int)':
circuit.cpp:89:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   89 |     for (size_t i = l; i <= r; ++i)
      |                        ~~^~~~

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