oj.uz

Submission #1110132

# Submission time Handle Problem Language Result Execution time Memory
1110132 2024-11-08T19:39:41 Z ASN49K Digital Circuit (IOI22_circuit) C++17
46 / 100
 2001 ms 12104 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[st+n];
        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
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 3 ms 8016 KB Output is correct
5 Correct 3 ms 8016 KB Output is correct
6 Correct 3 ms 8016 KB Output is correct
7 Correct 3 ms 8016 KB Output is correct
8 Correct 4 ms 8016 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 4 ms 8016 KB Output is correct
5 Correct 3 ms 8016 KB Output is correct
6 Correct 3 ms 8016 KB Output is correct
7 Correct 4 ms 8016 KB Output is correct
8 Correct 3 ms 8016 KB Output is correct
9 Correct 3 ms 8016 KB Output is correct
10 Correct 4 ms 8272 KB Output is correct
11 Correct 4 ms 8272 KB Output is correct
12 Correct 3 ms 8016 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 3 ms 8016 KB Output is correct
5 Correct 3 ms 8016 KB Output is correct
6 Correct 3 ms 8016 KB Output is correct
7 Correct 3 ms 8016 KB Output is correct
8 Correct 4 ms 8016 KB Output is correct
9 Correct 3 ms 8016 KB Output is correct
10 Correct 3 ms 8016 KB Output is correct
11 Correct 3 ms 8016 KB Output is correct
12 Correct 4 ms 8016 KB Output is correct
13 Correct 3 ms 8016 KB Output is correct
14 Correct 3 ms 8016 KB Output is correct
15 Correct 4 ms 8016 KB Output is correct
16 Correct 3 ms 8016 KB Output is correct
17 Correct 3 ms 8016 KB Output is correct
18 Correct 4 ms 8272 KB Output is correct
19 Correct 4 ms 8272 KB Output is correct
20 Correct 3 ms 8016 KB Output is correct
21 Correct 3 ms 8016 KB Output is correct
22 Correct 3 ms 8188 KB Output is correct
23 Correct 3 ms 8016 KB Output is correct
24 Correct 3 ms 8016 KB Output is correct
25 Correct 3 ms 8016 KB Output is correct
26 Correct 3 ms 8016 KB Output is correct
27 Correct 4 ms 8016 KB Output is correct
28 Correct 3 ms 8028 KB Output is correct
29 Correct 4 ms 8016 KB Output is correct
30 Correct 3 ms 8016 KB Output is correct
31 Correct 3 ms 8272 KB Output is correct
32 Correct 3 ms 8016 KB Output is correct
33 Correct 3 ms 8016 KB Output is correct
34 Correct 3 ms 8016 KB Output is correct
35 Correct 3 ms 8016 KB Output is correct
36 Correct 3 ms 8272 KB Output is correct
37 Correct 4 ms 8272 KB Output is correct
38 Correct 3 ms 8272 KB Output is correct
39 Correct 3 ms 8016 KB Output is correct
40 Correct 3 ms 8016 KB Output is correct
41 Correct 3 ms 8016 KB Output is correct
42 Correct 4 ms 8036 KB Output is correct

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1352 ms 10064 KB Output is correct
2 Incorrect 1985 ms 12104 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 1352 ms 10064 KB Output is correct
2 Incorrect 1985 ms 12104 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 3 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 4 ms 8016 KB Output is correct
5 Correct 3 ms 8016 KB Output is correct
6 Correct 3 ms 8016 KB Output is correct
7 Correct 4 ms 8016 KB Output is correct
8 Correct 3 ms 8016 KB Output is correct
9 Correct 3 ms 8016 KB Output is correct
10 Correct 4 ms 8272 KB Output is correct
11 Correct 4 ms 8272 KB Output is correct
12 Correct 3 ms 8016 KB Output is correct
13 Correct 1352 ms 10064 KB Output is correct
14 Incorrect 1985 ms 12104 KB 1st lines differ - on the 1st token, expected: '913758140', found: '244331352'
15 Halted 0 ms 0 KB -

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 3 ms 8016 KB Output is correct
5 Correct 3 ms 8016 KB Output is correct
6 Correct 3 ms 8016 KB Output is correct
7 Correct 3 ms 8016 KB Output is correct
8 Correct 4 ms 8016 KB Output is correct
9 Correct 3 ms 8016 KB Output is correct
10 Correct 3 ms 8016 KB Output is correct
11 Correct 3 ms 8016 KB Output is correct
12 Correct 4 ms 8016 KB Output is correct
13 Correct 3 ms 8016 KB Output is correct
14 Correct 3 ms 8016 KB Output is correct
15 Correct 4 ms 8016 KB Output is correct
16 Correct 3 ms 8016 KB Output is correct
17 Correct 3 ms 8016 KB Output is correct
18 Correct 4 ms 8272 KB Output is correct
19 Correct 4 ms 8272 KB Output is correct
20 Correct 3 ms 8016 KB Output is correct
21 Correct 3 ms 8016 KB Output is correct
22 Correct 3 ms 8188 KB Output is correct
23 Correct 3 ms 8016 KB Output is correct
24 Correct 3 ms 8016 KB Output is correct
25 Correct 3 ms 8016 KB Output is correct
26 Correct 3 ms 8016 KB Output is correct
27 Correct 4 ms 8016 KB Output is correct
28 Correct 3 ms 8028 KB Output is correct
29 Correct 4 ms 8016 KB Output is correct
30 Correct 3 ms 8016 KB Output is correct
31 Correct 3 ms 8272 KB Output is correct
32 Correct 3 ms 8016 KB Output is correct
33 Correct 3 ms 8016 KB Output is correct
34 Correct 3 ms 8016 KB Output is correct
35 Correct 3 ms 8016 KB Output is correct
36 Correct 3 ms 8272 KB Output is correct
37 Correct 4 ms 8272 KB Output is correct
38 Correct 3 ms 8272 KB Output is correct
39 Correct 3 ms 8016 KB Output is correct
40 Correct 3 ms 8016 KB Output is correct
41 Correct 3 ms 8016 KB Output is correct
42 Correct 4 ms 8036 KB Output is correct
43 Correct 1327 ms 8272 KB Output is correct
44 Correct 1955 ms 8272 KB Output is correct
45 Correct 1921 ms 8272 KB Output is correct
46 Correct 1939 ms 8272 KB Output is correct
47 Correct 1935 ms 8272 KB Output is correct
48 Correct 2001 ms 8272 KB Output is correct
49 Correct 1923 ms 8272 KB Output is correct
50 Correct 1946 ms 8272 KB Output is correct
51 Correct 1919 ms 8284 KB Output is correct
52 Correct 1902 ms 8272 KB Output is correct
53 Correct 1800 ms 9040 KB Output is correct
54 Correct 1915 ms 8272 KB Output is correct
55 Correct 1921 ms 8272 KB Output is correct
56 Correct 1936 ms 8272 KB Output is correct
57 Correct 1931 ms 8016 KB Output is correct
58 Correct 1931 ms 9296 KB Output is correct
59 Correct 1942 ms 9204 KB Output is correct
60 Correct 1929 ms 9296 KB Output is correct
61 Correct 1959 ms 8272 KB Output is correct
62 Correct 1973 ms 8016 KB Output is correct
63 Correct 1894 ms 8016 KB Output is correct
64 Correct 1922 ms 8016 KB Output is correct
65 Correct 950 ms 8016 KB Output is correct
66 Correct 1940 ms 8272 KB Output is correct
67 Correct 1818 ms 8272 KB Output is correct
68 Correct 1909 ms 8272 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 3 ms 8016 KB Output is correct
5 Correct 3 ms 8016 KB Output is correct
6 Correct 3 ms 8016 KB Output is correct
7 Correct 3 ms 8016 KB Output is correct
8 Correct 4 ms 8016 KB Output is correct
9 Correct 3 ms 8016 KB Output is correct
10 Correct 3 ms 8016 KB Output is correct
11 Correct 3 ms 8016 KB Output is correct
12 Correct 4 ms 8016 KB Output is correct
13 Correct 3 ms 8016 KB Output is correct
14 Correct 3 ms 8016 KB Output is correct
15 Correct 4 ms 8016 KB Output is correct
16 Correct 3 ms 8016 KB Output is correct
17 Correct 3 ms 8016 KB Output is correct
18 Correct 4 ms 8272 KB Output is correct
19 Correct 4 ms 8272 KB Output is correct
20 Correct 3 ms 8016 KB Output is correct
21 Correct 3 ms 8016 KB Output is correct
22 Correct 3 ms 8188 KB Output is correct
23 Correct 3 ms 8016 KB Output is correct
24 Correct 3 ms 8016 KB Output is correct
25 Correct 3 ms 8016 KB Output is correct
26 Correct 3 ms 8016 KB Output is correct
27 Correct 4 ms 8016 KB Output is correct
28 Correct 3 ms 8028 KB Output is correct
29 Correct 4 ms 8016 KB Output is correct
30 Correct 3 ms 8016 KB Output is correct
31 Correct 3 ms 8272 KB Output is correct
32 Correct 3 ms 8016 KB Output is correct
33 Correct 3 ms 8016 KB Output is correct
34 Correct 3 ms 8016 KB Output is correct
35 Correct 3 ms 8016 KB Output is correct
36 Correct 3 ms 8272 KB Output is correct
37 Correct 4 ms 8272 KB Output is correct
38 Correct 3 ms 8272 KB Output is correct
39 Correct 3 ms 8016 KB Output is correct
40 Correct 3 ms 8016 KB Output is correct
41 Correct 3 ms 8016 KB Output is correct
42 Correct 4 ms 8036 KB Output is correct
43 Correct 1352 ms 10064 KB Output is correct
44 Incorrect 1985 ms 12104 KB 1st lines differ - on the 1st token, expected: '913758140', found: '244331352'
45 Halted 0 ms 0 KB -