oj.uz

답안 #705571

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
705571 2023-03-04T16:40:53 Z danikoynov 디지털 회로 (IOI22_circuit) C++17
62 / 100
 3000 ms 17432 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, bool type)
{
    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])
    {
        int i = c;
        if (type == false)
            i = 1;
        for (i; 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, true);



}

ll pw[maxn], pref[maxn];
ll con[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] = (con[left] * a[left]) % mod;
        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]) % mod;
}

ll get_sum(int left, int right)
{
    ll sum = pref[right];
    if (left != 0)
        sum = sum - pref[left - 1];
    if (sum < 0)
        sum += mod;
    return sum;
}

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

    tree[root] = (get_sum(left, right) - tree[root] + mod) % mod;
    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);
        ///cout << left << " :: " << right << " :: " << tree[root] << endl;
        return;
    }

    int mid = (left + right) / 2;
    update_range(root * 2, left, mid, qleft, qright);
    update_range(root * 2 + 1, mid + 1, right, qleft,  qright);
    ///cout << root << " " << left << " " << right << " " << qleft << " " << qright << endl;
    tree[root] = (tree[root * 2] + tree[root * 2 + 1]) % mod;
    ///cout << tree[root] << endl;
}



void init(int N, int M, std::vector<int> P, std::vector<int> A)
{
    n = N;
    m = M;
    for (int i = 0; i < N + M; i ++)
        p[i] = P[i];


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



    solve_state(0);
    for (int i = 0; i < M; i ++)
    {
        a[i] = 1;
        int v = i + n;
        while(v != -1)
        {
            update_state(v, false);
            v = p[v];
        }
        ///solve_state(0);
        con[i] = dp[0][1];
        a[i] = 0;
                 v = i + n;
        while(v != -1)
        {
            update_state(v, false);
            v = p[v];
        }
    }
    pref[0] = con[0];
    for (int i = 1; i < M; i ++)
        pref[i] = (pref[i - 1] + con[i]) % mod;
    for (int i = 0; i < M; i ++)
        a[i] = A[i];


    build_tree(1, 0, m - 1);

}


int count_ways(int L, int R)
{
    update_range(1, 0, m - 1, L - n, R - n);
    ///for (int i = L - n; i <= R - n; i ++)
       /// a[i] = ((a[i] + 1) & 1);

    /**ll ans = 0;
    for (int i = 0; i < m; i ++)
    {

        ans = (ans + (con[i] * a[i])) % mod;
    }*/


    /**cout << "-----------" << endl;
    for (int i = 0; i < n + m; i ++)
        cout << i << " : " << dp[i][0] << " " << dp[i][1] << endl;*/

    return tree[1];
}

Compilation message

