oj.uz

답안 #705520

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
705520 2023-03-04T15:12:15 Z danikoynov 디지털 회로 (IOI22_circuit) C++17
9 / 100
 3000 ms 8220 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];
}


ll con[maxn];
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);
    }
    for (int i = 0; i < M; i ++)
    {
        a[i] = 1;
        solve_state(0);
        con[i] = dp[0][1];
        a[i] = 0;
    }

    for (int i = 0; i < M; i ++)
        a[i] = A[i];
}


int count_ways(int L, int R)
{

    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 ans;
}

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 2657 ms 5072 KB Output is correct
4 Correct 2948 ms 5072 KB Output is correct
5 Correct 2869 ms 5200 KB Output is correct
6 Correct 2877 ms 5072 KB Output is correct
7 Correct 2855 ms 5072 KB Output is correct
8 Correct 2901 ms 5072 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 6 ms 5052 KB Output is correct
3 Correct 18 ms 5080 KB Output is correct
4 Correct 18 ms 5076 KB Output is correct
5 Correct 16 ms 5072 KB Output is correct
6 Correct 40 ms 5096 KB Output is correct
7 Correct 72 ms 5124 KB Output is correct
8 Correct 83 ms 5128 KB Output is correct
9 Correct 72 ms 5116 KB Output is correct
10 Correct 55 ms 5128 KB Output is correct
11 Correct 57 ms 5128 KB Output is correct
12 Correct 44 ms 5072 KB Output is correct

