oj.uz

답안 #711353

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
711353 2023-03-16T17:12:18 Z Jarif_Rahman 디지털 회로 (IOI22_circuit) C++17
100 / 100
 1071 ms 37528 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

const ll md = 1000002022;

struct segtree{
    struct node{
        ll x = 0, sum = 0;
        bool rev = 0;
        node(){
        }
        node operator+(node X){
            node rt;
            rt.sum = (sum+X.sum)%md;
            rt.x = (x+X.x)%md;
            return rt;
        }
        void pushdown(node &X){
            if(!rev) return;
            X.rev^=rev;
            X.x = (X.sum-X.x)%md;
        }
    };
    int k;
    vector<node> v;
    segtree(const vector<ll>& sum){
        int n = sum.size();
        k = 1;
        while(k < n) k*=2;
        v.resize(2*k, node());
        for(int i = k; i < k+n; i++) v[i].sum = sum[i-k];
        for(int i = k-1; i > 0; i--) v[i] = v[2*i]+v[2*i+1];
    }
    void update(int l, int r, int nd, int a, int b){
        if(a > r || b < l) return;
        if(a >= l && b <= r){
            v[nd].rev^=1;
            v[nd].x = v[nd].sum-v[nd].x;
            return;
        }
        int mid = (a+b)/2;
        v[nd].pushdown(v[2*nd]);
        v[nd].pushdown(v[2*nd+1]);
        v[nd].rev = 0;
        update(l, r, 2*nd, a, mid);
        update(l, r, 2*nd+1, mid+1, b);
        v[nd] = v[2*nd]+v[2*nd+1];
    }
    void update(int l, int r){
        update(l, r, 1, 0, k-1);
    }
    int get(){
        if(v[1].x < 0) v[1].x+=md;
        return v[1].x;
    }
};

int n, m;
vector<int> P, A;
vector<vector<int>> tree;
vector<ll> options, coefficient;
segtree s({});

void dfs(int nd){
    if(nd >= n) return;
    options[nd] = tree[nd].size();
    for(int x: tree[nd]) dfs(x), options[nd]*=options[x], options[nd]%=md;
}
void dfs2(int nd, ll coeff){
    if(nd >= n){
        coefficient[nd-n] = coeff;
        return;
    }
    int k = tree[nd].size();
    vector<ll> pref, suff;
    for(int x: tree[nd]) pref.pb(options[x]), suff.pb(options[x]);
    for(int i = 1; i < k; i++) pref[i] = (pref[i]*pref[i-1])%md;
    for(int i = k-2; i >= 0; i--) suff[i] = (suff[i]*suff[i+1])%md;
    for(int i = 0; i < k; i++){
        ll _coeff = coeff;
        if(i) _coeff*=pref[i-1], _coeff%=md;
        if(i != k-1) _coeff*=suff[i+1], _coeff%=md;
        dfs2(tree[nd][i], _coeff);
    }
}

void init(int _n, int _m, vector<int> _P, vector<int> _A){
    swap(n, _n), swap(m, _m), swap(P, _P), swap(A, _A);
    tree.resize(n+m);
    for(int i = 1; i < n+m; i++) tree[P[i]].pb(i);

    options.assign(n+m, 1);
    coefficient.resize(m);
    dfs(0);
    dfs2(0, 1);
    s = segtree(coefficient);
    for(int i = 0; i < m; i++) if(A[i]) s.update(i, i);
}

