oj.uz

Submission #830979

# Submission time Handle Problem Language Result Execution time Memory
830979 2023-08-19T14:24:17 Z beaconmc Digital Circuit (IOI22_circuit) C++17
46 / 100
 967 ms 41308 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[100001];
ll possible[100001];
ll contrib[100001];
ll dps[100001];
vector<int> p;
bool state[100001];



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,100001) 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);
  }
  FOR(i,N,N+M){
    state[i] = A[i-N];
  }
  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 7 ms 15696 KB Output is correct
2 Correct 6 ms 15696 KB Output is correct
3 Correct 10 ms 15696 KB Output is correct
4 Correct 10 ms 15696 KB Output is correct
5 Correct 10 ms 15816 KB Output is correct
6 Correct 11 ms 15696 KB Output is correct
7 Correct 11 ms 15812 KB Output is correct
8 Correct 11 ms 15804 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 453 ms 18640 KB Output is correct
2 Runtime error 41 ms 41308 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 453 ms 18640 KB Output is correct
2 Runtime error 41 ms 41308 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15696 KB Output is correct
2 Correct 6 ms 15696 KB Output is correct
3 Correct 6 ms 15696 KB Output is correct
4 Correct 6 ms 15696 KB Output is correct
5 Correct 7 ms 15696 KB Output is correct
6 Correct 7 ms 15824 KB Output is correct
7 Correct 7 ms 15824 KB Output is correct
8 Correct 7 ms 15824 KB Output is correct
9 Correct 7 ms 15824 KB Output is correct
10 Correct 7 ms 15824 KB Output is correct
11 Correct 7 ms 15824 KB Output is correct
12 Correct 7 ms 15824 KB Output is correct
13 Correct 453 ms 18640 KB Output is correct
14 Runtime error 41 ms 41308 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15696 KB Output is correct
2 Correct 6 ms 15696 KB Output is correct
3 Correct 10 ms 15696 KB Output is correct
4 Correct 10 ms 15696 KB Output is correct
5 Correct 10 ms 15816 KB Output is correct
6 Correct 11 ms 15696 KB Output is correct
7 Correct 11 ms 15812 KB Output is correct
8 Correct 11 ms 15804 KB Output is correct
9 Correct 6 ms 15696 KB Output is correct
10 Correct 6 ms 15696 KB Output is correct
11 Correct 6 ms 15696 KB Output is correct
12 Correct 6 ms 15696 KB Output is correct
13 Correct 7 ms 15696 KB Output is correct
14 Correct 7 ms 15824 KB Output is correct
15 Correct 7 ms 15824 KB Output is correct
16 Correct 7 ms 15824 KB Output is correct
17 Correct 7 ms 15824 KB Output is correct
18 Correct 7 ms 15824 KB Output is correct
19 Correct 7 ms 15824 KB Output is correct
20 Correct 7 ms 15824 KB Output is correct
21 Correct 7 ms 15824 KB Output is correct
22 Correct 7 ms 15696 KB Output is correct
23 Correct 6 ms 15696 KB Output is correct
24 Correct 7 ms 15824 KB Output is correct
25 Correct 7 ms 15824 KB Output is correct
26 Correct 7 ms 15824 KB Output is correct
27 Correct 7 ms 15824 KB Output is correct
28 Correct 8 ms 15840 KB Output is correct
29 Correct 11 ms 15808 KB Output is correct
30 Correct 11 ms 15696 KB Output is correct
31 Correct 6 ms 15824 KB Output is correct
32 Correct 7 ms 15824 KB Output is correct
33 Correct 7 ms 15824 KB Output is correct
34 Correct 7 ms 15696 KB Output is correct
35 Correct 8 ms 15696 KB Output is correct
36 Correct 7 ms 15824 KB Output is correct
37 Correct 11 ms 15824 KB Output is correct
38 Correct 11 ms 15876 KB Output is correct
39 Correct 6 ms 15696 KB Output is correct
40 Correct 7 ms 15696 KB Output is correct
41 Correct 7 ms 15824 KB Output is correct
42 Correct 8 ms 15696 KB Output is correct
43 Correct 597 ms 15952 KB Output is correct
44 Correct 670 ms 16044 KB Output is correct
45 Correct 603 ms 15952 KB Output is correct
46 Correct 655 ms 16208 KB Output is correct
47 Correct 659 ms 16208 KB Output is correct
48 Correct 676 ms 16208 KB Output is correct
49 Correct 671 ms 16168 KB Output is correct
50 Correct 602 ms 16208 KB Output is correct
51 Correct 690 ms 16024 KB Output is correct
52 Correct 795 ms 16032 KB Output is correct
53 Correct 614 ms 16216 KB Output is correct
54 Correct 645 ms 16080 KB Output is correct
55 Correct 644 ms 16080 KB Output is correct
56 Correct 665 ms 16080 KB Output is correct
57 Correct 745 ms 15952 KB Output is correct
58 Correct 687 ms 16464 KB Output is correct
59 Correct 967 ms 16592 KB Output is correct
60 Correct 763 ms 16600 KB Output is correct
61 Correct 837 ms 16080 KB Output is correct
62 Correct 771 ms 15952 KB Output is correct
63 Correct 742 ms 15932 KB Output is correct
64 Correct 829 ms 15952 KB Output is correct
65 Correct 280 ms 15824 KB Output is correct
66 Correct 772 ms 16080 KB Output is correct
67 Correct 678 ms 16080 KB Output is correct
68 Correct 740 ms 16080 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15696 KB Output is correct
2 Correct 6 ms 15696 KB Output is correct
3 Correct 10 ms 15696 KB Output is correct
4 Correct 10 ms 15696 KB Output is correct
5 Correct 10 ms 15816 KB Output is correct
6 Correct 11 ms 15696 KB Output is correct
7 Correct 11 ms 15812 KB Output is correct
8 Correct 11 ms 15804 KB Output is correct
9 Correct 6 ms 15696 KB Output is correct
10 Correct 6 ms 15696 KB Output is correct
11 Correct 6 ms 15696 KB Output is correct
12 Correct 6 ms 15696 KB Output is correct
13 Correct 7 ms 15696 KB Output is correct
14 Correct 7 ms 15824 KB Output is correct
15 Correct 7 ms 15824 KB Output is correct
16 Correct 7 ms 15824 KB Output is correct
17 Correct 7 ms 15824 KB Output is correct
18 Correct 7 ms 15824 KB Output is correct
19 Correct 7 ms 15824 KB Output is correct
20 Correct 7 ms 15824 KB Output is correct
21 Correct 7 ms 15824 KB Output is correct
22 Correct 7 ms 15696 KB Output is correct
23 Correct 6 ms 15696 KB Output is correct
24 Correct 7 ms 15824 KB Output is correct
25 Correct 7 ms 15824 KB Output is correct
26 Correct 7 ms 15824 KB Output is correct
27 Correct 7 ms 15824 KB Output is correct
28 Correct 8 ms 15840 KB Output is correct
29 Correct 11 ms 15808 KB Output is correct
30 Correct 11 ms 15696 KB Output is correct
31 Correct 6 ms 15824 KB Output is correct
32 Correct 7 ms 15824 KB Output is correct
33 Correct 7 ms 15824 KB Output is correct
34 Correct 7 ms 15696 KB Output is correct
35 Correct 8 ms 15696 KB Output is correct
36 Correct 7 ms 15824 KB Output is correct
37 Correct 11 ms 15824 KB Output is correct
38 Correct 11 ms 15876 KB Output is correct
39 Correct 6 ms 15696 KB Output is correct
40 Correct 7 ms 15696 KB Output is correct
41 Correct 7 ms 15824 KB Output is correct
42 Correct 8 ms 15696 KB Output is correct
43 Correct 453 ms 18640 KB Output is correct
44 Runtime error 41 ms 41308 KB Execution killed with signal 11
45 Halted 0 ms 0 KB -