oj.uz

답안 #783361

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
783361 2023-07-14T21:36:24 Z oscar1f Two Currencies (JOI23_currencies) C++17
100 / 100
 880 ms 49356 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long

const int MAX_SOM=100*1000+5,MAX_LOG=18,MAX_REQ=100*1000+5,DECA=(1<<17);
int nbSom,nbCheck,nbReq,idAre,coutArg,idSom,nbRest;
vector<int> adja[MAX_SOM];
int are[MAX_SOM][2];
int prof[MAX_SOM];
int pere[MAX_SOM][MAX_LOG];
int req[MAX_REQ][6];
int num[MAX_SOM];
int sousArbre[MAX_SOM][2];
vector<pair<int,int>> checkTri;
vector<int> reqDeb;
int cumu[2*DECA][2];

void DFS(int pos,int anci,int etage) {
    if (prof[pos]==0) {
        //cout<<pos<<" "<<anci<<" "<<etage<<endl;
        pere[pos][0]=anci;
        prof[pos]=etage;
        idSom++;
        num[pos]=idSom;
        sousArbre[pos][0]=idSom;
        for (int vois:adja[pos]) {
            DFS(vois,pos,etage+1);
        }
        sousArbre[pos][1]=idSom;
    }
}

int lca(int som1,int som2) {
    if (prof[som1]>prof[som2]) {
        swap(som1,som2);
    }
    for (int i=MAX_LOG-1;i>=0;i--) {
        if (prof[pere[som2][i]]>=prof[som1]) {
            som2=pere[som2][i];
        }
    } 
    if (som1==som2) {
        return som1;
    }
    for (int i=MAX_LOG-1;i>=0;i--) {
        if (pere[som1][i]!=pere[som2][i]) {
            som1=pere[som1][i];
            som2=pere[som2][i];
        }
    }
    return pere[som1][0];
}

void ajout(int deb,int fin,int val,int idTab) {
    if (deb==fin) {
        cumu[deb][idTab]+=val;
    }
    else if (deb%2==1) {
        cumu[deb][idTab]+=val;
        ajout(deb+1,fin,val,idTab);
    }
    else if (fin%2==0) {
        cumu[fin][idTab]+=val;
        ajout(deb,fin-1,val,idTab);
    }
    else {
        ajout(deb/2,fin/2,val,idTab);
    }
}

int calcVal(int pos,int idTab) {
    int somme=0;
    while (pos!=0) {
        somme+=cumu[pos][idTab];
        pos/=2;
    }
    return somme;
}

void addAre(int i,int coeff) {
    //cout<<i<<" : "<<sousArbre[are[checkTri[i].second][1]][0]<<" "<<sousArbre[are[checkTri[i].second][1]][1]<<endl;
    ajout(DECA+sousArbre[are[checkTri[i].second][1]][0],DECA+sousArbre[are[checkTri[i].second][1]][1],checkTri[i].first*coeff,0);
    ajout(DECA+sousArbre[are[checkTri[i].second][1]][0],DECA+sousArbre[are[checkTri[i].second][1]][1],coeff,1);
}

int calcDist(int r,int idTab) {
    /*cout<<endl;
    cout<<r<<" "<<idTab<<endl;
    cout<<num[req[r][0]]<<" = "<<calcVal(DECA+num[req[r][0]],idTab)<<endl;
    cout<<num[req[r][1]]<<" = "<<calcVal(DECA+num[req[r][1]],idTab)<<endl;
    cout<<num[req[r][5]]<<" = "<<calcVal(DECA+num[req[r][5]],idTab)<<endl;*/
    return calcVal(DECA+num[req[r][0]],idTab)+calcVal(DECA+num[req[r][1]],idTab)-2*calcVal(DECA+num[req[r][5]],idTab);
}

