답안 #790507

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
790507	2023-07-22T18:11:36 Z	borisAngelov	디지털 회로 (IOI22_circuit)	C++17	컴파일 오류	0 ms	0 KB

circuit

#include "circuit.h"
#include "stub.cpp"

#include <bits/stdc++.h>

using namespace std;

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

int n, m;

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

vector<int> tree[maxn];

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

    if (tree[node].empty())
    {
        dp[node][color[node]] = 1;
        dp[node][1 - color[node]] = 0;
        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[i - n - 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

circuit.cpp: In function 'void init(int, int, std::vector<int>, std::vector<int>)':
circuit.cpp:48:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for (int i = 1; i < P.size(); ++i)
      |                     ~~^~~~~~~~~~
/usr/bin/ld: /tmp/ccfS4X2d.o: in function `main':
stub.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccODbARf.o:circuit.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status