oj.uz

Submission #1024498

# Submission time Handle Problem Language Result Execution time Memory
1024498 2024-07-16T06:08:40 Z vjudge1 Digital Circuit (IOI22_circuit) C++17
34 / 100
 3000 ms 17752 KB 
#include "circuit.h"
#include <bits/stdc++.h>

#define ll long long
#define sz(s) (int)s.size()
#define pb push_back

using namespace std;

const int MAX=2e5+10;
const int mod=1000002022;

int n,m;
vector<int> a;
vector<int> g[MAX];
int dp[MAX],s[MAX];

void dfs(int v){
    if(g[v].empty()){
        dp[v]=a[v-n];
        s[v]=1;
        return;
    }
    s[v]=sz(g[v]);
    for(auto to:g[v]){
        dfs(to);
        s[v]=s[v]*1ll*s[to]%mod;
    }
    vector<int> d(n+m,0);
    d[0]=1;
    for(int i=0;i<sz(g[v]);i++){
        int to=g[v][i];
        for(int j=i+1;j>=0;j--){
            int p=d[j];
            d[j]=d[j]*1ll*(s[to]-dp[to]+mod)%mod;
            if(j-1>=0)d[j]+=d[j-1]*1ll*dp[to]%mod;
            d[j]%=mod;
        }
    }
    for(int i=1;i<=sz(g[v]);i++){
        dp[v]+=i*1ll*d[i]%mod;
        dp[v]%=mod;
    }
}

struct segtree{
    int t[4*MAX];
    int s[4*MAX];
    int add[4*MAX];

    void build(int v,int tl,int tr,vector<int> &a){
        add[v]=0;
        if(tl==tr){
            s[v]=1;
            t[v]=a[tl];
            return;
        }
        int tm=(tl+tr)/2;
        build(2*v,tl,tm,a);
        build(2*v+1,tm+1,tr,a);
        t[v]=0;
        for(int i=1;i<4;i++){
            int prod=1;
            if(i&1){
                prod=prod*1ll*t[2*v]%mod;
            }
            else{
                prod=prod*1ll*(s[2*v]-t[2*v]+mod)%mod;
            }
            if(i&2){
                prod=prod*1ll*t[2*v+1]%mod;
            }
            else{
                prod=prod*1ll*(s[2*v+1]-t[2*v+1]+mod)%mod;
            }
            t[v]=t[v]+__builtin_popcount(i)*1ll*prod%mod;
            t[v]%=mod;
        }
        // cout<<v<<" "<<tl<<" "<<tr<<" "<<t[v]<<"\n";
        s[v]=2ll*s[2*v]*s[2*v+1]%mod;
    }

    void make(int v){
        add[v]^=1;
        t[v]=(s[v]-t[v]+mod)%mod;
    }

    void push(int v){
        if(add[v]){
            make(2*v);
            make(2*v+1);
        }
        add[v]=0;
    }

    void update(int v,int tl,int tr,int l,int r){
        if(l>r||tl>r||l>tr)return;
        if(l<=tl&&tr<=r){
            make(v);
            // cout<<l<<" "<<r<<" "<<tl<<" "<<tr<<" "<<t[v] <<"\n";
            return;
        }
        int tm=(tl+tr)/2;
        push(v);
        update(2*v,tl,tm,l,r);
        update(2*v+1,tm+1,tr,l,r);
        t[v]=0;
        for(int i=1;i<4;i++){
            int prod=1;
            if(i&1){
                prod=prod*1ll*t[2*v]%mod;
            }
            else{
                prod=prod*1ll*(s[2*v]-t[2*v]+mod)%mod;
            }
            if(i&2){
                prod=prod*1ll*t[2*v+1]%mod;
            }
            else{
                prod=prod*1ll*(s[2*v+1]-t[2*v+1]+mod)%mod;
            }
            t[v]=t[v]+__builtin_popcount(i)*1ll*prod%mod;
            t[v]%=mod;
        }
    }
}T;

bool st=0;

void init(int N, int M,vector<int> P,vector<int> A) {
    n=N;
    m=M;
    a=A;
    for(int i=1;i<N+M;i++){
        g[P[i]].pb(i);
    }
    
    {
        int x=1;
        while(x<M)x*=2;
        if(x==M&&N==M-1)st=1;
    }

    if(st)T.build(1,0,M-1,a);

}

