oj.uz

Submission #806673

# Submission time Handle Problem Language Result Execution time Memory
806673 2023-08-04T08:43:52 Z oscar1f Cake 3 (JOI19_cake3) C++17
100 / 100
 675 ms 199156 KB 
#include<bits/stdc++.h>
using namespace std;
    
#define int long long
using pii=pair<int,int>;
    
string to_string(string s) { return s; }
template <typename T> string to_string(T v) {
    bool first = true;
    string res = "[";
    for (const auto &x : v) {
        if (!first)
            res += ", ";
        first = false;
        res += to_string(x);
    }
    res += "]";
    return res;
}
    
template <typename A, typename B>
string to_string(pair<A, B> p) {
    return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
    
void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
    cout << ' ' << to_string(H);
    dbg_out(T...);
}
    
#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
    
struct noeud{
    int minVal,maxVal,pos;
    noeud *filsGauche=nullptr,*filsDroit=nullptr;
    vector<int> cumuGauche,cumuVal,cumuDroite;
    noeud (vector<int> listeVal) {
        assert(!listeVal.empty());
        minVal = *min_element(listeVal.begin(), listeVal.end());
        maxVal = *max_element(listeVal.begin(), listeVal.end());
        //dbg(minVal,maxVal,listeVal);
        cumuVal.push_back(0);
        for (auto x:listeVal) {
            cumuVal.push_back(x+cumuVal.back());
        }
        int taille=listeVal.size();
        if (minVal!=maxVal) {
            int mid=(minVal+maxVal)/2;
            vector<int> listeGauche,listeDroite;
            cumuGauche.push_back(0);
            cumuDroite.push_back(0);
            for (int x:listeVal) {
                int estGauche;
                if (x<=mid) {
                    estGauche=1;
                    listeGauche.push_back(x);
                }
                else {
                    estGauche=0;
                    listeDroite.push_back(x);
                }
                cumuGauche.push_back(cumuGauche.back()+estGauche);
                cumuDroite.push_back(cumuDroite.back()+1-estGauche);
            }
            if (!listeGauche.empty()) {
                filsGauche=new noeud(listeGauche);
            }
            if (!listeDroite.empty()) {
                filsDroit=new noeud(listeDroite);
            }
        }
        else {
            cumuGauche.resize(taille+1,0);
            cumuDroite.resize(taille+1,0);
        }
    }
    pair<int,int> somMax(int deb,int fin,int nbVal) {
        if (deb>fin) {
            return {0,0};
        } else if (fin-deb+1<=nbVal || minVal == maxVal) {
            int nouvDeb = max(deb, fin-nbVal+1); //s.t. fin-nd+1 = nbVal
            int somme = cumuVal[fin+1]-cumuVal[nouvDeb];
            return {somme, fin-nouvDeb+1};
        }
        //int nbGauche=cumuGauche[fin+1]-cumuGauche[deb];
        //int nbDroite=cumuDroite[fin+1]-cumuDroite[deb];
        int debGauche=cumuGauche[deb];
        int finGauche=cumuGauche[fin+1]-1;
        int debDroite=cumuDroite[deb];
        int finDroite=cumuDroite[fin+1]-1;
        int somDroit=0,cntDroit=0,somGauche=0,cntGauche=0;
        if (filsDroit!=nullptr) {
            tie(somDroit,cntDroit)=filsDroit->somMax(debDroite,finDroite,nbVal);
            nbVal-=cntDroit;
        }
        if (nbVal>0 and filsGauche!=nullptr) {
            tie(somGauche,cntGauche)=filsGauche->somMax(debGauche,finGauche,nbVal);
        }
        dbg(somDroit,somGauche,cntDroit,cntGauche);
        return {somDroit+somGauche,cntDroit+cntGauche};
    }
};
    
const int INFINI=(int)1000*1000*1000*1000*1000*1000;
int nbPossi,tailleCol,prix,benef,rep;
noeud *racine;
vector<pair<int,int>> possi;
    
int somMax(int deb,int fin,int nbVal) {
    return racine->somMax(deb,fin,nbVal).first;
}
    
int calcMeil(int deb,int fin) {
    return possi[deb].second+possi[fin].second-2*(possi[fin].first-possi[deb].first)+somMax(deb+1,fin-1,tailleCol-2);
}
    
