oj.uz

Submission #1110130

# Submission time Handle Problem Language Result Execution time Memory
1110130 2024-11-08T19:38:34 Z ASN49K Digital Circuit (IOI22_circuit) C++17
0 / 100
 2020 ms 12112 KB 
#include "circuit.h"
#include <bits/stdc++.h>
using namespace std;

const int N=100'000,mod=1e9+2022;
int add(int x,int y)
{
    return (x+y)%mod;
}
void add_self(int& x,int y)
{
    x+=y;
    if(x>=mod)
    {
        x-=mod;
    }
    if(x<0)
    {
        x+=mod;
    }
}
int prod(int x,int y)
{
    return (1LL*x*y)%mod;
}
int n,m;
vector<int>g[2*N],a;
bool lazy[5*N];
int aint[5*N][2],dp[N],produs[N];


void push_down(int nod)
{
    if(lazy[nod])
    {
        swap(aint[2*nod+1][0] , aint[2*nod+1][1]);
        swap(aint[2*nod+2][0] , aint[2*nod+2][1]);
        lazy[2*nod+1]^=true;
        lazy[2*nod+2]^=true;
        lazy[nod]=false;
    }
}
void recalc(int nod)
{
    int l=2*nod+1,r=2*nod+2;
    aint[nod][0]=add(aint[l][0],aint[r][0]);
    aint[nod][1]=add(aint[l][1],aint[r][1]);
}
void build(int nod,int st,int dr)
{
    if(st==dr)
    {
        aint[nod][a[st]^1]=dp[nod];
        return;
    }
    int m=(st+dr)/2;
    build(2*nod+1,st,m);
    build(2*nod+2,m+1,dr);
    recalc(nod);
}
void update(int nod,int st,int dr,int l,int r)
{
    if(st>r || dr<l)
    {
        return;
    }
    if(l<=st && dr<=r)
    {
        lazy[nod]^=true;
        swap(aint[nod][0] , aint[nod][1]);
        return;
    }
    int m=(st+dr)/2;
    push_down(nod);
    update(2*nod+1,st,m,l,r);
    update(2*nod+2,m+1,dr,l,r);
    recalc(nod);
}

void dfs1(int nod)
{
    produs[nod]=max(1,(int)g[nod].size());
    for(auto &c:g[nod])
    {
        dfs1(c);
        produs[nod]=prod(produs[nod] , produs[c]);
    }
}
void dfs2(int nod)
{
    int sz=(int)g[nod].size();
    if(g[nod].empty())
    {
        return;
    }
    vector<int>suf(sz,1),pref(sz,1);
    for(int i=1;i<sz;i++)
    {
        suf[i]=prod(suf[i-1],produs[g[nod][i-1]]);
    }
    for(int i=sz-2;i>=0;i--)
    {
        pref[i]=prod(pref[i+1],produs[g[nod][i+1]]);
    }
    for(int i=0;i<sz;i++)
    {
        int c=g[nod][i];
        dp[c]=prod(dp[nod] , prod(suf[i] , pref[i]));
        dfs2(c);
    }
}

void init(int nn, int mm, std::vector<int> pp, std::vector<int> init_a)
{
    n=nn;
    m=mm;
    for(int i=1;i<n+m;i++)
    {
        g[pp[i]].push_back(i);
    }
    a=init_a;
    dp[0]=1;
    dfs1(0);
    dfs2(0);
    build(0,0,m-1);
}
int count_ways(int l, int r)
{
    l-=n;
    r-=n;
    update(0,0,m-1,l,r);
    return aint[0][0];
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8016 KB Output is correct
2 Correct 2 ms 8016 KB Output is correct
3 Incorrect 3 ms 8016 KB 1st lines differ - on the 1st token, expected: '509', found: '19'
4 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8016 KB Output is correct
2 Correct 3 ms 8016 KB Output is correct
3 Correct 3 ms 8016 KB Output is correct
4 Correct 2 ms 8016 KB Output is correct
5 Correct 3 ms 8124 KB Output is correct
6 Incorrect 4 ms 8016 KB 1st lines differ - on the 1st token, expected: '706880838', found: '180683364'
7 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8016 KB Output is correct
2 Correct 2 ms 8016 KB Output is correct
3 Incorrect 3 ms 8016 KB 1st lines differ - on the 1st token, expected: '509', found: '19'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1297 ms 10064 KB Output is correct
2 Incorrect 2020 ms 12112 KB 1st lines differ - on the 1st token, expected: '913758140', found: '244331352'
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1297 ms 10064 KB Output is correct
2 Incorrect 2020 ms 12112 KB 1st lines differ - on the 1st token, expected: '913758140', found: '244331352'
3 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8016 KB Output is correct
2 Correct 3 ms 8016 KB Output is correct
3 Correct 3 ms 8016 KB Output is correct
4 Correct 2 ms 8016 KB Output is correct
5 Correct 3 ms 8124 KB Output is correct
6 Incorrect 4 ms 8016 KB 1st lines differ - on the 1st token, expected: '706880838', found: '180683364'
7 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8016 KB Output is correct
2 Correct 2 ms 8016 KB Output is correct
3 Incorrect 3 ms 8016 KB 1st lines differ - on the 1st token, expected: '509', found: '19'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8016 KB Output is correct
2 Correct 2 ms 8016 KB Output is correct
3 Incorrect 3 ms 8016 KB 1st lines differ - on the 1st token, expected: '509', found: '19'
4 Halted 0 ms 0 KB -