oj.uz

답안 #488236

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
488236 2021-11-18T09:10:06 Z balbit Cake 3 (JOI19_cake3) C++14
100 / 100
 3562 ms 19848 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;
multiset<int> top; // the top <=M best cakess
multiset<int> backup; // remaining cakes
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 add(int p) {
    AAA(p>=0);
    now += val[p];
    top.insert(val[p]);
    if (SZ(top) > M) {
        now -= *top.begin();
        backup.insert(*top.begin());
        top.erase(top.begin());
    }
}

void del(int p) {
    AAA(p>=0);
    if (SZ(backup) && (*backup.rbegin() >= val[p])){
        // remove from backup
        backup.erase(backup.find(val[p]));
    }else{
        AAA(SZ(top));
        now -= val[p];
        top.erase(top.find(val[p]));
        if (SZ(backup)) {
            now += *backup.rbegin();
            top.insert(*backup.rbegin());
            backup.erase(prev(backup.end()));
        }
    }
}

inline ll gat() {
    if (SZ(top) < M) 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 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 0 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 0 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 0 ms 336 KB Output is correct
30 Correct 0 ms 336 KB Output is correct
31 Correct 1 ms 324 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 0 ms 336 KB Output is correct
36 Correct 0 ms 336 KB Output is correct
37 Correct 0 ms 336 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 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 0 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 0 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 0 ms 336 KB Output is correct
30 Correct 0 ms 336 KB Output is correct
31 Correct 1 ms 324 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 0 ms 336 KB Output is correct
36 Correct 0 ms 336 KB Output is correct
37 Correct 0 ms 336 KB Output is correct
38 Correct 7 ms 464 KB Output is correct
39 Correct 8 ms 420 KB Output is correct
40 Correct 6 ms 528 KB Output is correct
41 Correct 8 ms 464 KB Output is correct
42 Correct 5 ms 464 KB Output is correct
43 Correct 5 ms 464 KB Output is correct
44 Correct 7 ms 464 KB Output is correct
45 Correct 7 ms 464 KB Output is correct
46 Correct 7 ms 464 KB Output is correct
47 Correct 7 ms 464 KB Output is correct
48 Correct 7 ms 464 KB Output is correct
49 Correct 7 ms 476 KB Output is correct
50 Correct 7 ms 496 KB Output is correct
51 Correct 6 ms 464 KB Output is correct
52 Correct 6 ms 464 KB Output is correct
53 Correct 6 ms 500 KB Output is correct
54 Correct 5 ms 464 KB Output is correct
55 Correct 5 ms 464 KB Output is correct
56 Correct 5 ms 464 KB Output is correct
57 Correct 6 ms 464 KB Output is correct
58 Correct 5 ms 464 KB Output is correct
59 Correct 4 ms 464 KB Output is correct
60 Correct 5 ms 464 KB Output is correct
61 Correct 4 ms 464 KB Output is correct
62 Correct 5 ms 464 KB Output is correct
63 Correct 5 ms 464 KB Output is correct
64 Correct 5 ms 496 KB Output is correct
65 Correct 7 ms 488 KB Output is correct
66 Correct 8 ms 464 KB Output is correct
67 Correct 8 ms 464 KB Output is correct
68 Correct 7 ms 464 KB Output is correct
69 Correct 7 ms 476 KB Output is correct
70 Correct 6 ms 464 KB Output is correct
71 Correct 7 ms 472 KB Output is correct
72 Correct 5 ms 464 KB Output is correct
73 Correct 5 ms 464 KB Output is correct
74 Correct 1 ms 464 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 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 0 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 0 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 0 ms 336 KB Output is correct
30 Correct 0 ms 336 KB Output is correct
31 Correct 1 ms 324 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 0 ms 336 KB Output is correct
36 Correct 0 ms 336 KB Output is correct
37 Correct 0 ms 336 KB Output is correct
38 Correct 7 ms 464 KB Output is correct
39 Correct 8 ms 420 KB Output is correct
40 Correct 6 ms 528 KB Output is correct
41 Correct 8 ms 464 KB Output is correct
42 Correct 5 ms 464 KB Output is correct
43 Correct 5 ms 464 KB Output is correct
44 Correct 7 ms 464 KB Output is correct
45 Correct 7 ms 464 KB Output is correct
46 Correct 7 ms 464 KB Output is correct
47 Correct 7 ms 464 KB Output is correct
48 Correct 7 ms 464 KB Output is correct
49 Correct 7 ms 476 KB Output is correct
50 Correct 7 ms 496 KB Output is correct
51 Correct 6 ms 464 KB Output is correct
52 Correct 6 ms 464 KB Output is correct
53 Correct 6 ms 500 KB Output is correct
54 Correct 5 ms 464 KB Output is correct
55 Correct 5 ms 464 KB Output is correct
56 Correct 5 ms 464 KB Output is correct
57 Correct 6 ms 464 KB Output is correct
58 Correct 5 ms 464 KB Output is correct
59 Correct 4 ms 464 KB Output is correct
60 Correct 5 ms 464 KB Output is correct
61 Correct 4 ms 464 KB Output is correct
62 Correct 5 ms 464 KB Output is correct
63 Correct 5 ms 464 KB Output is correct
64 Correct 5 ms 496 KB Output is correct
65 Correct 7 ms 488 KB Output is correct
66 Correct 8 ms 464 KB Output is correct
67 Correct 8 ms 464 KB Output is correct
68 Correct 7 ms 464 KB Output is correct
69 Correct 7 ms 476 KB Output is correct
70 Correct 6 ms 464 KB Output is correct
71 Correct 7 ms 472 KB Output is correct
72 Correct 5 ms 464 KB Output is correct
73 Correct 5 ms 464 KB Output is correct
74 Correct 1 ms 464 KB Output is correct
75 Correct 3320 ms 18656 KB Output is correct
76 Correct 3501 ms 18100 KB Output is correct
77 Correct 3409 ms 18480 KB Output is correct
78 Correct 3562 ms 18824 KB Output is correct
79 Correct 932 ms 18920 KB Output is correct
80 Correct 1873 ms 18528 KB Output is correct
81 Correct 2801 ms 15112 KB Output is correct
82 Correct 2698 ms 14644 KB Output is correct
83 Correct 3094 ms 15660 KB Output is correct
84 Correct 2969 ms 15412 KB Output is correct
85 Correct 2674 ms 15284 KB Output is correct
86 Correct 2393 ms 15548 KB Output is correct
87 Correct 2277 ms 15232 KB Output is correct
88 Correct 2494 ms 14580 KB Output is correct
89 Correct 2804 ms 15672 KB Output is correct
90 Correct 2520 ms 17004 KB Output is correct
91 Correct 2362 ms 16180 KB Output is correct
92 Correct 2293 ms 16016 KB Output is correct
93 Correct 2593 ms 16424 KB Output is correct
94 Correct 2592 ms 17828 KB Output is correct
95 Correct 2610 ms 16928 KB Output is correct
96 Correct 927 ms 14640 KB Output is correct
97 Correct 1025 ms 15800 KB Output is correct
98 Correct 1040 ms 15496 KB Output is correct
99 Correct 972 ms 15908 KB Output is correct
100 Correct 858 ms 15412 KB Output is correct
101 Correct 879 ms 15288 KB Output is correct
102 Correct 1911 ms 14288 KB Output is correct
103 Correct 1802 ms 14388 KB Output is correct
104 Correct 1948 ms 14644 KB Output is correct
105 Correct 1828 ms 15668 KB Output is correct
106 Correct 1971 ms 16060 KB Output is correct
107 Correct 1738 ms 15872 KB Output is correct
108 Correct 3035 ms 18540 KB Output is correct
109 Correct 3278 ms 19744 KB Output is correct
110 Correct 1629 ms 14900 KB Output is correct
111 Correct 1764 ms 13944 KB Output is correct
112 Correct 1012 ms 16544 KB Output is correct
113 Correct 172 ms 19848 KB Output is correct