void calc(int minDeb,int maxDeb,int minFin,int maxFin) {
    if (maxDeb<minDeb or maxFin<minFin) {
        return;
    }
    int deb=(minDeb+maxDeb)/2;
    pii record={-INFINI,maxFin};
    dbg(deb);
    for (int i=minFin;i<=maxFin;i++) {
        if (i-deb+1>=tailleCol) {
            dbg(deb,i);
            record=max(record,{calcMeil(deb,i),i});
        } 
    }
    rep=max(rep,record.first);
    calc(minDeb,deb-1,minFin,record.second);
    calc(deb+1,maxDeb,record.second,maxFin);
}
    
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>nbPossi>>tailleCol;
    for (int i=0;i<nbPossi;i++) {
        cin>>benef>>prix;
        possi.push_back({prix,benef});
    }
    sort(possi.begin(),possi.end());
    vector<int> listeCoul;
    for (auto [_,coul]:possi) {
        listeCoul.push_back(coul);
    }
    rep=-INFINI;
    racine=new noeud(listeCoul);
    calc(0,nbPossi-1,0,nbPossi-1);
    cout<<rep<<endl;
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 6 ms 1748 KB Output is correct
39 Correct 5 ms 1876 KB Output is correct
40 Correct 3 ms 1876 KB Output is correct
41 Correct 3 ms 1748 KB Output is correct
42 Correct 4 ms 1876 KB Output is correct
43 Correct 3 ms 1748 KB Output is correct
44 Correct 4 ms 1748 KB Output is correct
45 Correct 4 ms 1852 KB Output is correct
46 Correct 4 ms 1876 KB Output is correct
47 Correct 4 ms 1876 KB Output is correct
48 Correct 4 ms 1748 KB Output is correct
49 Correct 3 ms 1876 KB Output is correct
50 Correct 3 ms 1876 KB Output is correct
51 Correct 3 ms 1876 KB Output is correct
52 Correct 3 ms 1748 KB Output is correct
53 Correct 3 ms 1876 KB Output is correct
54 Correct 3 ms 1876 KB Output is correct
55 Correct 3 ms 1876 KB Output is correct
56 Correct 3 ms 1748 KB Output is correct
57 Correct 3 ms 1756 KB Output is correct
58 Correct 3 ms 1748 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 468 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 468 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 4 ms 1748 KB Output is correct
66 Correct 3 ms 1748 KB Output is correct
67 Correct 4 ms 1876 KB Output is correct
68 Correct 4 ms 1848 KB Output is correct
69 Correct 3 ms 1748 KB Output is correct
70 Correct 3 ms 1876 KB Output is correct
71 Correct 1 ms 596 KB Output is correct
72 Correct 1 ms 596 KB Output is correct
73 Correct 4 ms 1748 KB Output is correct
74 Correct 3 ms 1876 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 6 ms 1748 KB Output is correct
39 Correct 5 ms 1876 KB Output is correct
40 Correct 3 ms 1876 KB Output is correct
41 Correct 3 ms 1748 KB Output is correct
42 Correct 4 ms 1876 KB Output is correct
43 Correct 3 ms 1748 KB Output is correct
44 Correct 4 ms 1748 KB Output is correct
45 Correct 4 ms 1852 KB Output is correct
46 Correct 4 ms 1876 KB Output is correct
47 Correct 4 ms 1876 KB Output is correct
48 Correct 4 ms 1748 KB Output is correct
49 Correct 3 ms 1876 KB Output is correct
50 Correct 3 ms 1876 KB Output is correct
51 Correct 3 ms 1876 KB Output is correct
52 Correct 3 ms 1748 KB Output is correct
53 Correct 3 ms 1876 KB Output is correct
54 Correct 3 ms 1876 KB Output is correct
55 Correct 3 ms 1876 KB Output is correct
56 Correct 3 ms 1748 KB Output is correct
57 Correct 3 ms 1756 KB Output is correct
58 Correct 3 ms 1748 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 468 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 468 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 4 ms 1748 KB Output is correct
66 Correct 3 ms 1748 KB Output is correct
67 Correct 4 ms 1876 KB Output is correct
68 Correct 4 ms 1848 KB Output is correct
69 Correct 3 ms 1748 KB Output is correct
70 Correct 3 ms 1876 KB Output is correct
71 Correct 1 ms 596 KB Output is correct
72 Correct 1 ms 596 KB Output is correct
73 Correct 4 ms 1748 KB Output is correct
74 Correct 3 ms 1876 KB Output is correct
75 Correct 665 ms 187296 KB Output is correct
76 Correct 675 ms 183468 KB Output is correct
77 Correct 611 ms 187648 KB Output is correct
78 Correct 639 ms 190148 KB Output is correct
79 Correct 275 ms 190776 KB Output is correct
80 Correct 306 ms 185936 KB Output is correct
81 Correct 388 ms 108656 KB Output is correct
82 Correct 568 ms 121440 KB Output is correct
83 Correct 432 ms 113692 KB Output is correct
84 Correct 518 ms 115920 KB Output is correct
85 Correct 450 ms 108752 KB Output is correct
86 Correct 273 ms 100056 KB Output is correct
87 Correct 289 ms 101256 KB Output is correct
88 Correct 362 ms 105316 KB Output is correct
89 Correct 393 ms 105168 KB Output is correct
90 Correct 269 ms 102916 KB Output is correct
91 Correct 217 ms 97040 KB Output is correct
92 Correct 221 ms 96560 KB Output is correct
93 Correct 234 ms 99096 KB Output is correct
94 Correct 197 ms 99200 KB Output is correct
95 Correct 281 ms 102500 KB Output is correct
96 Correct 59 ms 11148 KB Output is correct
97 Correct 53 ms 11984 KB Output is correct
98 Correct 51 ms 11612 KB Output is correct
99 Correct 49 ms 11848 KB Output is correct
100 Correct 44 ms 11096 KB Output is correct
101 Correct 53 ms 11160 KB Output is correct
102 Correct 315 ms 81544 KB Output is correct
103 Correct 297 ms 80568 KB Output is correct
104 Correct 359 ms 86492 KB Output is correct
105 Correct 243 ms 78936 KB Output is correct
106 Correct 248 ms 81064 KB Output is correct
107 Correct 229 ms 76028 KB Output is correct
108 Correct 585 ms 189304 KB Output is correct
109 Correct 543 ms 199156 KB Output is correct
110 Correct 80 ms 31736 KB Output is correct
111 Correct 95 ms 31956 KB Output is correct
112 Correct 625 ms 182576 KB Output is correct
113 Correct 280 ms 198912 KB Output is correct