Submission #746567

#	Time	Username	Problem	Language	Result	Execution time	Memory
746567		Rafi22	디지털 회로 (IOI22_circuit)	C++17	100 / 100	1304 ms	43896 KiB

circuit

#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000002022;
int inf=1000000007;
ll infl=1000000000000000007;

const int N=200007,pot=1<<17;

bool is[N];
vector<int>G[N];
ll ile[N];
vector<ll>P[N];
vector<ll>S[N];

ll seg[2][2*pot+7];
bool lzy[2*pot+7];

void ins(int v,int a,int b,int l,int r)
{
    if(a<=l&&b>=r)
    {
        swap(seg[0][v],seg[1][v]);
        lzy[v]^=1;
        return ;
    }
    if(r<a||l>b) return ;
    if(lzy[v])
    {
        swap(seg[0][2*v],seg[1][2*v]);
        swap(seg[0][2*v+1],seg[1][2*v+1]);
        lzy[2*v]^=1;
        lzy[2*v+1]^=1;
        lzy[v]=0;
    }

    ins(2*v,a,b,l,(l+r)/2);
    ins(2*v+1,a,b,(l+r)/2+1,r);
    seg[0][v]=seg[0][2*v]+seg[0][2*v+1];
    seg[1][v]=seg[1][2*v]+seg[1][2*v+1];
}

int n,m;

void dfs(int v)
{
    ile[v]=max(1,sz(G[v]));
    for(auto u:G[v])
    {
        dfs(u);
        ile[v]=ile[v]*ile[u]%mod;
    }
}

void dfs1(int v,ll c)
{
    if(sz(G[v])==0)
    {
        seg[is[v]][v-n+1+pot-1]=c;
        return ;
    }
    P[v].resize(sz(G[v])+2,1);
    for(int i=0;i<sz(G[v]);i++) P[v][i+1]=P[v][i]*ile[G[v][i]]%mod;
    S[v].resize(sz(G[v])+2,1);
    for(int i=sz(G[v])-1;i>=0;i--) S[v][i+1]=S[v][i+2]*ile[G[v][i]]%mod;
    for(int i=0;i<sz(G[v]);i++)
    {
        dfs1(G[v][i],c*P[v][i]%mod*S[v][i+2]%mod);
    }
}

void init(int N,int M,vector<int>p,vector<int>a)
{
    n=N,m=M;
    for(int i=0;i<m;i++) is[i+n]=a[i];
    for(int i=1;i<n+m;i++) G[p[i]].pb(i);
    dfs(0);
    dfs1(0,1);
    for(int i=pot-1;i>0;i--)
    {
        seg[0][i]=(seg[0][2*i]+seg[0][2*i+1])%mod;
        seg[1][i]=(seg[1][2*i]+seg[1][2*i+1])%mod;
    }
}

int count_ways(int l,int r)
{
    ins(1,l-n+1,r-n+1,1,pot);
    return seg[1][1]%mod;
}

/*int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    init(3, 4, {-1, 0, 1, 2, 1, 1, 0}, {1, 0, 1, 0});
    cout<<count_ways(3, 4)<<endl;
    cout<<count_ways(4, 5)<<endl;
    cout<<count_ways(3, 6)<<endl;
    return 0;
}*/

• Subtask 1: 2 / 2
• Subtask 2: 7 / 7
• Subtask 3: 9 / 9
• Subtask 4: 4 / 4
• Subtask 5: 12 / 12
• Subtask 6: 27 / 27
• Subtask 7: 28 / 28
• Subtask 8: 11 / 11