oj.uz

답안 #705510

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
705510 2023-03-04T14:49:43 Z danikoynov 디지털 회로 (IOI22_circuit) C++17
34 / 100
 1010 ms 16380 KB 
#include "circuit.h"

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll mod = 1000002022;
const int maxn = 2e5 + 10;

int n, m, p[maxn], a[maxn];
vector < int > children[maxn];
ll dp[maxn][2], temp[maxn];

void update_state(int v)
{
        dp[v][0] = dp[v][1] = 0;

    if (v >= n)
    {
        dp[v][1] = a[v - n];
        dp[v][0] = 1 - dp[v][1];
        return;
    }

    int c = children[v].size();
    for (int i = 0; i <= c; i ++)
        temp[i] = 0;

    temp[0] = 1;
    for (int u : children[v])
    {
        for (int i = c; i >= 0; i --)
        {
            temp[i] = (temp[i] * dp[u][0]) % mod;
            if (i > 0)
                temp[i] = (temp[i] + temp[i - 1] * dp[u][1]) % mod;
        }
    }


    for (int i = 0; i <= c; i ++)
    {
        dp[v][0] = (dp[v][0] + temp[i] * (ll)(c - i)) % mod;
        dp[v][1] = (dp[v][1] + temp[i] * (ll)(i)) % mod;
    }
    ///cout << v << " " << dp[v][0] << " " << dp[v][1] << endl;

}
void solve_state(int v)
{


    for (int u : children[v])
    {
        solve_state(u);
    }

    update_state(v);



}

ll pw[maxn];
int act = 0, logM = 0;

int tree[4 * maxn], lazy[4 * maxn];

void build_tree(int root, int left, int right)
{
    if (left == right)
    {
        tree[root] = a[left];
        return;
    }

    int mid = (left + right) / 2;
    build_tree(root * 2, left, mid);
    build_tree(root * 2 + 1, mid + 1, right);

    tree[root] = tree[root * 2] + tree[root * 2 + 1];
}

void push_lazy(int root, int left, int right)
{
    if (lazy[root] == 0)
        return;

    tree[root] = (right - left + 1) - tree[root];
    if (left != right)
    {
        lazy[root * 2] = (lazy[root * 2] + 1) % 2;
        lazy[root * 2 + 1] = (lazy[root * 2 + 1] + 1) % 2;
    }
    lazy[root] = 0;
}

void update_range(int root, int left, int right, int qleft, int qright)
{
    push_lazy(root, left, right);
    if (left > qright || right < qleft)
        return;

    if (left >= qleft && right <= qright)
    {
        lazy[root] = 1;
        push_lazy(root, left, right);
        return;
    }

    int mid = (left + right) / 2;
    update_range(root * 2, left, mid, qleft, qright);
    update_range(root * 2 + 1, mid + 1, right, qleft,  qright);
    tree[root] = tree[root * 2] + tree[root * 2 + 1];
}


void init(int N, int M, std::vector<int> P, std::vector<int> A)
{
    n = N;
    m = M;
        pw[0] = 1;
    for (int i = 1; i <= M; i ++)
        pw[i] = (pw[i - 1] * (ll)(2)) % mod;
    while((1 << logM) < M)
        logM ++;
    for (int i = 0; i < N + M; i ++)
        p[i] = P[i];
    for (int i = 0; i < M; i ++)
        a[i] = A[i], act += a[i];

    for (int i = 1; i < N + M; i ++)
    {
        children[p[i]].push_back(i);
    }
    solve_state(0);
    build_tree(1, 0, M - 1);
}


