oj.uz

답안 #488243

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
488243 2021-11-18T09:23:14 Z balbit Cake 3 (JOI19_cake3) C++14
100 / 100
 1961 ms 43024 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 2e5+5;

int n, M;
priority_queue<int, vector<int>, greater<int> > top; // the top <=M best cakess
priority_queue<int, vector<int>, greater<int> > top_rm;



priority_queue<int> backup; // remaining cakes
priority_queue<int> backup_rm;
ll now = 0; // sum of cakes in top

int rL = 0, rR = -1; // range, inclusive

int val[maxn];
ll pos[maxn];

void AAA(bool t) {
    if (!t) {
        cout<<"death"<<endl;
        exit(0);
    }
}

void topclean(){
    while (SZ(top_rm) && SZ(top) && top.top() == top_rm.top()) {
        top.pop(); top_rm.pop();
    }
}

void backupclean(){
    while (SZ(backup_rm) && SZ(backup) && backup.top() == backup_rm.top()) {
        backup.pop(); backup_rm.pop();
    }
}


void add(int p) {
    AAA(p>=0);
    now += val[p];
    top.push(val[p]);
    backupclean();
    if (SZ(top) - SZ(top_rm) > M) {
        topclean();
        now -= top.top();
        backup.push(top.top());
        top.pop();
    }
}

void del(int p) {
    backupclean();
    topclean();
    if (SZ(backup) && (backup.top() >= val[p])){
        // remove from backup
        backup_rm.push(val[p]);
    }else{
        now -= val[p];
        top_rm.push(val[p]);
        if (SZ(backup)) {
            now += backup.top();
            top.push(backup.top());
            backup.pop();
        }
    }
}

inline ll gat() {
    if (SZ(top)-SZ(top_rm) < M) {
        bug(rR, rL, SZ(top), SZ(top_rm));
        return -inf+10;
    }
    return now - 2*(pos[rR] - pos[rL]);
}

ll re = -inf;

void DandC(int l, int r, int ql, int qr) {
    if (l > r) return;
    int mid = (l+r)/2;

    while (rL > ql) {
        add(--rL);
    }
    while (rR < mid) {
        add(++rR);
    }
    while (rL < ql) {
        del(rL++);
    }
    while (rR > mid) {
        del(rR--);
    }

    ll bst = -inf;
    int bat = -1;

    AAA(rL == ql && rR == mid);

    for (int ty = ql; ty <= min(qr, mid); ++ty) {
//        AAA(rR == mid && rL == ty);

        if (gat() > bst) {
            bst = gat(); bat = ty;
        }

        if (ty != min(qr,mid)) {
            del(rL++);
        }
    }

    AAA(bat != -1);

    bug(mid, bat, bst);
    MX(re, bst);

    DandC(l,mid-1,ql, bat);
    DandC(mid+1,r,bat,qr);
}

