답안 #830986

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
830986	2023-08-19T14:31:18 Z	beaconmc	디지털 회로 (IOI22_circuit)	C++17	89 / 100	3000 ms	33748 KB

circuit

#include "circuit.h"


#include <bits/stdc++.h>

typedef long long ll;
using namespace std;


#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)


vector<ll> edges[200001];
ll possible[200001];
ll contrib[200001];
ll dps[200001];
vector<int> p;




int initdfs(ll a){
  if (edges[a].size() == 0) return possible[a] = 1;

  ll temp = 1;
  for (auto&i : edges[a]){
    temp *= initdfs(i);
    temp %= 1000002022;
  }
  temp *= edges[a].size();
  temp %= 1000002022;


  return possible[a] = temp;
}

int dp(ll a){
  if (a==0) return 1;
  if (dps[a] != -1) return dps[a];

  ll temp = 1;

  for (auto&i : edges[p[a]]){
    if (i != a) temp *= possible[i];
    temp %= 1000002022;
  }
  dps[a] = temp * dp(p[a]) % 1000002022;
  return dps[a];
}

ll n,m;



const ll NN = (1<<18);
ll tree[NN*2];
ll actual[NN*2];
ll lazy[NN*2];

int actupd(ll a, ll b, ll val, ll k=1, ll x = 0, ll y = NN-1){

  if (b<x || a>y) return actual[k];
  if (a<=x && y<=b){

    actual[k] += val;
    actual[k] %= 1000002022;
    return actual[k];
  }
  ll mid = (x+y)/2;


  actual[k] =  actupd(a,b,val,k*2, x, mid) + actupd(a,b,val,k*2+1, mid+1, y);
  actual[k] %= 1000002022;

  return actual[k];
}


void prop(ll k){
  lazy[k*2] += lazy[k];
  lazy[k*2+1] += lazy[k];
  if (lazy[k] %2==1){
    tree[k] = (actual[k] - tree[k]+1000002022)%1000002022;
  }
  lazy[k] = 0;
}


int upd(ll a, ll b, ll k=1, ll x = 0, ll y = NN-1){
  if (b<x || a>y) return lazy[k]%2==0 ? tree[k] : ((actual[k] - tree[k]+1000002022)%1000002022);
  if (a<=x && y<=b){
    lazy[k] += 1;
    return lazy[k]%2==0 ? tree[k] : ((actual[k] - tree[k]+1000002022)%1000002022);
  }
  ll mid = (x+y)/2;
  prop(k);

  tree[k] = upd(a,b,k*2, x, mid) + upd(a,b,k*2+1, mid+1, y);
  tree[k] %= 1000002022;
  return lazy[k]%2==0 ? tree[k] : ((actual[k] - tree[k]+1000002022)%1000002022);
}

void init(int N, int M, std::vector<int> P, std::vector<int> A) {
  FOR(i,0,200001) dps[i] = -1;
  FOR(i,0,NN*2) tree[i] = 0, actual[i] = 0, lazy[i] = 0;
  p = P;
  n = N;
  m = M;
  FOR(i,1,N+M){
    edges[P[i]].push_back(i);
  }
  initdfs(0);


  FOR(i,N,N+M){
    ll temp = possible[i];
    temp *= dp(i);
    contrib[i] = temp%1000002022;
  }
  FOR(i,n,n+m){
    actupd(i-n+1, i-n+1, contrib[i]);
  }
  FOR(i,0,NN*2) tree[i] = actual[i];
  FOR(i,n,n+m){
    if (A[i-n] == 0){
      upd(i-n+1, i-n+1);
    }
  }


}





int count_ways(int L, int R) {
  upd(L-n+1, R-n+1);


  return lazy[1]%2==0 ? tree[1] : ((actual[1] - tree[1]+1000002022)%1000002022);

}