Subtask #3
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 2657 ms 5072 KB Output is correct
4 Correct 2948 ms 5072 KB Output is correct
5 Correct 2869 ms 5200 KB Output is correct
6 Correct 2877 ms 5072 KB Output is correct
7 Correct 2855 ms 5072 KB Output is correct
8 Correct 2901 ms 5072 KB Output is correct
9 Correct 3 ms 4944 KB Output is correct
10 Correct 6 ms 5052 KB Output is correct
11 Correct 18 ms 5080 KB Output is correct
12 Correct 18 ms 5076 KB Output is correct
13 Correct 16 ms 5072 KB Output is correct
14 Correct 40 ms 5096 KB Output is correct
15 Correct 72 ms 5124 KB Output is correct
16 Correct 83 ms 5128 KB Output is correct
17 Correct 72 ms 5116 KB Output is correct
18 Correct 55 ms 5128 KB Output is correct
19 Correct 57 ms 5128 KB Output is correct
20 Correct 44 ms 5072 KB Output is correct
21 Correct 61 ms 5096 KB Output is correct
22 Correct 27 ms 5096 KB Output is correct
23 Correct 24 ms 5072 KB Output is correct
24 Correct 79 ms 5104 KB Output is correct
25 Correct 76 ms 5112 KB Output is correct
26 Correct 73 ms 5072 KB Output is correct
27 Correct 74 ms 5196 KB Output is correct
28 Correct 75 ms 5104 KB Output is correct
29 Correct 2893 ms 5072 KB Output is correct
30 Correct 2894 ms 5192 KB Output is correct
31 Correct 3 ms 5000 KB Output is correct
32 Correct 69 ms 5128 KB Output is correct
33 Correct 54 ms 5076 KB Output is correct
34 Correct 47 ms 5104 KB Output is correct
35 Correct 515 ms 5048 KB Output is correct
36 Correct 63 ms 5072 KB Output is correct
37 Correct 2995 ms 5272 KB Output is correct
38 Execution timed out 3030 ms 5152 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3032 ms 8220 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3032 ms 8220 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 6 ms 5052 KB Output is correct
3 Correct 18 ms 5080 KB Output is correct
4 Correct 18 ms 5076 KB Output is correct
5 Correct 16 ms 5072 KB Output is correct
6 Correct 40 ms 5096 KB Output is correct
7 Correct 72 ms 5124 KB Output is correct
8 Correct 83 ms 5128 KB Output is correct
9 Correct 72 ms 5116 KB Output is correct
10 Correct 55 ms 5128 KB Output is correct
11 Correct 57 ms 5128 KB Output is correct
12 Correct 44 ms 5072 KB Output is correct
13 Execution timed out 3032 ms 8220 KB Time limit exceeded
14 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 2657 ms 5072 KB Output is correct
4 Correct 2948 ms 5072 KB Output is correct
5 Correct 2869 ms 5200 KB Output is correct
6 Correct 2877 ms 5072 KB Output is correct
7 Correct 2855 ms 5072 KB Output is correct
8 Correct 2901 ms 5072 KB Output is correct
9 Correct 3 ms 4944 KB Output is correct
10 Correct 6 ms 5052 KB Output is correct
11 Correct 18 ms 5080 KB Output is correct
12 Correct 18 ms 5076 KB Output is correct
13 Correct 16 ms 5072 KB Output is correct
14 Correct 40 ms 5096 KB Output is correct
15 Correct 72 ms 5124 KB Output is correct
16 Correct 83 ms 5128 KB Output is correct
17 Correct 72 ms 5116 KB Output is correct
18 Correct 55 ms 5128 KB Output is correct
19 Correct 57 ms 5128 KB Output is correct
20 Correct 44 ms 5072 KB Output is correct
21 Correct 61 ms 5096 KB Output is correct
22 Correct 27 ms 5096 KB Output is correct
23 Correct 24 ms 5072 KB Output is correct
24 Correct 79 ms 5104 KB Output is correct
25 Correct 76 ms 5112 KB Output is correct
26 Correct 73 ms 5072 KB Output is correct
27 Correct 74 ms 5196 KB Output is correct
28 Correct 75 ms 5104 KB Output is correct
29 Correct 2893 ms 5072 KB Output is correct
30 Correct 2894 ms 5192 KB Output is correct
31 Correct 3 ms 5000 KB Output is correct
32 Correct 69 ms 5128 KB Output is correct
33 Correct 54 ms 5076 KB Output is correct
34 Correct 47 ms 5104 KB Output is correct
35 Correct 515 ms 5048 KB Output is correct
36 Correct 63 ms 5072 KB Output is correct
37 Correct 2995 ms 5272 KB Output is correct
38 Execution timed out 3030 ms 5152 KB Time limit exceeded
39 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 2657 ms 5072 KB Output is correct
4 Correct 2948 ms 5072 KB Output is correct
5 Correct 2869 ms 5200 KB Output is correct
6 Correct 2877 ms 5072 KB Output is correct
7 Correct 2855 ms 5072 KB Output is correct
8 Correct 2901 ms 5072 KB Output is correct
9 Correct 3 ms 4944 KB Output is correct
10 Correct 6 ms 5052 KB Output is correct
11 Correct 18 ms 5080 KB Output is correct
12 Correct 18 ms 5076 KB Output is correct
13 Correct 16 ms 5072 KB Output is correct
14 Correct 40 ms 5096 KB Output is correct
15 Correct 72 ms 5124 KB Output is correct
16 Correct 83 ms 5128 KB Output is correct
17 Correct 72 ms 5116 KB Output is correct
18 Correct 55 ms 5128 KB Output is correct
19 Correct 57 ms 5128 KB Output is correct
20 Correct 44 ms 5072 KB Output is correct
21 Correct 61 ms 5096 KB Output is correct
22 Correct 27 ms 5096 KB Output is correct
23 Correct 24 ms 5072 KB Output is correct
24 Correct 79 ms 5104 KB Output is correct
25 Correct 76 ms 5112 KB Output is correct
26 Correct 73 ms 5072 KB Output is correct
27 Correct 74 ms 5196 KB Output is correct
28 Correct 75 ms 5104 KB Output is correct
29 Correct 2893 ms 5072 KB Output is correct
30 Correct 2894 ms 5192 KB Output is correct
31 Correct 3 ms 5000 KB Output is correct
32 Correct 69 ms 5128 KB Output is correct
33 Correct 54 ms 5076 KB Output is correct
34 Correct 47 ms 5104 KB Output is correct
35 Correct 515 ms 5048 KB Output is correct
36 Correct 63 ms 5072 KB Output is correct
37 Correct 2995 ms 5272 KB Output is correct
38 Execution timed out 3030 ms 5152 KB Time limit exceeded
39 Halted 0 ms 0 KB -