oj.uz

답안 #784208

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
784208 2023-07-15T20:56:04 Z oscar1f 디지털 회로 (IOI22_circuit) C++17
62 / 100
 904 ms 25392 KB 
#include "circuit.h"
#include<bits/stdc++.h>
using namespace std;

#define ll long long

struct noeud{
    ll give0,give1,coeff,deb,fin;
};

const ll TAILLE_MAX=200*1000+5,MODU=1000*1000*1000+2022,NB_FACT=3;
ll nbSom,nbSource,rep;
pair<ll,ll> prodGlob[NB_FACT];
vector<ll> pere,prem;
vector<ll> etatDeb;
pair<ll,ll> prodSom[TAILLE_MAX][NB_FACT];
ll nbFils[TAILLE_MAX];
ll valMod;
ll val[TAILLE_MAX];
noeud cumu[TAILLE_MAX];

pair<ll,ll> decompo(ll nb,ll p) {
    if (nb==0) {
        return {1,0};
    }
    ll nbOccu=0;
    while (nb%p==0) {
        nbOccu++;
        nb/=p;
    }
    return {nb%p,nbOccu};
}

ll puis(ll nb,ll expo,ll p) {
    if (expo==0) {
        return 1;
    }
    ll ans=puis(nb,expo/2,p);
    ans*=ans;
    ans%=p;
    if (expo%2==1) {
        ans*=nb;
        ans%=p;
    }
    return ans;
}

ll inverse(ll nb,ll p) {
    return puis(nb,p-2,p);
}

void prepa(ll pos,ll debInter,ll finInter) {
    cumu[pos].deb=debInter;
    cumu[pos].fin=finInter;
    if (debInter==finInter) {
        cumu[pos].give0=val[debInter]%MODU;
    }
    else {
        ll midInter=(debInter+finInter)/2;
        prepa(2*pos,debInter,midInter);
        prepa(2*pos+1,midInter+1,finInter);
        cumu[pos].give0=(cumu[2*pos].give0+cumu[2*pos+1].give0)%MODU;
    }
}

void pushFlag(ll pos) {
    if (cumu[pos].coeff%2==1) {
        swap(cumu[pos].give0,cumu[pos].give1);
    }
    if (cumu[pos].deb!=cumu[pos].fin) {
        cumu[2*pos].coeff+=cumu[pos].coeff;
        cumu[2*pos].coeff%=2;
        cumu[2*pos+1].coeff+=cumu[pos].coeff;
        cumu[2*pos+1].coeff%=2;
    }
    cumu[pos].coeff=0;
}

pair<ll,ll> update(ll pos,ll debInter,ll finInter) {
    //cout<<pos<<" "<<debInter<<" "<<finInter<<" : ";
    if (cumu[pos].deb>finInter or cumu[pos].fin<debInter) {
        //cout<<"A"<<endl;
        pushFlag(pos);
        return {cumu[pos].give0,cumu[pos].give1};
    }
    if (cumu[pos].deb>=debInter and cumu[pos].fin<=finInter) {
        //cout<<"B"<<endl;
        cumu[pos].coeff++;
        pushFlag(pos);
        return {cumu[pos].give0,cumu[pos].give1};
    }
    //cout<<"C"<<endl;
    pushFlag(pos);
    auto gauche=update(2*pos,debInter,finInter);
    auto droite=update(2*pos+1,debInter,finInter);
    cumu[pos].give0=(gauche.first+droite.first)%MODU;
    cumu[pos].give1=(gauche.second+droite.second)%MODU;
    return {cumu[pos].give0,cumu[pos].give1};
}

void afficher() {
    cout<<endl;
    for (ll i=1;i<20;i++) {
        cout<<i<<" : "<<cumu[i].deb<<" "<<cumu[i].fin<<" "<<cumu[i].coeff<<" "<<cumu[i].give0<<" "<<cumu[i].give1<<endl;
    }
    cout<<endl;
}

