oj.uz

답안 #790459

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
790459 2023-07-22T16:57:19 Z borisAngelov 디지털 회로 (IOI22_circuit) C++17
0 / 100
 8 ms 2256 KB 
#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

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.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '1', found: '-32'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 336 KB 1st lines differ - on the 1st token, expected: '1', found: '-32'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '1', found: '-32'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 8 ms 2256 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 8 ms 2256 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 336 KB 1st lines differ - on the 1st token, expected: '1', found: '-32'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '1', found: '-32'
2 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '1', found: '-32'
2 Halted 0 ms 0 KB -