int count_ways(int L, int R){
    s.update(L-n, R-n);
    return s.get();
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 2 ms 464 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 1 ms 336 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 612 ms 5964 KB Output is correct
2 Correct 876 ms 11612 KB Output is correct
3 Correct 883 ms 11732 KB Output is correct
4 Correct 999 ms 11604 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 612 ms 5964 KB Output is correct
2 Correct 876 ms 11612 KB Output is correct
3 Correct 883 ms 11732 KB Output is correct
4 Correct 999 ms 11604 KB Output is correct
5 Correct 862 ms 5964 KB Output is correct
6 Correct 984 ms 11608 KB Output is correct
7 Correct 924 ms 11604 KB Output is correct
8 Correct 927 ms 11604 KB Output is correct
9 Correct 475 ms 592 KB Output is correct
10 Correct 698 ms 996 KB Output is correct
11 Correct 865 ms 1096 KB Output is correct
12 Correct 486 ms 1004 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 2 ms 464 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 612 ms 5964 KB Output is correct
14 Correct 876 ms 11612 KB Output is correct
15 Correct 883 ms 11732 KB Output is correct
16 Correct 999 ms 11604 KB Output is correct
17 Correct 862 ms 5964 KB Output is correct
18 Correct 984 ms 11608 KB Output is correct
19 Correct 924 ms 11604 KB Output is correct
20 Correct 927 ms 11604 KB Output is correct
21 Correct 475 ms 592 KB Output is correct
22 Correct 698 ms 996 KB Output is correct
23 Correct 865 ms 1096 KB Output is correct
24 Correct 486 ms 1004 KB Output is correct
25 Correct 903 ms 18764 KB Output is correct
26 Correct 1008 ms 18992 KB Output is correct
27 Correct 1018 ms 19088 KB Output is correct
28 Correct 807 ms 19104 KB Output is correct
29 Correct 1000 ms 34744 KB Output is correct
30 Correct 1022 ms 34740 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 2 ms 464 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 592 KB Output is correct
19 Correct 2 ms 592 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 2 ms 464 KB Output is correct
26 Correct 2 ms 464 KB Output is correct
27 Correct 2 ms 464 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 356 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 2 ms 592 KB Output is correct
37 Correct 2 ms 592 KB Output is correct
38 Correct 2 ms 592 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 621 ms 852 KB Output is correct
44 Correct 810 ms 940 KB Output is correct
45 Correct 733 ms 888 KB Output is correct
46 Correct 824 ms 1320 KB Output is correct
47 Correct 796 ms 1312 KB Output is correct
48 Correct 805 ms 1312 KB Output is correct
49 Correct 714 ms 1312 KB Output is correct
50 Correct 603 ms 1328 KB Output is correct
51 Correct 759 ms 1056 KB Output is correct
52 Correct 774 ms 1056 KB Output is correct
53 Correct 692 ms 1616 KB Output is correct
54 Correct 859 ms 1312 KB Output is correct
55 Correct 708 ms 1136 KB Output is correct
56 Correct 696 ms 1084 KB Output is correct
57 Correct 718 ms 976 KB Output is correct
58 Correct 667 ms 2396 KB Output is correct
59 Correct 908 ms 2548 KB Output is correct
60 Correct 706 ms 2564 KB Output is correct
61 Correct 792 ms 1160 KB Output is correct
62 Correct 834 ms 848 KB Output is correct
63 Correct 788 ms 720 KB Output is correct
64 Correct 913 ms 976 KB Output is correct
65 Correct 373 ms 592 KB Output is correct
66 Correct 760 ms 996 KB Output is correct
67 Correct 754 ms 1008 KB Output is correct
68 Correct 701 ms 1004 KB Output is correct

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 2 ms 464 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 592 KB Output is correct
19 Correct 2 ms 592 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 2 ms 464 KB Output is correct
26 Correct 2 ms 464 KB Output is correct
27 Correct 2 ms 464 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 356 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 2 ms 592 KB Output is correct
37 Correct 2 ms 592 KB Output is correct
38 Correct 2 ms 592 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 612 ms 5964 KB Output is correct
44 Correct 876 ms 11612 KB Output is correct
45 Correct 883 ms 11732 KB Output is correct
46 Correct 999 ms 11604 KB Output is correct
47 Correct 862 ms 5964 KB Output is correct
48 Correct 984 ms 11608 KB Output is correct
49 Correct 924 ms 11604 KB Output is correct
50 Correct 927 ms 11604 KB Output is correct
51 Correct 475 ms 592 KB Output is correct
52 Correct 698 ms 996 KB Output is correct
53 Correct 865 ms 1096 KB Output is correct
54 Correct 486 ms 1004 KB Output is correct
55 Correct 903 ms 18764 KB Output is correct
56 Correct 1008 ms 18992 KB Output is correct
57 Correct 1018 ms 19088 KB Output is correct
58 Correct 807 ms 19104 KB Output is correct
59 Correct 1000 ms 34744 KB Output is correct
60 Correct 1022 ms 34740 KB Output is correct
61 Correct 621 ms 852 KB Output is correct
62 Correct 810 ms 940 KB Output is correct
63 Correct 733 ms 888 KB Output is correct
64 Correct 824 ms 1320 KB Output is correct
65 Correct 796 ms 1312 KB Output is correct
66 Correct 805 ms 1312 KB Output is correct
67 Correct 714 ms 1312 KB Output is correct
68 Correct 603 ms 1328 KB Output is correct
69 Correct 759 ms 1056 KB Output is correct
70 Correct 774 ms 1056 KB Output is correct
71 Correct 692 ms 1616 KB Output is correct
72 Correct 859 ms 1312 KB Output is correct
73 Correct 708 ms 1136 KB Output is correct
74 Correct 696 ms 1084 KB Output is correct
75 Correct 718 ms 976 KB Output is correct
76 Correct 667 ms 2396 KB Output is correct
77 Correct 908 ms 2548 KB Output is correct
78 Correct 706 ms 2564 KB Output is correct
79 Correct 792 ms 1160 KB Output is correct
80 Correct 834 ms 848 KB Output is correct
81 Correct 788 ms 720 KB Output is correct
82 Correct 913 ms 976 KB Output is correct
83 Correct 373 ms 592 KB Output is correct
84 Correct 760 ms 996 KB Output is correct
85 Correct 754 ms 1008 KB Output is correct
86 Correct 701 ms 1004 KB Output is correct
87 Correct 0 ms 208 KB Output is correct
88 Correct 552 ms 17628 KB Output is correct
89 Correct 947 ms 11620 KB Output is correct
90 Correct 789 ms 11336 KB Output is correct
91 Correct 882 ms 19104 KB Output is correct
92 Correct 1061 ms 19120 KB Output is correct
93 Correct 1024 ms 19128 KB Output is correct
94 Correct 963 ms 19204 KB Output is correct
95 Correct 741 ms 19228 KB Output is correct
96 Correct 814 ms 13188 KB Output is correct
97 Correct 996 ms 13192 KB Output is correct
98 Correct 655 ms 29276 KB Output is correct
99 Correct 1071 ms 19016 KB Output is correct
100 Correct 997 ms 15464 KB Output is correct
101 Correct 894 ms 14324 KB Output is correct
102 Correct 885 ms 12492 KB Output is correct
103 Correct 807 ms 34744 KB Output is correct
104 Correct 986 ms 37524 KB Output is correct
105 Correct 750 ms 37528 KB Output is correct
106 Correct 783 ms 16040 KB Output is correct
107 Correct 848 ms 13084 KB Output is correct
108 Correct 741 ms 12984 KB Output is correct
109 Correct 1030 ms 12600 KB Output is correct