Subtask #1
2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	18856 KB	Output is correct
2	Correct	9 ms	18812 KB	Output is correct
3	Correct	13 ms	18932 KB	Output is correct
4	Correct	13 ms	18932 KB	Output is correct
5	Correct	12 ms	18896 KB	Output is correct
6	Correct	12 ms	18932 KB	Output is correct
7	Correct	14 ms	18932 KB	Output is correct
8	Correct	14 ms	18824 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	18768 KB	Output is correct
2	Correct	8 ms	18884 KB	Output is correct
3	Correct	9 ms	18924 KB	Output is correct
4	Correct	8 ms	18896 KB	Output is correct
5	Correct	9 ms	18896 KB	Output is correct
6	Correct	10 ms	18916 KB	Output is correct
7	Correct	9 ms	18896 KB	Output is correct
8	Correct	9 ms	18896 KB	Output is correct
9	Correct	9 ms	18896 KB	Output is correct
10	Correct	10 ms	19036 KB	Output is correct
11	Correct	9 ms	19024 KB	Output is correct
12	Correct	9 ms	18920 KB	Output is correct

Subtask #3
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	18856 KB	Output is correct
2	Correct	9 ms	18812 KB	Output is correct
3	Correct	13 ms	18932 KB	Output is correct
4	Correct	13 ms	18932 KB	Output is correct
5	Correct	12 ms	18896 KB	Output is correct
6	Correct	12 ms	18932 KB	Output is correct
7	Correct	14 ms	18932 KB	Output is correct
8	Correct	14 ms	18824 KB	Output is correct
9	Correct	8 ms	18768 KB	Output is correct
10	Correct	8 ms	18884 KB	Output is correct
11	Correct	9 ms	18924 KB	Output is correct
12	Correct	8 ms	18896 KB	Output is correct
13	Correct	9 ms	18896 KB	Output is correct
14	Correct	10 ms	18916 KB	Output is correct
15	Correct	9 ms	18896 KB	Output is correct
16	Correct	9 ms	18896 KB	Output is correct
17	Correct	9 ms	18896 KB	Output is correct
18	Correct	10 ms	19036 KB	Output is correct
19	Correct	9 ms	19024 KB	Output is correct
20	Correct	9 ms	18920 KB	Output is correct
21	Correct	9 ms	18896 KB	Output is correct
22	Correct	8 ms	18952 KB	Output is correct
23	Correct	9 ms	18896 KB	Output is correct
24	Correct	8 ms	18896 KB	Output is correct
25	Correct	9 ms	18924 KB	Output is correct
26	Correct	10 ms	18980 KB	Output is correct
27	Correct	10 ms	18896 KB	Output is correct
28	Correct	9 ms	18976 KB	Output is correct
29	Correct	13 ms	18880 KB	Output is correct
30	Correct	14 ms	19056 KB	Output is correct
31	Correct	9 ms	18888 KB	Output is correct
32	Correct	9 ms	18928 KB	Output is correct
33	Correct	9 ms	18896 KB	Output is correct
34	Correct	9 ms	18856 KB	Output is correct
35	Correct	11 ms	18896 KB	Output is correct
36	Correct	9 ms	19024 KB	Output is correct
37	Correct	13 ms	19048 KB	Output is correct
38	Correct	13 ms	19052 KB	Output is correct
39	Correct	8 ms	18940 KB	Output is correct
40	Correct	9 ms	18836 KB	Output is correct
41	Correct	9 ms	18884 KB	Output is correct
42	Correct	9 ms	18912 KB	Output is correct

Subtask #4
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	455 ms	21700 KB	Output is correct
2	Correct	897 ms	24448 KB	Output is correct
3	Correct	877 ms	24480 KB	Output is correct
4	Correct	836 ms	24540 KB	Output is correct