circuit.cpp: In function 'void update_state(int, bool)':
circuit.cpp:37:14: warning: statement has no effect [-Wunused-value]
   37 |         for (i; i >= 0; i --)
      |              ^

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 32 ms 5092 KB Output is correct
4 Correct 33 ms 5076 KB Output is correct
5 Correct 35 ms 5156 KB Output is correct
6 Correct 33 ms 5088 KB Output is correct
7 Correct 34 ms 5088 KB Output is correct
8 Correct 34 ms 5200 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 4 ms 5072 KB Output is correct
8 Correct 4 ms 5072 KB Output is correct
9 Correct 5 ms 5072 KB Output is correct
10 Correct 41 ms 5156 KB Output is correct
11 Correct 41 ms 5072 KB Output is correct
12 Correct 4 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 32 ms 5092 KB Output is correct
4 Correct 33 ms 5076 KB Output is correct
5 Correct 35 ms 5156 KB Output is correct
6 Correct 33 ms 5088 KB Output is correct
7 Correct 34 ms 5088 KB Output is correct
8 Correct 34 ms 5200 KB Output is correct
9 Correct 3 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 4 ms 5072 KB Output is correct
16 Correct 4 ms 5072 KB Output is correct
17 Correct 5 ms 5072 KB Output is correct
18 Correct 41 ms 5156 KB Output is correct
19 Correct 41 ms 5072 KB Output is correct
20 Correct 4 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 5180 KB Output is correct
25 Correct 4 ms 5072 KB Output is correct
26 Correct 4 ms 5072 KB Output is correct
27 Correct 5 ms 5072 KB Output is correct
28 Correct 4 ms 5072 KB Output is correct
29 Correct 35 ms 5076 KB Output is correct
30 Correct 34 ms 5088 KB Output is correct
31 Correct 3 ms 5072 KB Output is correct
32 Correct 4 ms 5072 KB Output is correct
33 Correct 4 ms 5072 KB Output is correct
34 Correct 4 ms 5096 KB Output is correct
35 Correct 18 ms 5072 KB Output is correct
36 Correct 40 ms 5156 KB Output is correct
37 Correct 82 ms 5148 KB Output is correct
38 Correct 83 ms 5192 KB Output is correct
39 Correct 6 ms 5072 KB Output is correct
40 Correct 4 ms 5072 KB Output is correct
41 Correct 4 ms 5072 KB Output is correct
42 Correct 7 ms 5200 KB Output is correct

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 540 ms 8928 KB Output is correct
2 Correct 1018 ms 12964 KB Output is correct
3 Correct 782 ms 12976 KB Output is correct
4 Correct 716 ms 12996 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 540 ms 8928 KB Output is correct
2 Correct 1018 ms 12964 KB Output is correct
3 Correct 782 ms 12976 KB Output is correct
4 Correct 716 ms 12996 KB Output is correct
5 Correct 730 ms 8964 KB Output is correct
6 Correct 1004 ms 12984 KB Output is correct
7 Correct 904 ms 13060 KB Output is correct
8 Correct 1041 ms 12956 KB Output is correct
9 Correct 484 ms 5212 KB Output is correct
10 Correct 877 ms 5456 KB Output is correct
11 Correct 758 ms 5456 KB Output is correct
12 Correct 924 ms 5456 KB Output is correct

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 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 4 ms 5072 KB Output is correct
8 Correct 4 ms 5072 KB Output is correct
9 Correct 5 ms 5072 KB Output is correct
10 Correct 41 ms 5156 KB Output is correct
11 Correct 41 ms 5072 KB Output is correct
12 Correct 4 ms 5072 KB Output is correct
13 Correct 540 ms 8928 KB Output is correct
14 Correct 1018 ms 12964 KB Output is correct
15 Correct 782 ms 12976 KB Output is correct
16 Correct 716 ms 12996 KB Output is correct
17 Correct 730 ms 8964 KB Output is correct
18 Correct 1004 ms 12984 KB Output is correct
19 Correct 904 ms 13060 KB Output is correct
20 Correct 1041 ms 12956 KB Output is correct
21 Correct 484 ms 5212 KB Output is correct
22 Correct 877 ms 5456 KB Output is correct
23 Correct 758 ms 5456 KB Output is correct
24 Correct 924 ms 5456 KB Output is correct
25 Correct 1178 ms 17188 KB Output is correct
26 Correct 1263 ms 17352 KB Output is correct
27 Correct 1355 ms 17432 KB Output is correct
28 Correct 1047 ms 17400 KB Output is correct
29 Execution timed out 3024 ms 16708 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #7
28.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 32 ms 5092 KB Output is correct
4 Correct 33 ms 5076 KB Output is correct
5 Correct 35 ms 5156 KB Output is correct
6 Correct 33 ms 5088 KB Output is correct
7 Correct 34 ms 5088 KB Output is correct
8 Correct 34 ms 5200 KB Output is correct
9 Correct 3 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 4 ms 5072 KB Output is correct
16 Correct 4 ms 5072 KB Output is correct
17 Correct 5 ms 5072 KB Output is correct
18 Correct 41 ms 5156 KB Output is correct
19 Correct 41 ms 5072 KB Output is correct
20 Correct 4 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 5180 KB Output is correct
25 Correct 4 ms 5072 KB Output is correct
26 Correct 4 ms 5072 KB Output is correct
27 Correct 5 ms 5072 KB Output is correct
28 Correct 4 ms 5072 KB Output is correct
29 Correct 35 ms 5076 KB Output is correct
30 Correct 34 ms 5088 KB Output is correct
31 Correct 3 ms 5072 KB Output is correct
32 Correct 4 ms 5072 KB Output is correct
33 Correct 4 ms 5072 KB Output is correct
34 Correct 4 ms 5096 KB Output is correct
35 Correct 18 ms 5072 KB Output is correct
36 Correct 40 ms 5156 KB Output is correct
37 Correct 82 ms 5148 KB Output is correct
38 Correct 83 ms 5192 KB Output is correct
39 Correct 6 ms 5072 KB Output is correct
40 Correct 4 ms 5072 KB Output is correct
41 Correct 4 ms 5072 KB Output is correct
42 Correct 7 ms 5200 KB Output is correct
43 Correct 685 ms 5328 KB Output is correct
44 Correct 1004 ms 5456 KB Output is correct
45 Correct 851 ms 5360 KB Output is correct
46 Correct 868 ms 5680 KB Output is correct
47 Correct 814 ms 5704 KB Output is correct
48 Correct 566 ms 5640 KB Output is correct
49 Correct 936 ms 5712 KB Output is correct
50 Correct 705 ms 5692 KB Output is correct
51 Correct 1530 ms 5548 KB Output is correct
52 Correct 1769 ms 5528 KB Output is correct
53 Correct 729 ms 5328 KB Output is correct
54 Correct 907 ms 5636 KB Output is correct
55 Correct 835 ms 5544 KB Output is correct
56 Correct 803 ms 5448 KB Output is correct
57 Correct 980 ms 5620 KB Output is correct
58 Correct 1916 ms 5864 KB Output is correct
59 Correct 2701 ms 6100 KB Output is correct
60 Correct 2910 ms 5860 KB Output is correct
61 Correct 1004 ms 5380 KB Output is correct
62 Correct 671 ms 5328 KB Output is correct
63 Correct 771 ms 5328 KB Output is correct
64 Correct 860 ms 5380 KB Output is correct
65 Correct 483 ms 5212 KB Output is correct
66 Correct 909 ms 5456 KB Output is correct
67 Correct 875 ms 5456 KB Output is correct
68 Correct 766 ms 5460 KB Output is correct

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 32 ms 5092 KB Output is correct
4 Correct 33 ms 5076 KB Output is correct
5 Correct 35 ms 5156 KB Output is correct
6 Correct 33 ms 5088 KB Output is correct
7 Correct 34 ms 5088 KB Output is correct
8 Correct 34 ms 5200 KB Output is correct
9 Correct 3 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 4 ms 5072 KB Output is correct
16 Correct 4 ms 5072 KB Output is correct
17 Correct 5 ms 5072 KB Output is correct
18 Correct 41 ms 5156 KB Output is correct
19 Correct 41 ms 5072 KB Output is correct
20 Correct 4 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 5180 KB Output is correct
25 Correct 4 ms 5072 KB Output is correct
26 Correct 4 ms 5072 KB Output is correct
27 Correct 5 ms 5072 KB Output is correct
28 Correct 4 ms 5072 KB Output is correct
29 Correct 35 ms 5076 KB Output is correct
30 Correct 34 ms 5088 KB Output is correct
31 Correct 3 ms 5072 KB Output is correct
32 Correct 4 ms 5072 KB Output is correct
33 Correct 4 ms 5072 KB Output is correct
34 Correct 4 ms 5096 KB Output is correct
35 Correct 18 ms 5072 KB Output is correct
36 Correct 40 ms 5156 KB Output is correct
37 Correct 82 ms 5148 KB Output is correct
38 Correct 83 ms 5192 KB Output is correct
39 Correct 6 ms 5072 KB Output is correct
40 Correct 4 ms 5072 KB Output is correct
41 Correct 4 ms 5072 KB Output is correct
42 Correct 7 ms 5200 KB Output is correct
43 Correct 540 ms 8928 KB Output is correct
44 Correct 1018 ms 12964 KB Output is correct
45 Correct 782 ms 12976 KB Output is correct
46 Correct 716 ms 12996 KB Output is correct
47 Correct 730 ms 8964 KB Output is correct
48 Correct 1004 ms 12984 KB Output is correct
49 Correct 904 ms 13060 KB Output is correct
50 Correct 1041 ms 12956 KB Output is correct
51 Correct 484 ms 5212 KB Output is correct
52 Correct 877 ms 5456 KB Output is correct
53 Correct 758 ms 5456 KB Output is correct
54 Correct 924 ms 5456 KB Output is correct
55 Correct 1178 ms 17188 KB Output is correct
56 Correct 1263 ms 17352 KB Output is correct
57 Correct 1355 ms 17432 KB Output is correct
58 Correct 1047 ms 17400 KB Output is correct
59 Execution timed out 3024 ms 16708 KB Time limit exceeded
60 Halted 0 ms 0 KB -