void init(int N, int M, vector<int> P, vector<int> A) {
    nbSom=N;
    nbSource=M;
    for (ll i:P) {
        pere.push_back(i);
    }
    prem={2,223,MODU/(2*223)};
    for (ll i:A) {
       etatDeb.push_back(i);
    }
    for (ll i:pere) {
        if (i>=0) {
            nbFils[i]++;
        }
    }
    for (ll j=0;j<NB_FACT;j++) {
        prodGlob[j].first=1;
        for (ll i=0;i<nbSom;i++) {
            prodGlob[j].first*=decompo(nbFils[i],prem[j]).first;
            prodGlob[j].first%=prem[j];
            prodGlob[j].second+=decompo(nbFils[i],prem[j]).second;
        }
    }

    for (ll j=0;j<NB_FACT;j++) {
        prodSom[0][j]=decompo(nbFils[0],prem[j]);
        for (ll i=1;i<nbSom+nbSource;i++) {
            prodSom[i][j]=prodSom[pere[i]][j];
            prodSom[i][j].first*=decompo(nbFils[i],prem[j]).first;
            prodSom[i][j].first%=prem[j];
            prodSom[i][j].second+=decompo(nbFils[i],prem[j]).second;
        }
    }

    /*for (ll i=0;i<nbSom+nbSource;i++) {
        cout<<i<<" : ";
        for (ll j=0;j<NB_FACT;j++) {
            cout<<prodSom[i][j].first<<" "<<prodSom[i][j].second<<"   ";
        }
        cout<<endl;
    }*/
    /*for (int j=0;j<NB_FACT;j++) {
        cout<<prodGlob[j].first<<" "<<prodGlob[j].second<<endl;
    }*/

    for (ll i=0;i<nbSource;i++) {
        //cout<<i+nbSom<<" : ";
        for (ll j=0;j<NB_FACT;j++) {
            if (prodSom[i+nbSom][j].second<prodGlob[j].second) {
                valMod=0;
            }
            else {
                valMod=prodGlob[j].first*inverse(prodSom[i+nbSom][j].first,prem[j]);
                //cout<<prodGlob[j].first<<" "<<prodSom[i+nbSom][j].first<<" "<<valMod<<" "<<prem[j]<<endl;
                valMod%=prem[j];
            }
            //cout<<valMod<<" ";
            val[i]+=valMod*(((MODU/prem[j])*inverse((MODU/prem[j]),prem[j]))%MODU);
        }
        val[i]%=MODU;
        //cout<<endl;
    }

    prepa(1,0,nbSource-1);
    //afficher();

    for (ll i=0;i<nbSource;i++) {
        //cout<<i+nbSom<<" : "<<val[i]<<endl;
        if (etatDeb[i]==1) {
            rep=update(1,i,i).second;
            //afficher();
        }
    }
}