Subtask #5
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	455 ms	21700 KB	Output is correct
2	Correct	897 ms	24448 KB	Output is correct
3	Correct	877 ms	24480 KB	Output is correct
4	Correct	836 ms	24540 KB	Output is correct
5	Correct	632 ms	21672 KB	Output is correct
6	Correct	845 ms	24520 KB	Output is correct
7	Correct	838 ms	24516 KB	Output is correct
8	Correct	798 ms	24440 KB	Output is correct
9	Correct	419 ms	19024 KB	Output is correct
10	Correct	718 ms	19208 KB	Output is correct
11	Correct	683 ms	19152 KB	Output is correct
12	Correct	458 ms	19172 KB	Output is correct

Subtask #6
27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	18768 KB	Output is correct
2	Correct	8 ms	18884 KB	Output is correct
3	Correct	9 ms	18924 KB	Output is correct
4	Correct	8 ms	18896 KB	Output is correct
5	Correct	9 ms	18896 KB	Output is correct
6	Correct	10 ms	18916 KB	Output is correct
7	Correct	9 ms	18896 KB	Output is correct
8	Correct	9 ms	18896 KB	Output is correct
9	Correct	9 ms	18896 KB	Output is correct
10	Correct	10 ms	19036 KB	Output is correct
11	Correct	9 ms	19024 KB	Output is correct
12	Correct	9 ms	18920 KB	Output is correct
13	Correct	455 ms	21700 KB	Output is correct
14	Correct	897 ms	24448 KB	Output is correct
15	Correct	877 ms	24480 KB	Output is correct
16	Correct	836 ms	24540 KB	Output is correct
17	Correct	632 ms	21672 KB	Output is correct
18	Correct	845 ms	24520 KB	Output is correct
19	Correct	838 ms	24516 KB	Output is correct
20	Correct	798 ms	24440 KB	Output is correct
21	Correct	419 ms	19024 KB	Output is correct
22	Correct	718 ms	19208 KB	Output is correct
23	Correct	683 ms	19152 KB	Output is correct
24	Correct	458 ms	19172 KB	Output is correct
25	Correct	791 ms	27316 KB	Output is correct
26	Correct	819 ms	27484 KB	Output is correct
27	Correct	797 ms	27488 KB	Output is correct
28	Correct	673 ms	27392 KB	Output is correct
29	Correct	834 ms	33748 KB	Output is correct
30	Correct	809 ms	33740 KB	Output is correct