int count_ways(int L, int R) {
    // cout<<st<<"\n";
    if(st){
        T.update(1,0,m-1,L-n,R-n);
        return T.t[1];
    }
    for(int i=0;i<n+m;i++)dp[i]=0;
    for(int i=L;i<=R;i++)a[i-n]^=1;
    dfs(0);
    return dp[0];
}

Compilation message

circuit.cpp: In function 'void dfs(int)':
circuit.cpp:34:17: warning: unused variable 'p' [-Wunused-variable]
   34 |             int p=d[j];
      |                 ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9560 KB Output is correct
2 Correct 1 ms 7512 KB Output is correct
3 Correct 11 ms 7512 KB Output is correct
4 Correct 12 ms 7512 KB Output is correct
5 Correct 12 ms 7512 KB Output is correct
6 Correct 12 ms 7532 KB Output is correct
7 Correct 12 ms 7512 KB Output is correct
8 Correct 12 ms 7512 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 503 ms 15960 KB Output is correct
2 Correct 780 ms 17752 KB Output is correct
3 Correct 785 ms 17744 KB Output is correct
4 Correct 773 ms 17716 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 503 ms 15960 KB Output is correct
2 Correct 780 ms 17752 KB Output is correct
3 Correct 785 ms 17744 KB Output is correct
4 Correct 773 ms 17716 KB Output is correct
5 Correct 600 ms 15960 KB Output is correct
6 Correct 745 ms 17752 KB Output is correct
7 Correct 892 ms 17696 KB Output is correct
8 Correct 725 ms 17720 KB Output is correct
9 Correct 360 ms 9816 KB Output is correct
10 Correct 778 ms 9816 KB Output is correct
11 Correct 704 ms 9816 KB Output is correct
12 Correct 688 ms 9816 KB Output is correct

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9560 KB Output is correct
2 Correct 2 ms 9560 KB Output is correct
3 Correct 2 ms 9736 KB Output is correct
4 Correct 2 ms 9560 KB Output is correct
5 Correct 2 ms 9560 KB Output is correct
6 Correct 2 ms 7512 KB Output is correct
7 Correct 3 ms 7768 KB Output is correct
8 Correct 5 ms 7768 KB Output is correct
9 Correct 2 ms 7768 KB Output is correct
10 Correct 3 ms 7892 KB Output is correct
11 Correct 3 ms 7768 KB Output is correct
12 Correct 3 ms 7768 KB Output is correct
13 Correct 503 ms 15960 KB Output is correct
14 Correct 780 ms 17752 KB Output is correct
15 Correct 785 ms 17744 KB Output is correct
16 Correct 773 ms 17716 KB Output is correct
17 Correct 600 ms 15960 KB Output is correct
18 Correct 745 ms 17752 KB Output is correct
19 Correct 892 ms 17696 KB Output is correct
20 Correct 725 ms 17720 KB Output is correct
21 Correct 360 ms 9816 KB Output is correct
22 Correct 778 ms 9816 KB Output is correct
23 Correct 704 ms 9816 KB Output is correct
24 Correct 688 ms 9816 KB Output is correct
25 Execution timed out 3039 ms 13096 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9560 KB Output is correct
2 Correct 1 ms 7512 KB Output is correct
3 Correct 11 ms 7512 KB Output is correct
4 Correct 12 ms 7512 KB Output is correct
5 Correct 12 ms 7512 KB Output is correct
6 Correct 12 ms 7532 KB Output is correct
7 Correct 12 ms 7512 KB Output is correct
8 Correct 12 ms 7512 KB Output is correct
9 Correct 2 ms 9560 KB Output is correct
10 Correct 2 ms 9560 KB Output is correct
11 Correct 2 ms 9736 KB Output is correct
12 Correct 2 ms 9560 KB Output is correct
13 Correct 2 ms 9560 KB Output is correct
14 Correct 2 ms 7512 KB Output is correct
15 Correct 3 ms 7768 KB Output is correct
16 Correct 5 ms 7768 KB Output is correct
17 Correct 2 ms 7768 KB Output is correct
18 Correct 3 ms 7892 KB Output is correct
19 Correct 3 ms 7768 KB Output is correct
20 Correct 3 ms 7768 KB Output is correct
21 Correct 3 ms 7768 KB Output is correct
22 Correct 3 ms 7512 KB Output is correct
23 Correct 2 ms 7512 KB Output is correct
24 Correct 3 ms 7768 KB Output is correct
25 Correct 3 ms 7768 KB Output is correct
26 Correct 3 ms 7768 KB Output is correct
27 Correct 3 ms 7768 KB Output is correct
28 Correct 3 ms 7768 KB Output is correct
29 Correct 12 ms 7512 KB Output is correct
30 Correct 12 ms 7512 KB Output is correct
31 Correct 2 ms 7768 KB Output is correct
32 Correct 4 ms 7768 KB Output is correct
33 Correct 2 ms 7512 KB Output is correct
34 Correct 2 ms 7512 KB Output is correct
35 Correct 4 ms 7512 KB Output is correct
36 Correct 3 ms 7768 KB Output is correct
37 Correct 13 ms 7900 KB Output is correct
38 Correct 13 ms 7768 KB Output is correct
39 Correct 2 ms 7768 KB Output is correct
40 Correct 3 ms 7512 KB Output is correct
41 Correct 3 ms 7512 KB Output is correct
42 Correct 2 ms 7512 KB Output is correct
43 Execution timed out 3023 ms 7768 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9560 KB Output is correct
2 Correct 1 ms 7512 KB Output is correct
3 Correct 11 ms 7512 KB Output is correct
4 Correct 12 ms 7512 KB Output is correct
5 Correct 12 ms 7512 KB Output is correct
6 Correct 12 ms 7532 KB Output is correct
7 Correct 12 ms 7512 KB Output is correct
8 Correct 12 ms 7512 KB Output is correct
9 Correct 2 ms 9560 KB Output is correct
10 Correct 2 ms 9560 KB Output is correct
11 Correct 2 ms 9736 KB Output is correct
12 Correct 2 ms 9560 KB Output is correct
13 Correct 2 ms 9560 KB Output is correct
14 Correct 2 ms 7512 KB Output is correct
15 Correct 3 ms 7768 KB Output is correct
16 Correct 5 ms 7768 KB Output is correct
17 Correct 2 ms 7768 KB Output is correct
18 Correct 3 ms 7892 KB Output is correct
19 Correct 3 ms 7768 KB Output is correct
20 Correct 3 ms 7768 KB Output is correct
21 Correct 3 ms 7768 KB Output is correct
22 Correct 3 ms 7512 KB Output is correct
23 Correct 2 ms 7512 KB Output is correct
24 Correct 3 ms 7768 KB Output is correct
25 Correct 3 ms 7768 KB Output is correct
26 Correct 3 ms 7768 KB Output is correct
27 Correct 3 ms 7768 KB Output is correct
28 Correct 3 ms 7768 KB Output is correct
29 Correct 12 ms 7512 KB Output is correct
30 Correct 12 ms 7512 KB Output is correct
31 Correct 2 ms 7768 KB Output is correct
32 Correct 4 ms 7768 KB Output is correct
33 Correct 2 ms 7512 KB Output is correct
34 Correct 2 ms 7512 KB Output is correct
35 Correct 4 ms 7512 KB Output is correct
36 Correct 3 ms 7768 KB Output is correct
37 Correct 13 ms 7900 KB Output is correct
38 Correct 13 ms 7768 KB Output is correct
39 Correct 2 ms 7768 KB Output is correct
40 Correct 3 ms 7512 KB Output is correct
41 Correct 3 ms 7512 KB Output is correct
42 Correct 2 ms 7512 KB Output is correct
43 Correct 503 ms 15960 KB Output is correct
44 Correct 780 ms 17752 KB Output is correct
45 Correct 785 ms 17744 KB Output is correct
46 Correct 773 ms 17716 KB Output is correct
47 Correct 600 ms 15960 KB Output is correct
48 Correct 745 ms 17752 KB Output is correct
49 Correct 892 ms 17696 KB Output is correct
50 Correct 725 ms 17720 KB Output is correct
51 Correct 360 ms 9816 KB Output is correct
52 Correct 778 ms 9816 KB Output is correct
53 Correct 704 ms 9816 KB Output is correct
54 Correct 688 ms 9816 KB Output is correct
55 Execution timed out 3039 ms 13096 KB Time limit exceeded
56 Halted 0 ms 0 KB -