signed main(){
    IOS();
    cin>>n>>M;
    vector<pii> hey;
    REP(i,n) {
        int a,b; cin>>a>>b;
        hey.pb({b,a});
    }
    sort(ALL(hey));
    REP(i,n) {
        pos[i] = hey[i].f;
        val[i] = hey[i].s;
    }

//    return 0;

    DandC(M-1,n-1,0,n-1);
    cout<<re<<endl;

}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 324 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 324 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 352 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 324 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 6 ms 588 KB Output is correct
39 Correct 7 ms 544 KB Output is correct
40 Correct 5 ms 716 KB Output is correct
41 Correct 5 ms 720 KB Output is correct
42 Correct 4 ms 716 KB Output is correct
43 Correct 6 ms 588 KB Output is correct
44 Correct 6 ms 588 KB Output is correct
45 Correct 7 ms 676 KB Output is correct
46 Correct 6 ms 716 KB Output is correct
47 Correct 7 ms 820 KB Output is correct
48 Correct 6 ms 716 KB Output is correct
49 Correct 7 ms 588 KB Output is correct
50 Correct 6 ms 592 KB Output is correct
51 Correct 6 ms 720 KB Output is correct
52 Correct 6 ms 676 KB Output is correct
53 Correct 6 ms 592 KB Output is correct
54 Correct 4 ms 716 KB Output is correct
55 Correct 4 ms 588 KB Output is correct
56 Correct 5 ms 588 KB Output is correct
57 Correct 4 ms 588 KB Output is correct
58 Correct 4 ms 588 KB Output is correct
59 Correct 2 ms 328 KB Output is correct
60 Correct 3 ms 460 KB Output is correct
61 Correct 2 ms 332 KB Output is correct
62 Correct 2 ms 460 KB Output is correct
63 Correct 3 ms 532 KB Output is correct
64 Correct 2 ms 460 KB Output is correct
65 Correct 6 ms 588 KB Output is correct
66 Correct 6 ms 588 KB Output is correct
67 Correct 6 ms 588 KB Output is correct
68 Correct 5 ms 588 KB Output is correct
69 Correct 6 ms 588 KB Output is correct
70 Correct 5 ms 588 KB Output is correct
71 Correct 6 ms 716 KB Output is correct
72 Correct 4 ms 588 KB Output is correct
73 Correct 5 ms 460 KB Output is correct
74 Correct 1 ms 460 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 324 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 324 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 352 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 324 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 6 ms 588 KB Output is correct
39 Correct 7 ms 544 KB Output is correct
40 Correct 5 ms 716 KB Output is correct
41 Correct 5 ms 720 KB Output is correct
42 Correct 4 ms 716 KB Output is correct
43 Correct 6 ms 588 KB Output is correct
44 Correct 6 ms 588 KB Output is correct
45 Correct 7 ms 676 KB Output is correct
46 Correct 6 ms 716 KB Output is correct
47 Correct 7 ms 820 KB Output is correct
48 Correct 6 ms 716 KB Output is correct
49 Correct 7 ms 588 KB Output is correct
50 Correct 6 ms 592 KB Output is correct
51 Correct 6 ms 720 KB Output is correct
52 Correct 6 ms 676 KB Output is correct
53 Correct 6 ms 592 KB Output is correct
54 Correct 4 ms 716 KB Output is correct
55 Correct 4 ms 588 KB Output is correct
56 Correct 5 ms 588 KB Output is correct
57 Correct 4 ms 588 KB Output is correct
58 Correct 4 ms 588 KB Output is correct
59 Correct 2 ms 328 KB Output is correct
60 Correct 3 ms 460 KB Output is correct
61 Correct 2 ms 332 KB Output is correct
62 Correct 2 ms 460 KB Output is correct
63 Correct 3 ms 532 KB Output is correct
64 Correct 2 ms 460 KB Output is correct
65 Correct 6 ms 588 KB Output is correct
66 Correct 6 ms 588 KB Output is correct
67 Correct 6 ms 588 KB Output is correct
68 Correct 5 ms 588 KB Output is correct
69 Correct 6 ms 588 KB Output is correct
70 Correct 5 ms 588 KB Output is correct
71 Correct 6 ms 716 KB Output is correct
72 Correct 4 ms 588 KB Output is correct
73 Correct 5 ms 460 KB Output is correct
74 Correct 1 ms 460 KB Output is correct
75 Correct 1244 ms 41116 KB Output is correct
76 Correct 1347 ms 29280 KB Output is correct
77 Correct 1427 ms 33736 KB Output is correct
78 Correct 1251 ms 34940 KB Output is correct
79 Correct 402 ms 29132 KB Output is correct
80 Correct 747 ms 38496 KB Output is correct
81 Correct 1773 ms 39644 KB Output is correct
82 Correct 1539 ms 41272 KB Output is correct
83 Correct 1633 ms 40708 KB Output is correct
84 Correct 1961 ms 41232 KB Output is correct
85 Correct 1678 ms 43024 KB Output is correct
86 Correct 1143 ms 29628 KB Output is correct
87 Correct 1352 ms 40388 KB Output is correct
88 Correct 1418 ms 39412 KB Output is correct
89 Correct 1658 ms 42948 KB Output is correct
90 Correct 1274 ms 30252 KB Output is correct
91 Correct 909 ms 38720 KB Output is correct
92 Correct 1059 ms 27868 KB Output is correct
93 Correct 1154 ms 39428 KB Output is correct
94 Correct 896 ms 38820 KB Output is correct
95 Correct 1397 ms 38912 KB Output is correct
96 Correct 233 ms 7904 KB Output is correct
97 Correct 255 ms 8368 KB Output is correct
98 Correct 237 ms 8756 KB Output is correct
99 Correct 244 ms 8484 KB Output is correct
100 Correct 223 ms 8200 KB Output is correct
101 Correct 223 ms 8148 KB Output is correct
102 Correct 1325 ms 40368 KB Output is correct
103 Correct 1178 ms 39692 KB Output is correct
104 Correct 1179 ms 40312 KB Output is correct
105 Correct 1074 ms 32752 KB Output is correct
106 Correct 995 ms 39728 KB Output is correct
107 Correct 881 ms 39440 KB Output is correct
108 Correct 1114 ms 33780 KB Output is correct
109 Correct 969 ms 39528 KB Output is correct
110 Correct 692 ms 41440 KB Output is correct
111 Correct 795 ms 39856 KB Output is correct
112 Correct 762 ms 17060 KB Output is correct
113 Correct 72 ms 11972 KB Output is correct