oj.uz

Submission #938473

# Submission time Handle Problem Language Result Execution time Memory
938473 2024-03-05T07:42:00 Z Trisanu_Das Digital Circuit (IOI22_circuit) C++17
89 / 100
 3000 ms 34640 KB 
#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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 22104 KB Output is correct
2 Correct 4 ms 22104 KB Output is correct
3 Correct 8 ms 22104 KB Output is correct
4 Correct 9 ms 22104 KB Output is correct
5 Correct 9 ms 22104 KB Output is correct
6 Correct 9 ms 22104 KB Output is correct
7 Correct 9 ms 22104 KB Output is correct
8 Correct 8 ms 22104 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 22104 KB Output is correct
2 Correct 4 ms 22104 KB Output is correct
3 Correct 4 ms 22104 KB Output is correct
4 Correct 4 ms 22104 KB Output is correct
5 Correct 4 ms 22104 KB Output is correct
6 Correct 4 ms 22104 KB Output is correct
7 Correct 5 ms 22104 KB Output is correct
8 Correct 5 ms 22104 KB Output is correct
9 Correct 5 ms 22104 KB Output is correct
10 Correct 4 ms 22104 KB Output is correct
11 Correct 6 ms 22104 KB Output is correct
12 Correct 4 ms 22104 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 22104 KB Output is correct
2 Correct 4 ms 22104 KB Output is correct
3 Correct 8 ms 22104 KB Output is correct
4 Correct 9 ms 22104 KB Output is correct
5 Correct 9 ms 22104 KB Output is correct
6 Correct 9 ms 22104 KB Output is correct
7 Correct 9 ms 22104 KB Output is correct
8 Correct 8 ms 22104 KB Output is correct
9 Correct 4 ms 22104 KB Output is correct
10 Correct 4 ms 22104 KB Output is correct
11 Correct 4 ms 22104 KB Output is correct
12 Correct 4 ms 22104 KB Output is correct
13 Correct 4 ms 22104 KB Output is correct
14 Correct 4 ms 22104 KB Output is correct
15 Correct 5 ms 22104 KB Output is correct
16 Correct 5 ms 22104 KB Output is correct
17 Correct 5 ms 22104 KB Output is correct
18 Correct 4 ms 22104 KB Output is correct
19 Correct 6 ms 22104 KB Output is correct
20 Correct 4 ms 22104 KB Output is correct
21 Correct 5 ms 22356 KB Output is correct
22 Correct 4 ms 22104 KB Output is correct
23 Correct 4 ms 22104 KB Output is correct
24 Correct 5 ms 22104 KB Output is correct
25 Correct 5 ms 22104 KB Output is correct
26 Correct 5 ms 22104 KB Output is correct
27 Correct 5 ms 22104 KB Output is correct
28 Correct 5 ms 22192 KB Output is correct
29 Correct 9 ms 22104 KB Output is correct
30 Correct 8 ms 22104 KB Output is correct
31 Correct 4 ms 22104 KB Output is correct
32 Correct 5 ms 22104 KB Output is correct
33 Correct 4 ms 22104 KB Output is correct
34 Correct 4 ms 21976 KB Output is correct
35 Correct 5 ms 22104 KB Output is correct
36 Correct 5 ms 22104 KB Output is correct
37 Correct 9 ms 22104 KB Output is correct
38 Correct 9 ms 22104 KB Output is correct
39 Correct 5 ms 22104 KB Output is correct
40 Correct 5 ms 22104 KB Output is correct
41 Correct 4 ms 22104 KB Output is correct
42 Correct 5 ms 22104 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 388 ms 24152 KB Output is correct
2 Correct 554 ms 26032 KB Output is correct
3 Correct 546 ms 26052 KB Output is correct
4 Correct 585 ms 26032 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 388 ms 24152 KB Output is correct
2 Correct 554 ms 26032 KB Output is correct
3 Correct 546 ms 26052 KB Output is correct
4 Correct 585 ms 26032 KB Output is correct
5 Correct 460 ms 24136 KB Output is correct
6 Correct 598 ms 26264 KB Output is correct
7 Correct 570 ms 26252 KB Output is correct
8 Correct 572 ms 26048 KB Output is correct
9 Correct 262 ms 22104 KB Output is correct
10 Correct 544 ms 22360 KB Output is correct
11 Correct 565 ms 22360 KB Output is correct
12 Correct 565 ms 22360 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 22104 KB Output is correct
2 Correct 4 ms 22104 KB Output is correct
3 Correct 4 ms 22104 KB Output is correct
4 Correct 4 ms 22104 KB Output is correct
5 Correct 4 ms 22104 KB Output is correct
6 Correct 4 ms 22104 KB Output is correct
7 Correct 5 ms 22104 KB Output is correct
8 Correct 5 ms 22104 KB Output is correct
9 Correct 5 ms 22104 KB Output is correct
10 Correct 4 ms 22104 KB Output is correct
11 Correct 6 ms 22104 KB Output is correct
12 Correct 4 ms 22104 KB Output is correct
13 Correct 388 ms 24152 KB Output is correct
14 Correct 554 ms 26032 KB Output is correct
15 Correct 546 ms 26052 KB Output is correct
16 Correct 585 ms 26032 KB Output is correct
17 Correct 460 ms 24136 KB Output is correct
18 Correct 598 ms 26264 KB Output is correct
19 Correct 570 ms 26252 KB Output is correct
20 Correct 572 ms 26048 KB Output is correct
21 Correct 262 ms 22104 KB Output is correct
22 Correct 544 ms 22360 KB Output is correct
23 Correct 565 ms 22360 KB Output is correct
24 Correct 565 ms 22360 KB Output is correct
25 Correct 665 ms 28276 KB Output is correct
26 Correct 639 ms 28152 KB Output is correct
27 Correct 661 ms 28156 KB Output is correct
28 Correct 557 ms 28244 KB Output is correct
29 Correct 634 ms 34628 KB Output is correct
30 Correct 645 ms 34640 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 22104 KB Output is correct
2 Correct 4 ms 22104 KB Output is correct
3 Correct 8 ms 22104 KB Output is correct
4 Correct 9 ms 22104 KB Output is correct
5 Correct 9 ms 22104 KB Output is correct
6 Correct 9 ms 22104 KB Output is correct
7 Correct 9 ms 22104 KB Output is correct
8 Correct 8 ms 22104 KB Output is correct
9 Correct 4 ms 22104 KB Output is correct
10 Correct 4 ms 22104 KB Output is correct
11 Correct 4 ms 22104 KB Output is correct
12 Correct 4 ms 22104 KB Output is correct
13 Correct 4 ms 22104 KB Output is correct
14 Correct 4 ms 22104 KB Output is correct
15 Correct 5 ms 22104 KB Output is correct
16 Correct 5 ms 22104 KB Output is correct
17 Correct 5 ms 22104 KB Output is correct
18 Correct 4 ms 22104 KB Output is correct
19 Correct 6 ms 22104 KB Output is correct
20 Correct 4 ms 22104 KB Output is correct
21 Correct 5 ms 22356 KB Output is correct
22 Correct 4 ms 22104 KB Output is correct
23 Correct 4 ms 22104 KB Output is correct
24 Correct 5 ms 22104 KB Output is correct
25 Correct 5 ms 22104 KB Output is correct
26 Correct 5 ms 22104 KB Output is correct
27 Correct 5 ms 22104 KB Output is correct
28 Correct 5 ms 22192 KB Output is correct
29 Correct 9 ms 22104 KB Output is correct
30 Correct 8 ms 22104 KB Output is correct
31 Correct 4 ms 22104 KB Output is correct
32 Correct 5 ms 22104 KB Output is correct
33 Correct 4 ms 22104 KB Output is correct
34 Correct 4 ms 21976 KB Output is correct
35 Correct 5 ms 22104 KB Output is correct
36 Correct 5 ms 22104 KB Output is correct
37 Correct 9 ms 22104 KB Output is correct
38 Correct 9 ms 22104 KB Output is correct
39 Correct 5 ms 22104 KB Output is correct
40 Correct 5 ms 22104 KB Output is correct
41 Correct 4 ms 22104 KB Output is correct
42 Correct 5 ms 22104 KB Output is correct
43 Correct 370 ms 22104 KB Output is correct
44 Correct 535 ms 22104 KB Output is correct
45 Correct 552 ms 22104 KB Output is correct
46 Correct 522 ms 22360 KB Output is correct
47 Correct 566 ms 22360 KB Output is correct
48 Correct 523 ms 22360 KB Output is correct
49 Correct 554 ms 22360 KB Output is correct
50 Correct 571 ms 22360 KB Output is correct
51 Correct 617 ms 22328 KB Output is correct
52 Correct 649 ms 22316 KB Output is correct
53 Correct 511 ms 22616 KB Output is correct
54 Correct 546 ms 22360 KB Output is correct
55 Correct 577 ms 22360 KB Output is correct
56 Correct 540 ms 22104 KB Output is correct
57 Correct 594 ms 22104 KB Output is correct
58 Correct 569 ms 22616 KB Output is correct
59 Correct 623 ms 22844 KB Output is correct
60 Correct 659 ms 22844 KB Output is correct
61 Correct 554 ms 22360 KB Output is correct
62 Correct 530 ms 22104 KB Output is correct
63 Correct 559 ms 22104 KB Output is correct
64 Correct 652 ms 22104 KB Output is correct
65 Correct 265 ms 22104 KB Output is correct
66 Correct 551 ms 22360 KB Output is correct
67 Correct 581 ms 22616 KB Output is correct
68 Correct 605 ms 22360 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 22104 KB Output is correct
2 Correct 4 ms 22104 KB Output is correct
3 Correct 8 ms 22104 KB Output is correct
4 Correct 9 ms 22104 KB Output is correct
5 Correct 9 ms 22104 KB Output is correct
6 Correct 9 ms 22104 KB Output is correct
7 Correct 9 ms 22104 KB Output is correct
8 Correct 8 ms 22104 KB Output is correct
9 Correct 4 ms 22104 KB Output is correct
10 Correct 4 ms 22104 KB Output is correct
11 Correct 4 ms 22104 KB Output is correct
12 Correct 4 ms 22104 KB Output is correct
13 Correct 4 ms 22104 KB Output is correct
14 Correct 4 ms 22104 KB Output is correct
15 Correct 5 ms 22104 KB Output is correct
16 Correct 5 ms 22104 KB Output is correct
17 Correct 5 ms 22104 KB Output is correct
18 Correct 4 ms 22104 KB Output is correct
19 Correct 6 ms 22104 KB Output is correct
20 Correct 4 ms 22104 KB Output is correct
21 Correct 5 ms 22356 KB Output is correct
22 Correct 4 ms 22104 KB Output is correct
23 Correct 4 ms 22104 KB Output is correct
24 Correct 5 ms 22104 KB Output is correct
25 Correct 5 ms 22104 KB Output is correct
26 Correct 5 ms 22104 KB Output is correct
27 Correct 5 ms 22104 KB Output is correct
28 Correct 5 ms 22192 KB Output is correct
29 Correct 9 ms 22104 KB Output is correct
30 Correct 8 ms 22104 KB Output is correct
31 Correct 4 ms 22104 KB Output is correct
32 Correct 5 ms 22104 KB Output is correct
33 Correct 4 ms 22104 KB Output is correct
34 Correct 4 ms 21976 KB Output is correct
35 Correct 5 ms 22104 KB Output is correct
36 Correct 5 ms 22104 KB Output is correct
37 Correct 9 ms 22104 KB Output is correct
38 Correct 9 ms 22104 KB Output is correct
39 Correct 5 ms 22104 KB Output is correct
40 Correct 5 ms 22104 KB Output is correct
41 Correct 4 ms 22104 KB Output is correct
42 Correct 5 ms 22104 KB Output is correct
43 Correct 388 ms 24152 KB Output is correct
44 Correct 554 ms 26032 KB Output is correct
45 Correct 546 ms 26052 KB Output is correct
46 Correct 585 ms 26032 KB Output is correct
47 Correct 460 ms 24136 KB Output is correct
48 Correct 598 ms 26264 KB Output is correct
49 Correct 570 ms 26252 KB Output is correct
50 Correct 572 ms 26048 KB Output is correct
51 Correct 262 ms 22104 KB Output is correct
52 Correct 544 ms 22360 KB Output is correct
53 Correct 565 ms 22360 KB Output is correct
54 Correct 565 ms 22360 KB Output is correct
55 Correct 665 ms 28276 KB Output is correct
56 Correct 639 ms 28152 KB Output is correct
57 Correct 661 ms 28156 KB Output is correct
58 Correct 557 ms 28244 KB Output is correct
59 Correct 634 ms 34628 KB Output is correct
60 Correct 645 ms 34640 KB Output is correct
61 Correct 370 ms 22104 KB Output is correct
62 Correct 535 ms 22104 KB Output is correct
63 Correct 552 ms 22104 KB Output is correct
64 Correct 522 ms 22360 KB Output is correct
65 Correct 566 ms 22360 KB Output is correct
66 Correct 523 ms 22360 KB Output is correct
67 Correct 554 ms 22360 KB Output is correct
68 Correct 571 ms 22360 KB Output is correct
69 Correct 617 ms 22328 KB Output is correct
70 Correct 649 ms 22316 KB Output is correct
71 Correct 511 ms 22616 KB Output is correct
72 Correct 546 ms 22360 KB Output is correct
73 Correct 577 ms 22360 KB Output is correct
74 Correct 540 ms 22104 KB Output is correct
75 Correct 594 ms 22104 KB Output is correct
76 Correct 569 ms 22616 KB Output is correct
77 Correct 623 ms 22844 KB Output is correct
78 Correct 659 ms 22844 KB Output is correct
79 Correct 554 ms 22360 KB Output is correct
80 Correct 530 ms 22104 KB Output is correct
81 Correct 559 ms 22104 KB Output is correct
82 Correct 652 ms 22104 KB Output is correct
83 Correct 265 ms 22104 KB Output is correct
84 Correct 551 ms 22360 KB Output is correct
85 Correct 581 ms 22616 KB Output is correct
86 Correct 605 ms 22360 KB Output is correct
87 Correct 9 ms 22104 KB Output is correct
88 Correct 423 ms 28056 KB Output is correct
89 Correct 644 ms 26404 KB Output is correct
90 Correct 677 ms 26480 KB Output is correct
91 Correct 651 ms 29012 KB Output is correct
92 Correct 706 ms 29244 KB Output is correct
93 Correct 752 ms 28992 KB Output is correct
94 Correct 671 ms 28996 KB Output is correct
95 Correct 617 ms 29016 KB Output is correct
96 Execution timed out 3037 ms 24892 KB Time limit exceeded
97 Halted 0 ms 0 KB -