Subtask #7
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	18856 KB	Output is correct
2	Correct	9 ms	18812 KB	Output is correct
3	Correct	13 ms	18932 KB	Output is correct
4	Correct	13 ms	18932 KB	Output is correct
5	Correct	12 ms	18896 KB	Output is correct
6	Correct	12 ms	18932 KB	Output is correct
7	Correct	14 ms	18932 KB	Output is correct
8	Correct	14 ms	18824 KB	Output is correct
9	Correct	8 ms	18768 KB	Output is correct
10	Correct	8 ms	18884 KB	Output is correct
11	Correct	9 ms	18924 KB	Output is correct
12	Correct	8 ms	18896 KB	Output is correct
13	Correct	9 ms	18896 KB	Output is correct
14	Correct	10 ms	18916 KB	Output is correct
15	Correct	9 ms	18896 KB	Output is correct
16	Correct	9 ms	18896 KB	Output is correct
17	Correct	9 ms	18896 KB	Output is correct
18	Correct	10 ms	19036 KB	Output is correct
19	Correct	9 ms	19024 KB	Output is correct
20	Correct	9 ms	18920 KB	Output is correct
21	Correct	9 ms	18896 KB	Output is correct
22	Correct	8 ms	18952 KB	Output is correct
23	Correct	9 ms	18896 KB	Output is correct
24	Correct	8 ms	18896 KB	Output is correct
25	Correct	9 ms	18924 KB	Output is correct
26	Correct	10 ms	18980 KB	Output is correct
27	Correct	10 ms	18896 KB	Output is correct
28	Correct	9 ms	18976 KB	Output is correct
29	Correct	13 ms	18880 KB	Output is correct
30	Correct	14 ms	19056 KB	Output is correct
31	Correct	9 ms	18888 KB	Output is correct
32	Correct	9 ms	18928 KB	Output is correct
33	Correct	9 ms	18896 KB	Output is correct
34	Correct	9 ms	18856 KB	Output is correct
35	Correct	11 ms	18896 KB	Output is correct
36	Correct	9 ms	19024 KB	Output is correct
37	Correct	13 ms	19048 KB	Output is correct
38	Correct	13 ms	19052 KB	Output is correct
39	Correct	8 ms	18940 KB	Output is correct
40	Correct	9 ms	18836 KB	Output is correct
41	Correct	9 ms	18884 KB	Output is correct
42	Correct	9 ms	18912 KB	Output is correct
43	Correct	414 ms	19024 KB	Output is correct
44	Correct	834 ms	19152 KB	Output is correct
45	Correct	744 ms	19152 KB	Output is correct
46	Correct	520 ms	19352 KB	Output is correct
47	Correct	792 ms	19348 KB	Output is correct
48	Correct	699 ms	19268 KB	Output is correct
49	Correct	745 ms	19280 KB	Output is correct
50	Correct	799 ms	19280 KB	Output is correct
51	Correct	835 ms	19152 KB	Output is correct
52	Correct	903 ms	19156 KB	Output is correct
53	Correct	786 ms	19408 KB	Output is correct
54	Correct	714 ms	19280 KB	Output is correct
55	Correct	967 ms	19152 KB	Output is correct
56	Correct	772 ms	19172 KB	Output is correct
57	Correct	762 ms	19080 KB	Output is correct
58	Correct	668 ms	19548 KB	Output is correct
59	Correct	788 ms	19716 KB	Output is correct
60	Correct	837 ms	19728 KB	Output is correct
61	Correct	606 ms	19196 KB	Output is correct
62	Correct	706 ms	19116 KB	Output is correct
63	Correct	602 ms	19024 KB	Output is correct
64	Correct	740 ms	19024 KB	Output is correct
65	Correct	315 ms	19024 KB	Output is correct
66	Correct	777 ms	19152 KB	Output is correct
67	Correct	657 ms	19152 KB	Output is correct
68	Correct	830 ms	19220 KB	Output is correct