void calc(int debInter,int finInter,int posCour,vector<int> reqCour) {
    if (reqCour.empty()) {
        return;
    }
    int midInter=(debInter+finInter+1)/2;
    if (finInter==-1) {
        midInter=-1;
    }

    /*cout<<debInter<<" "<<finInter<<" "<<posCour<<" "<<midInter<<" : ";
    for (int r:reqCour) {
        cout<<r<<" ";
    }
    cout<<endl;*/

    if (posCour<midInter) {
        for (int i=posCour+1;i<=midInter;i++) {
            addAre(i,1);
        }
    }
    else {
        for (int i=posCour;i>midInter;i--) {
            addAre(i,-1);
        }
    }

    /*for (int i=1;i<2*DECA;i++) {
        cout<<cumu[i][0]<<" "<<cumu[i][1]<<"      ";
    }
    cout<<endl;*/

    if (debInter==finInter) {
        for (int r:reqCour) {
            //cout<<r<<" "<<calcDist(r,0)<<" "<<calcDist(r,1)<<endl;
            req[r][4]=calcDist(r,1);
        }
    }
    else {
        vector<int> reqSous,reqSur;
        for (int r:reqCour) {
            //cout<<r<<" : "<<calcDist(r,0)<<endl;
            if (calcDist(r,0)>req[r][3]) {
                reqSous.push_back(r);
            } 
            else {
                reqSur.push_back(r);
            }
        }
        calc(debInter,midInter-1,midInter,reqSous);
        calc(midInter,finInter,midInter,reqSur);
    }

    if (posCour<midInter) {
        for (int i=posCour+1;i<=midInter;i++) {
            addAre(i,-1);
        }
    }
    else {
        for (int i=posCour;i>midInter;i--) {
            addAre(i,1);
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>nbSom>>nbCheck>>nbReq;
    for (int i=1;i<nbSom;i++) {
        cin>>are[i][0]>>are[i][1];
        adja[are[i][0]].push_back(are[i][1]);
        adja[are[i][1]].push_back(are[i][0]);
    }
    DFS(1,0,1);
    /*for (int i=1;i<=nbSom;i++) {
        cout<<i<<" : "<<num[i]<<" "<<sousArbre[i][0]<<" "<<sousArbre[i][1]<<" "<<pere[i][0]<<" "<<prof[i]<<endl;
    }*/
    for (int j=1;j<MAX_LOG;j++) {
        for (int i=0;i<=nbSom;i++) {
            pere[i][j]=pere[pere[i][j-1]][j-1];
        }
    }
    for (int i=1;i<nbSom;i++) {
        if (prof[are[i][0]]>prof[are[i][1]]) {
            swap(are[i][0],are[i][1]);
        }
    }
    for (int i=0;i<nbCheck;i++) {
        cin>>idAre>>coutArg;
        checkTri.push_back({coutArg,idAre});
    }
    sort(checkTri.begin(),checkTri.end());
    for (int i=0;i<nbReq;i++) {
        cin>>req[i][0]>>req[i][1]>>req[i][2]>>req[i][3];
        reqDeb.push_back(i);
        req[i][5]=lca(req[i][0],req[i][1]);
    }
    calc(-1,nbCheck-1,-1,reqDeb);

    for (int i=0;i<nbCheck;i++) {
        addAre(i,1);
    }
    for (int i=0;i<nbReq;i++) {
        nbRest=calcDist(i,1)-req[i][4];
        //cout<<i<<" : "<<req[i][4]<<" "<<calcDist(i,1)<<" ";
        cout<<max(req[i][2]-nbRest,(int)-1)<<"\n";
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 5 ms 3412 KB Output is correct
6 Correct 6 ms 3668 KB Output is correct
7 Correct 6 ms 3464 KB Output is correct
8 Correct 6 ms 3540 KB Output is correct
9 Correct 6 ms 3552 KB Output is correct
10 Correct 6 ms 3520 KB Output is correct
11 Correct 7 ms 3540 KB Output is correct
12 Correct 6 ms 3600 KB Output is correct
13 Correct 9 ms 3668 KB Output is correct
14 Correct 8 ms 3668 KB Output is correct
15 Correct 8 ms 3624 KB Output is correct
16 Correct 8 ms 3540 KB Output is correct
17 Correct 8 ms 3540 KB Output is correct
18 Correct 8 ms 3624 KB Output is correct
19 Correct 5 ms 3588 KB Output is correct
20 Correct 6 ms 3588 KB Output is correct
21 Correct 5 ms 3668 KB Output is correct
22 Correct 6 ms 3668 KB Output is correct
23 Correct 6 ms 3636 KB Output is correct
24 Correct 6 ms 3632 KB Output is correct
25 Correct 6 ms 3540 KB Output is correct
26 Correct 5 ms 3540 KB Output is correct
27 Correct 5 ms 3604 KB Output is correct
28 Correct 5 ms 3540 KB Output is correct
29 Correct 6 ms 3796 KB Output is correct
30 Correct 6 ms 3616 KB Output is correct
31 Correct 6 ms 3540 KB Output is correct
32 Correct 6 ms 3540 KB Output is correct
33 Correct 9 ms 3720 KB Output is correct
34 Correct 8 ms 3668 KB Output is correct
35 Correct 8 ms 3668 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2684 KB Output is correct
2 Correct 6 ms 3592 KB Output is correct
3 Correct 6 ms 3540 KB Output is correct
4 Correct 6 ms 3592 KB Output is correct
5 Correct 284 ms 45116 KB Output is correct
6 Correct 328 ms 42936 KB Output is correct
7 Correct 310 ms 45356 KB Output is correct
8 Correct 254 ms 41556 KB Output is correct
9 Correct 241 ms 41068 KB Output is correct
10 Correct 377 ms 43908 KB Output is correct
11 Correct 381 ms 44216 KB Output is correct
12 Correct 396 ms 44512 KB Output is correct
13 Correct 373 ms 44760 KB Output is correct
14 Correct 392 ms 43848 KB Output is correct
15 Correct 695 ms 48440 KB Output is correct
16 Correct 726 ms 49032 KB Output is correct
17 Correct 695 ms 48264 KB Output is correct
18 Correct 556 ms 43196 KB Output is correct
19 Correct 573 ms 42932 KB Output is correct
20 Correct 557 ms 42816 KB Output is correct
21 Correct 316 ms 48688 KB Output is correct
22 Correct 302 ms 48748 KB Output is correct
23 Correct 305 ms 49356 KB Output is correct
24 Correct 312 ms 49268 KB Output is correct
25 Correct 353 ms 45624 KB Output is correct
26 Correct 328 ms 46176 KB Output is correct
27 Correct 339 ms 46308 KB Output is correct
28 Correct 258 ms 46820 KB Output is correct
29 Correct 265 ms 48052 KB Output is correct
30 Correct 302 ms 46700 KB Output is correct
31 Correct 302 ms 47004 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 9 ms 3668 KB Output is correct
3 Correct 9 ms 3692 KB Output is correct
4 Correct 9 ms 3592 KB Output is correct
5 Correct 478 ms 48660 KB Output is correct
6 Correct 406 ms 48220 KB Output is correct
7 Correct 616 ms 40572 KB Output is correct
8 Correct 749 ms 48880 KB Output is correct
9 Correct 759 ms 49000 KB Output is correct
10 Correct 772 ms 49116 KB Output is correct
11 Correct 590 ms 49012 KB Output is correct
12 Correct 583 ms 49112 KB Output is correct
13 Correct 606 ms 49096 KB Output is correct
14 Correct 659 ms 49324 KB Output is correct
15 Correct 574 ms 49324 KB Output is correct
16 Correct 676 ms 49316 KB Output is correct
17 Correct 659 ms 49332 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 5 ms 3412 KB Output is correct
6 Correct 6 ms 3668 KB Output is correct
7 Correct 6 ms 3464 KB Output is correct
8 Correct 6 ms 3540 KB Output is correct
9 Correct 6 ms 3552 KB Output is correct
10 Correct 6 ms 3520 KB Output is correct
11 Correct 7 ms 3540 KB Output is correct
12 Correct 6 ms 3600 KB Output is correct
13 Correct 9 ms 3668 KB Output is correct
14 Correct 8 ms 3668 KB Output is correct
15 Correct 8 ms 3624 KB Output is correct
16 Correct 8 ms 3540 KB Output is correct
17 Correct 8 ms 3540 KB Output is correct
18 Correct 8 ms 3624 KB Output is correct
19 Correct 5 ms 3588 KB Output is correct
20 Correct 6 ms 3588 KB Output is correct
21 Correct 5 ms 3668 KB Output is correct
22 Correct 6 ms 3668 KB Output is correct
23 Correct 6 ms 3636 KB Output is correct
24 Correct 6 ms 3632 KB Output is correct
25 Correct 6 ms 3540 KB Output is correct
26 Correct 5 ms 3540 KB Output is correct
27 Correct 5 ms 3604 KB Output is correct
28 Correct 5 ms 3540 KB Output is correct
29 Correct 6 ms 3796 KB Output is correct
30 Correct 6 ms 3616 KB Output is correct
31 Correct 6 ms 3540 KB Output is correct
32 Correct 6 ms 3540 KB Output is correct
33 Correct 9 ms 3720 KB Output is correct
34 Correct 8 ms 3668 KB Output is correct
35 Correct 8 ms 3668 KB Output is correct
36 Correct 1 ms 2684 KB Output is correct
37 Correct 6 ms 3592 KB Output is correct
38 Correct 6 ms 3540 KB Output is correct
39 Correct 6 ms 3592 KB Output is correct
40 Correct 284 ms 45116 KB Output is correct
41 Correct 328 ms 42936 KB Output is correct
42 Correct 310 ms 45356 KB Output is correct
43 Correct 254 ms 41556 KB Output is correct
44 Correct 241 ms 41068 KB Output is correct
45 Correct 377 ms 43908 KB Output is correct
46 Correct 381 ms 44216 KB Output is correct
47 Correct 396 ms 44512 KB Output is correct
48 Correct 373 ms 44760 KB Output is correct
49 Correct 392 ms 43848 KB Output is correct
50 Correct 695 ms 48440 KB Output is correct
51 Correct 726 ms 49032 KB Output is correct
52 Correct 695 ms 48264 KB Output is correct
53 Correct 556 ms 43196 KB Output is correct
54 Correct 573 ms 42932 KB Output is correct
55 Correct 557 ms 42816 KB Output is correct
56 Correct 316 ms 48688 KB Output is correct
57 Correct 302 ms 48748 KB Output is correct
58 Correct 305 ms 49356 KB Output is correct
59 Correct 312 ms 49268 KB Output is correct
60 Correct 353 ms 45624 KB Output is correct
61 Correct 328 ms 46176 KB Output is correct
62 Correct 339 ms 46308 KB Output is correct
63 Correct 258 ms 46820 KB Output is correct
64 Correct 265 ms 48052 KB Output is correct
65 Correct 302 ms 46700 KB Output is correct
66 Correct 302 ms 47004 KB Output is correct
67 Correct 2 ms 2644 KB Output is correct
68 Correct 9 ms 3668 KB Output is correct
69 Correct 9 ms 3692 KB Output is correct
70 Correct 9 ms 3592 KB Output is correct
71 Correct 478 ms 48660 KB Output is correct
72 Correct 406 ms 48220 KB Output is correct
73 Correct 616 ms 40572 KB Output is correct
74 Correct 749 ms 48880 KB Output is correct
75 Correct 759 ms 49000 KB Output is correct
76 Correct 772 ms 49116 KB Output is correct
77 Correct 590 ms 49012 KB Output is correct
78 Correct 583 ms 49112 KB Output is correct
79 Correct 606 ms 49096 KB Output is correct
80 Correct 659 ms 49324 KB Output is correct
81 Correct 574 ms 49324 KB Output is correct
82 Correct 676 ms 49316 KB Output is correct
83 Correct 659 ms 49332 KB Output is correct
84 Correct 291 ms 41428 KB Output is correct
85 Correct 295 ms 35584 KB Output is correct
86 Correct 253 ms 34884 KB Output is correct
87 Correct 418 ms 44220 KB Output is correct
88 Correct 406 ms 44396 KB Output is correct
89 Correct 426 ms 44232 KB Output is correct
90 Correct 424 ms 44080 KB Output is correct
91 Correct 420 ms 44284 KB Output is correct
92 Correct 880 ms 46636 KB Output is correct
93 Correct 827 ms 48056 KB Output is correct
94 Correct 665 ms 42980 KB Output is correct
95 Correct 661 ms 42964 KB Output is correct
96 Correct 654 ms 43108 KB Output is correct
97 Correct 654 ms 42632 KB Output is correct
98 Correct 349 ms 48448 KB Output is correct
99 Correct 346 ms 48704 KB Output is correct
100 Correct 364 ms 49088 KB Output is correct
101 Correct 376 ms 49344 KB Output is correct
102 Correct 418 ms 44784 KB Output is correct
103 Correct 379 ms 45344 KB Output is correct
104 Correct 389 ms 45244 KB Output is correct
105 Correct 286 ms 45444 KB Output is correct
106 Correct 284 ms 45520 KB Output is correct
107 Correct 333 ms 46184 KB Output is correct
108 Correct 345 ms 45668 KB Output is correct