int count_ways(int L, int R)
{
    if (n > 1000 || m > 1000)
    {
        update_range(1, 0, m - 1, L - n, R - n);
        ll ans = (pw[n - logM] * tree[1]) % mod;
        return ans;
    }
    else
    {
        for (int i = L - n; i <= R - n; i ++)
            a[i] = ((a[i] + 1) & 1);

        solve_state(0);
    }


    return dp[0][1];
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 2 ms 4944 KB Output is correct
3 Correct 19 ms 5096 KB Output is correct
4 Correct 21 ms 5072 KB Output is correct
5 Correct 20 ms 5072 KB Output is correct
6 Correct 21 ms 5072 KB Output is correct
7 Correct 20 ms 5004 KB Output is correct
8 Correct 20 ms 5072 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 3 ms 5072 KB Output is correct
3 Correct 3 ms 5072 KB Output is correct
4 Correct 3 ms 5072 KB Output is correct
5 Correct 3 ms 5072 KB Output is correct
6 Correct 3 ms 5072 KB Output is correct
7 Correct 3 ms 5072 KB Output is correct
8 Correct 3 ms 5072 KB Output is correct
9 Correct 3 ms 5072 KB Output is correct
10 Correct 3 ms 5072 KB Output is correct
11 Correct 3 ms 5072 KB Output is correct
12 Correct 3 ms 5072 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 2 ms 4944 KB Output is correct
3 Correct 19 ms 5096 KB Output is correct
4 Correct 21 ms 5072 KB Output is correct
5 Correct 20 ms 5072 KB Output is correct
6 Correct 21 ms 5072 KB Output is correct
7 Correct 20 ms 5004 KB Output is correct
8 Correct 20 ms 5072 KB Output is correct
9 Correct 2 ms 4944 KB Output is correct
10 Correct 3 ms 5072 KB Output is correct
11 Correct 3 ms 5072 KB Output is correct
12 Correct 3 ms 5072 KB Output is correct
13 Correct 3 ms 5072 KB Output is correct
14 Correct 3 ms 5072 KB Output is correct
15 Correct 3 ms 5072 KB Output is correct
16 Correct 3 ms 5072 KB Output is correct
17 Correct 3 ms 5072 KB Output is correct
18 Correct 3 ms 5072 KB Output is correct
19 Correct 3 ms 5072 KB Output is correct
20 Correct 3 ms 5072 KB Output is correct
21 Correct 4 ms 5072 KB Output is correct
22 Correct 3 ms 5072 KB Output is correct
23 Correct 3 ms 5072 KB Output is correct
24 Correct 4 ms 5072 KB Output is correct
25 Correct 3 ms 5072 KB Output is correct
26 Correct 3 ms 5072 KB Output is correct
27 Correct 3 ms 5072 KB Output is correct
28 Correct 3 ms 5072 KB Output is correct
29 Correct 21 ms 5072 KB Output is correct
30 Correct 20 ms 5072 KB Output is correct
31 Correct 3 ms 5072 KB Output is correct
32 Correct 3 ms 5072 KB Output is correct
33 Correct 3 ms 5072 KB Output is correct
34 Correct 3 ms 5116 KB Output is correct
35 Correct 6 ms 5072 KB Output is correct
36 Correct 3 ms 5072 KB Output is correct
37 Correct 21 ms 5200 KB Output is correct
38 Correct 21 ms 5196 KB Output is correct
39 Correct 4 ms 5200 KB Output is correct
40 Correct 3 ms 5072 KB Output is correct
41 Correct 3 ms 5072 KB Output is correct
42 Correct 3 ms 5072 KB Output is correct

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 468 ms 8660 KB Output is correct
2 Correct 975 ms 12532 KB Output is correct
3 Correct 815 ms 12416 KB Output is correct
4 Correct 783 ms 12448 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 468 ms 8660 KB Output is correct
2 Correct 975 ms 12532 KB Output is correct
3 Correct 815 ms 12416 KB Output is correct
4 Correct 783 ms 12448 KB Output is correct
5 Correct 588 ms 8732 KB Output is correct
6 Correct 961 ms 12428 KB Output is correct
7 Correct 1010 ms 12408 KB Output is correct
8 Correct 909 ms 12408 KB Output is correct
9 Correct 470 ms 5200 KB Output is correct
10 Correct 810 ms 5516 KB Output is correct
11 Correct 872 ms 5516 KB Output is correct
12 Correct 917 ms 5456 KB Output is correct

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 3 ms 5072 KB Output is correct
3 Correct 3 ms 5072 KB Output is correct
4 Correct 3 ms 5072 KB Output is correct
5 Correct 3 ms 5072 KB Output is correct
6 Correct 3 ms 5072 KB Output is correct
7 Correct 3 ms 5072 KB Output is correct
8 Correct 3 ms 5072 KB Output is correct
9 Correct 3 ms 5072 KB Output is correct
10 Correct 3 ms 5072 KB Output is correct
11 Correct 3 ms 5072 KB Output is correct
12 Correct 3 ms 5072 KB Output is correct
13 Correct 468 ms 8660 KB Output is correct
14 Correct 975 ms 12532 KB Output is correct
15 Correct 815 ms 12416 KB Output is correct
16 Correct 783 ms 12448 KB Output is correct
17 Correct 588 ms 8732 KB Output is correct
18 Correct 961 ms 12428 KB Output is correct
19 Correct 1010 ms 12408 KB Output is correct
20 Correct 909 ms 12408 KB Output is correct
21 Correct 470 ms 5200 KB Output is correct
22 Correct 810 ms 5516 KB Output is correct
23 Correct 872 ms 5516 KB Output is correct
24 Correct 917 ms 5456 KB Output is correct
25 Incorrect 916 ms 16380 KB 1st lines differ - on the 1st token, expected: '732332002', found: '177616322'
26 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 2 ms 4944 KB Output is correct
3 Correct 19 ms 5096 KB Output is correct
4 Correct 21 ms 5072 KB Output is correct
5 Correct 20 ms 5072 KB Output is correct
6 Correct 21 ms 5072 KB Output is correct
7 Correct 20 ms 5004 KB Output is correct
8 Correct 20 ms 5072 KB Output is correct
9 Correct 2 ms 4944 KB Output is correct
10 Correct 3 ms 5072 KB Output is correct
11 Correct 3 ms 5072 KB Output is correct
12 Correct 3 ms 5072 KB Output is correct
13 Correct 3 ms 5072 KB Output is correct
14 Correct 3 ms 5072 KB Output is correct
15 Correct 3 ms 5072 KB Output is correct
16 Correct 3 ms 5072 KB Output is correct
17 Correct 3 ms 5072 KB Output is correct
18 Correct 3 ms 5072 KB Output is correct
19 Correct 3 ms 5072 KB Output is correct
20 Correct 3 ms 5072 KB Output is correct
21 Correct 4 ms 5072 KB Output is correct
22 Correct 3 ms 5072 KB Output is correct
23 Correct 3 ms 5072 KB Output is correct
24 Correct 4 ms 5072 KB Output is correct
25 Correct 3 ms 5072 KB Output is correct
26 Correct 3 ms 5072 KB Output is correct
27 Correct 3 ms 5072 KB Output is correct
28 Correct 3 ms 5072 KB Output is correct
29 Correct 21 ms 5072 KB Output is correct
30 Correct 20 ms 5072 KB Output is correct
31 Correct 3 ms 5072 KB Output is correct
32 Correct 3 ms 5072 KB Output is correct
33 Correct 3 ms 5072 KB Output is correct
34 Correct 3 ms 5116 KB Output is correct
35 Correct 6 ms 5072 KB Output is correct
36 Correct 3 ms 5072 KB Output is correct
37 Correct 21 ms 5200 KB Output is correct
38 Correct 21 ms 5196 KB Output is correct
39 Correct 4 ms 5200 KB Output is correct
40 Correct 3 ms 5072 KB Output is correct
41 Correct 3 ms 5072 KB Output is correct
42 Correct 3 ms 5072 KB Output is correct
43 Incorrect 499 ms 5328 KB 1st lines differ - on the 1st token, expected: '196037954', found: '0'
44 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 2 ms 4944 KB Output is correct
3 Correct 19 ms 5096 KB Output is correct
4 Correct 21 ms 5072 KB Output is correct
5 Correct 20 ms 5072 KB Output is correct
6 Correct 21 ms 5072 KB Output is correct
7 Correct 20 ms 5004 KB Output is correct
8 Correct 20 ms 5072 KB Output is correct
9 Correct 2 ms 4944 KB Output is correct
10 Correct 3 ms 5072 KB Output is correct
11 Correct 3 ms 5072 KB Output is correct
12 Correct 3 ms 5072 KB Output is correct
13 Correct 3 ms 5072 KB Output is correct
14 Correct 3 ms 5072 KB Output is correct
15 Correct 3 ms 5072 KB Output is correct
16 Correct 3 ms 5072 KB Output is correct
17 Correct 3 ms 5072 KB Output is correct
18 Correct 3 ms 5072 KB Output is correct
19 Correct 3 ms 5072 KB Output is correct
20 Correct 3 ms 5072 KB Output is correct
21 Correct 4 ms 5072 KB Output is correct
22 Correct 3 ms 5072 KB Output is correct
23 Correct 3 ms 5072 KB Output is correct
24 Correct 4 ms 5072 KB Output is correct
25 Correct 3 ms 5072 KB Output is correct
26 Correct 3 ms 5072 KB Output is correct
27 Correct 3 ms 5072 KB Output is correct
28 Correct 3 ms 5072 KB Output is correct
29 Correct 21 ms 5072 KB Output is correct
30 Correct 20 ms 5072 KB Output is correct
31 Correct 3 ms 5072 KB Output is correct
32 Correct 3 ms 5072 KB Output is correct
33 Correct 3 ms 5072 KB Output is correct
34 Correct 3 ms 5116 KB Output is correct
35 Correct 6 ms 5072 KB Output is correct
36 Correct 3 ms 5072 KB Output is correct
37 Correct 21 ms 5200 KB Output is correct
38 Correct 21 ms 5196 KB Output is correct
39 Correct 4 ms 5200 KB Output is correct
40 Correct 3 ms 5072 KB Output is correct
41 Correct 3 ms 5072 KB Output is correct
42 Correct 3 ms 5072 KB Output is correct
43 Correct 468 ms 8660 KB Output is correct
44 Correct 975 ms 12532 KB Output is correct
45 Correct 815 ms 12416 KB Output is correct
46 Correct 783 ms 12448 KB Output is correct
47 Correct 588 ms 8732 KB Output is correct
48 Correct 961 ms 12428 KB Output is correct
49 Correct 1010 ms 12408 KB Output is correct
50 Correct 909 ms 12408 KB Output is correct
51 Correct 470 ms 5200 KB Output is correct
52 Correct 810 ms 5516 KB Output is correct
53 Correct 872 ms 5516 KB Output is correct
54 Correct 917 ms 5456 KB Output is correct
55 Incorrect 916 ms 16380 KB 1st lines differ - on the 1st token, expected: '732332002', found: '177616322'
56 Halted 0 ms 0 KB -