Subtask #8
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	18856 KB	Output is correct
2	Correct	9 ms	18812 KB	Output is correct
3	Correct	13 ms	18932 KB	Output is correct
4	Correct	13 ms	18932 KB	Output is correct
5	Correct	12 ms	18896 KB	Output is correct
6	Correct	12 ms	18932 KB	Output is correct
7	Correct	14 ms	18932 KB	Output is correct
8	Correct	14 ms	18824 KB	Output is correct
9	Correct	8 ms	18768 KB	Output is correct
10	Correct	8 ms	18884 KB	Output is correct
11	Correct	9 ms	18924 KB	Output is correct
12	Correct	8 ms	18896 KB	Output is correct
13	Correct	9 ms	18896 KB	Output is correct
14	Correct	10 ms	18916 KB	Output is correct
15	Correct	9 ms	18896 KB	Output is correct
16	Correct	9 ms	18896 KB	Output is correct
17	Correct	9 ms	18896 KB	Output is correct
18	Correct	10 ms	19036 KB	Output is correct
19	Correct	9 ms	19024 KB	Output is correct
20	Correct	9 ms	18920 KB	Output is correct
21	Correct	9 ms	18896 KB	Output is correct
22	Correct	8 ms	18952 KB	Output is correct
23	Correct	9 ms	18896 KB	Output is correct
24	Correct	8 ms	18896 KB	Output is correct
25	Correct	9 ms	18924 KB	Output is correct
26	Correct	10 ms	18980 KB	Output is correct
27	Correct	10 ms	18896 KB	Output is correct
28	Correct	9 ms	18976 KB	Output is correct
29	Correct	13 ms	18880 KB	Output is correct
30	Correct	14 ms	19056 KB	Output is correct
31	Correct	9 ms	18888 KB	Output is correct
32	Correct	9 ms	18928 KB	Output is correct
33	Correct	9 ms	18896 KB	Output is correct
34	Correct	9 ms	18856 KB	Output is correct
35	Correct	11 ms	18896 KB	Output is correct
36	Correct	9 ms	19024 KB	Output is correct
37	Correct	13 ms	19048 KB	Output is correct
38	Correct	13 ms	19052 KB	Output is correct
39	Correct	8 ms	18940 KB	Output is correct
40	Correct	9 ms	18836 KB	Output is correct
41	Correct	9 ms	18884 KB	Output is correct
42	Correct	9 ms	18912 KB	Output is correct
43	Correct	455 ms	21700 KB	Output is correct
44	Correct	897 ms	24448 KB	Output is correct
45	Correct	877 ms	24480 KB	Output is correct
46	Correct	836 ms	24540 KB	Output is correct
47	Correct	632 ms	21672 KB	Output is correct
48	Correct	845 ms	24520 KB	Output is correct
49	Correct	838 ms	24516 KB	Output is correct
50	Correct	798 ms	24440 KB	Output is correct
51	Correct	419 ms	19024 KB	Output is correct
52	Correct	718 ms	19208 KB	Output is correct
53	Correct	683 ms	19152 KB	Output is correct
54	Correct	458 ms	19172 KB	Output is correct
55	Correct	791 ms	27316 KB	Output is correct
56	Correct	819 ms	27484 KB	Output is correct
57	Correct	797 ms	27488 KB	Output is correct
58	Correct	673 ms	27392 KB	Output is correct
59	Correct	834 ms	33748 KB	Output is correct
60	Correct	809 ms	33740 KB	Output is correct
61	Correct	414 ms	19024 KB	Output is correct
62	Correct	834 ms	19152 KB	Output is correct
63	Correct	744 ms	19152 KB	Output is correct
64	Correct	520 ms	19352 KB	Output is correct
65	Correct	792 ms	19348 KB	Output is correct
66	Correct	699 ms	19268 KB	Output is correct
67	Correct	745 ms	19280 KB	Output is correct
68	Correct	799 ms	19280 KB	Output is correct
69	Correct	835 ms	19152 KB	Output is correct
70	Correct	903 ms	19156 KB	Output is correct
71	Correct	786 ms	19408 KB	Output is correct
72	Correct	714 ms	19280 KB	Output is correct
73	Correct	967 ms	19152 KB	Output is correct
74	Correct	772 ms	19172 KB	Output is correct
75	Correct	762 ms	19080 KB	Output is correct
76	Correct	668 ms	19548 KB	Output is correct
77	Correct	788 ms	19716 KB	Output is correct
78	Correct	837 ms	19728 KB	Output is correct
79	Correct	606 ms	19196 KB	Output is correct
80	Correct	706 ms	19116 KB	Output is correct
81	Correct	602 ms	19024 KB	Output is correct
82	Correct	740 ms	19024 KB	Output is correct
83	Correct	315 ms	19024 KB	Output is correct
84	Correct	777 ms	19152 KB	Output is correct
85	Correct	657 ms	19152 KB	Output is correct
86	Correct	830 ms	19220 KB	Output is correct
87	Correct	8 ms	18768 KB	Output is correct
88	Correct	501 ms	27024 KB	Output is correct
89	Correct	828 ms	24548 KB	Output is correct
90	Correct	855 ms	24540 KB	Output is correct
91	Correct	790 ms	28064 KB	Output is correct
92	Correct	885 ms	28060 KB	Output is correct
93	Correct	1006 ms	28164 KB	Output is correct
94	Correct	815 ms	28020 KB	Output is correct
95	Correct	924 ms	27976 KB	Output is correct
96	Execution timed out	3033 ms	22932 KB	Time limit exceeded
97	Halted	0 ms	0 KB	-

답안 #830986

Compilation message