oj.uz

답안 #777627

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
777627 2023-07-09T11:32:12 Z alexander707070 디지털 회로 (IOI22_circuit) C++17
2 / 100
 526 ms 22260 KB 
#include<bits/stdc++.h>
#define MAXN 800007
using namespace std;

const long long mod=1000002022;

int n,m,maxdep,pw;
long long st[MAXN],total,diff,zeros,ans,a[MAXN];
long long pref[MAXN],pr,sz[MAXN];
vector<int> v[MAXN];

long long power(long long x,int y){
    if(y==0)return 1;
    if(y==1)return x;
    if(y==2)return (x*x)%mod;
    if(y%2==0)return power(power(x,y/2),2);
    return (power(power(x,y/2),2)*x)%mod;
}

void calc(int x){
    if(v[x].size()==0){
        sz[x]=1; return;
    }

    sz[x]=int(v[x].size());
    for(int i=0;i<v[x].size();i++){
        calc(v[x][i]);
        sz[x]*=sz[v[x][i]]; sz[x]%=mod;
    }
}

void dfs(int x,long long curr){
    if(v[x].size()==0){
        st[x]=curr;
        return;
    }

    long long t;
    for(int i=0;i<v[x].size();i++){
        t=1;
        for(int f=0;f<v[x].size();f++){
            if(i==f)continue;
            t*=sz[v[x][f]]; t%=mod;
        }
        dfs(v[x][i],curr*t);
    }
}

int tree[MAXN],lazy[MAXN];

int sum(int l,int r){
    if(l==0)return pref[r];
    return (pref[r]-pref[l-1]+mod)%mod;
}

void psh(int v,int l,int r){
    if(lazy[v]==0)return;
    int tt=(l+r)/2;

    tree[2*v]=(sum(l,tt)-tree[2*v]+mod)%mod;
    lazy[2*v]^=1; 
    
    tree[2*v+1]=(sum(tt+1,r)-tree[2*v+1]+mod)%mod;
    lazy[2*v+1]^=1;

    lazy[v]=0;
}

void update(int v,int l,int r,int ll,int rr){
    if(ll>rr)return;
    if(l==ll and r==rr){
        tree[v]=(sum(l,r)-tree[v]+mod)%mod;
        lazy[v]^=1;
    }else{
        int tt=(l+r)/2;
        psh(v,l,r);

        update(2*v,l,tt,ll,min(tt,rr));
        update(2*v+1,tt+1,r,max(tt+1,ll),rr);

        tree[v]=(tree[2*v]+tree[2*v+1])%mod;
    }
}

void init(int N, int M,vector<int> P,vector<int> A){
    n=N; m=M;

    for(int i=1;i<N+M;i++){
        v[P[i]].push_back(i);
    }    

    calc(0);
    dfs(0,1);

    for(int i=0;i<m;i++){
        pref[i]=st[i+N];
        if(i>0)pref[i]+=pref[i-1];
        pref[i]%=mod;
    }

    for(int i=0;i<m;i++){
        if(A[i]==1)update(1,0,m-1,i,i);
    }
}

int count_ways(int L, int R){
    L-=n; R-=n;
    update(1,0,m-1,L,R);

    return tree[1];
}

/*
int main(){
    init(7, 8, {-1, 0, 0,1,1,2,2,3,3,4,4,5,5,6,6}, {0,0,0,0,0,0,0,0});
    cout<<count_ways(7,14)<<"\n";
}
*/

Compilation message

circuit.cpp: In function 'void calc(int)':
circuit.cpp:26:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~
circuit.cpp: In function 'void dfs(int, long long int)':
circuit.cpp:39:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~
circuit.cpp:41:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         for(int f=0;f<v[x].size();f++){
      |                     ~^~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19024 KB Output is correct
2 Correct 12 ms 19024 KB Output is correct
3 Correct 18 ms 19152 KB Output is correct
4 Correct 16 ms 19188 KB Output is correct
5 Correct 14 ms 19140 KB Output is correct
6 Correct 13 ms 19152 KB Output is correct
7 Correct 15 ms 19144 KB Output is correct
8 Correct 14 ms 19144 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19024 KB Output is correct
2 Incorrect 10 ms 19152 KB 1st lines differ - on the 1st token, expected: '52130940', found: '115232452'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19024 KB Output is correct
2 Correct 12 ms 19024 KB Output is correct
3 Correct 18 ms 19152 KB Output is correct
4 Correct 16 ms 19188 KB Output is correct
5 Correct 14 ms 19140 KB Output is correct
6 Correct 13 ms 19152 KB Output is correct
7 Correct 15 ms 19144 KB Output is correct
8 Correct 14 ms 19144 KB Output is correct
9 Correct 10 ms 19024 KB Output is correct
10 Incorrect 10 ms 19152 KB 1st lines differ - on the 1st token, expected: '52130940', found: '115232452'
11 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 526 ms 22260 KB 1st lines differ - on the 1st token, expected: '431985922', found: '617702778'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 526 ms 22260 KB 1st lines differ - on the 1st token, expected: '431985922', found: '617702778'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19024 KB Output is correct
2 Incorrect 10 ms 19152 KB 1st lines differ - on the 1st token, expected: '52130940', found: '115232452'
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19024 KB Output is correct
2 Correct 12 ms 19024 KB Output is correct
3 Correct 18 ms 19152 KB Output is correct
4 Correct 16 ms 19188 KB Output is correct
5 Correct 14 ms 19140 KB Output is correct
6 Correct 13 ms 19152 KB Output is correct
7 Correct 15 ms 19144 KB Output is correct
8 Correct 14 ms 19144 KB Output is correct
9 Correct 10 ms 19024 KB Output is correct
10 Incorrect 10 ms 19152 KB 1st lines differ - on the 1st token, expected: '52130940', found: '115232452'
11 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 19024 KB Output is correct
2 Correct 12 ms 19024 KB Output is correct
3 Correct 18 ms 19152 KB Output is correct
4 Correct 16 ms 19188 KB Output is correct
5 Correct 14 ms 19140 KB Output is correct
6 Correct 13 ms 19152 KB Output is correct
7 Correct 15 ms 19144 KB Output is correct
8 Correct 14 ms 19144 KB Output is correct
9 Correct 10 ms 19024 KB Output is correct
10 Incorrect 10 ms 19152 KB 1st lines differ - on the 1st token, expected: '52130940', found: '115232452'
11 Halted 0 ms 0 KB -