int count_ways(int L, int R) {
    L-=nbSom;
    R-=nbSom;
    rep=update(1,L,R).second;
    return rep%MODU;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 464 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 464 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 2 ms 464 KB Output is correct
12 Correct 1 ms 464 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 2 ms 588 KB Output is correct
16 Correct 2 ms 464 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 2 ms 464 KB Output is correct
19 Correct 2 ms 464 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 2 ms 464 KB Output is correct
25 Correct 2 ms 464 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 2 ms 464 KB Output is correct
28 Correct 2 ms 464 KB Output is correct
29 Correct 2 ms 464 KB Output is correct
30 Correct 1 ms 464 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 2 ms 464 KB Output is correct
37 Correct 2 ms 464 KB Output is correct
38 Correct 1 ms 588 KB Output is correct
39 Correct 1 ms 464 KB Output is correct
40 Correct 1 ms 464 KB Output is correct
41 Correct 1 ms 464 KB Output is correct
42 Correct 1 ms 464 KB Output is correct

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 466 ms 8224 KB Output is correct
2 Correct 840 ms 16352 KB Output is correct
3 Correct 666 ms 16244 KB Output is correct
4 Correct 784 ms 16308 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 466 ms 8224 KB Output is correct
2 Correct 840 ms 16352 KB Output is correct
3 Correct 666 ms 16244 KB Output is correct
4 Correct 784 ms 16308 KB Output is correct
5 Correct 677 ms 8236 KB Output is correct
6 Correct 852 ms 16188 KB Output is correct
7 Correct 801 ms 16152 KB Output is correct
8 Correct 655 ms 16232 KB Output is correct
9 Correct 417 ms 824 KB Output is correct
10 Correct 823 ms 1340 KB Output is correct
11 Correct 703 ms 1360 KB Output is correct
12 Correct 709 ms 1340 KB Output is correct

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 464 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 2 ms 464 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 466 ms 8224 KB Output is correct
14 Correct 840 ms 16352 KB Output is correct
15 Correct 666 ms 16244 KB Output is correct
16 Correct 784 ms 16308 KB Output is correct
17 Correct 677 ms 8236 KB Output is correct
18 Correct 852 ms 16188 KB Output is correct
19 Correct 801 ms 16152 KB Output is correct
20 Correct 655 ms 16232 KB Output is correct
21 Correct 417 ms 824 KB Output is correct
22 Correct 823 ms 1340 KB Output is correct
23 Correct 703 ms 1360 KB Output is correct
24 Correct 709 ms 1340 KB Output is correct
25 Incorrect 674 ms 25392 KB 1st lines differ - on the 1st token, expected: '732332002', found: '803726135'
26 Halted 0 ms 0 KB -

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 2 ms 588 KB Output is correct
16 Correct 2 ms 464 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 2 ms 464 KB Output is correct
19 Correct 2 ms 464 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 2 ms 464 KB Output is correct
25 Correct 2 ms 464 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 2 ms 464 KB Output is correct
28 Correct 2 ms 464 KB Output is correct
29 Correct 2 ms 464 KB Output is correct
30 Correct 1 ms 464 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 2 ms 464 KB Output is correct
37 Correct 2 ms 464 KB Output is correct
38 Correct 1 ms 588 KB Output is correct
39 Correct 1 ms 464 KB Output is correct
40 Correct 1 ms 464 KB Output is correct
41 Correct 1 ms 464 KB Output is correct
42 Correct 1 ms 464 KB Output is correct
43 Correct 525 ms 1156 KB Output is correct
44 Correct 775 ms 1232 KB Output is correct
45 Correct 748 ms 1192 KB Output is correct
46 Correct 809 ms 1888 KB Output is correct
47 Correct 880 ms 1872 KB Output is correct
48 Correct 754 ms 1904 KB Output is correct
49 Correct 785 ms 1880 KB Output is correct
50 Correct 491 ms 1880 KB Output is correct
51 Correct 726 ms 1488 KB Output is correct
52 Correct 877 ms 1488 KB Output is correct
53 Correct 609 ms 732 KB Output is correct
54 Correct 672 ms 1876 KB Output is correct
55 Correct 785 ms 1616 KB Output is correct
56 Correct 807 ms 1536 KB Output is correct
57 Correct 893 ms 1488 KB Output is correct
58 Correct 792 ms 1896 KB Output is correct
59 Correct 576 ms 1880 KB Output is correct
60 Correct 689 ms 1876 KB Output is correct
61 Correct 703 ms 1188 KB Output is correct
62 Correct 821 ms 1172 KB Output is correct
63 Correct 763 ms 1140 KB Output is correct
64 Correct 830 ms 1496 KB Output is correct
65 Correct 435 ms 828 KB Output is correct
66 Correct 662 ms 1340 KB Output is correct
67 Correct 904 ms 1336 KB Output is correct
68 Correct 626 ms 1360 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 2 ms 588 KB Output is correct
16 Correct 2 ms 464 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 2 ms 464 KB Output is correct
19 Correct 2 ms 464 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 2 ms 464 KB Output is correct
25 Correct 2 ms 464 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 2 ms 464 KB Output is correct
28 Correct 2 ms 464 KB Output is correct
29 Correct 2 ms 464 KB Output is correct
30 Correct 1 ms 464 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 2 ms 464 KB Output is correct
37 Correct 2 ms 464 KB Output is correct
38 Correct 1 ms 588 KB Output is correct
39 Correct 1 ms 464 KB Output is correct
40 Correct 1 ms 464 KB Output is correct
41 Correct 1 ms 464 KB Output is correct
42 Correct 1 ms 464 KB Output is correct
43 Correct 466 ms 8224 KB Output is correct
44 Correct 840 ms 16352 KB Output is correct
45 Correct 666 ms 16244 KB Output is correct
46 Correct 784 ms 16308 KB Output is correct
47 Correct 677 ms 8236 KB Output is correct
48 Correct 852 ms 16188 KB Output is correct
49 Correct 801 ms 16152 KB Output is correct
50 Correct 655 ms 16232 KB Output is correct
51 Correct 417 ms 824 KB Output is correct
52 Correct 823 ms 1340 KB Output is correct
53 Correct 703 ms 1360 KB Output is correct
54 Correct 709 ms 1340 KB Output is correct
55 Incorrect 674 ms 25392 KB 1st lines differ - on the 1st token, expected: '732332002', found: '803726135'
56 Halted 0 ms 0 KB -