oj.uz

답안 #132856

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
132856 2019-07-19T19:16:45 Z doowey Cake 3 (JOI19_cake3) C++14
100 / 100
 1562 ms 20456 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll, ll> pii;
 
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
 
const int N = (int)2e5 + 9;
const ll inf = (ll)1e18;
vector<ll> best;
ll c[N];
ll v[N];
int m;

struct Node{
    ll cnt;
    ll sum;
};

Node T[N * 4 + 512];
int k;
void update(int node, int cl, int cr, int p, ll v){
    T[node].cnt += v;
    T[node].sum += v * 1ll * best[p];
    if(cl == cr){
        return;
    }
    int mid = (cl + cr) / 2;
    if(mid >= p)
        update(node * 2, cl, mid, p, v);
    else
        update(node * 2 + 1, mid + 1, cr, p, v);
}

ll ask(int node, int cl, int cr, int x){
    if(cl == cr){
        return best[cl] * x;
    }
    int mid = (cl + cr) / 2;
    if(T[node * 2 + 1].cnt >= x){
        return ask(node * 2 + 1, mid + 1, cr, x);
    }
    else{
        return ask(node * 2, cl, mid, x - T[node * 2 + 1].cnt) + T[node * 2 + 1].sum;
    }
}

int L = 0, R = -1;

void go(int l, int r){
    while(L < l){
        update(1, 0, k - 1, v[L], -1);
        L ++ ;
    }
    while(L > l){
        L -- ;
        update(1, 0, k - 1, v[L], +1);
    }
    while(R < r){
        R ++ ;
        update(1, 0, k - 1, v[R], +1);
    }
    while(R > r){
        update(1, 0, k - 1, v[R], -1);
        R -- ;
    }
}

ll res = -inf;

void solve(int cl, int cr, int optl, int optr){
    if(cl > cr)
        return;
    int mid = (cl + cr) / 2;
    ll cur=0;
    int opt = -1;
    ll bes = -inf;
    for(int i = optl ; i <= min(optr, mid - m + 1); i ++ ){
        go(i, mid);
        cur = ask(1, 0, k - 1, m) - (c[mid] - c[i]);
        res = max(res, cur);
        if(cur > bes){
            bes = cur;
            opt = i;
        }
    }
    solve(cl, mid - 1, optl, opt);
    solve(mid + 1, cr, opt, optr);
}

int main(){
    fastIO;
    int n;
    cin >> n >> m;
    pii vv[n];
    for(int i = 0 ; i < n; i ++ ){
        cin >> vv[i].se >> vv[i].fi;
        vv[i].fi *= 2ll;
        best.push_back(vv[i].se);
    }
    sort(best.begin(), best.end());
    best.resize(unique(best.begin(), best.end()) - best.begin());
    k = best.size();
    sort(vv, vv + n);
    for(int i = 0 ; i < n; i ++ ){
        c[i] = vv[i].fi;
        v[i] = lower_bound(best.begin(), best.end(), vv[i].se) - best.begin();
    }
    solve(m - 1, n - 1, 0, n - 1);
    cout << res << "\n";
    return 0;   
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 380 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 380 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 420 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 3 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 7 ms 504 KB Output is correct
39 Correct 7 ms 504 KB Output is correct
40 Correct 7 ms 504 KB Output is correct
41 Correct 6 ms 504 KB Output is correct
42 Correct 5 ms 504 KB Output is correct
43 Correct 5 ms 504 KB Output is correct
44 Correct 7 ms 504 KB Output is correct
45 Correct 7 ms 504 KB Output is correct
46 Correct 7 ms 476 KB Output is correct
47 Correct 7 ms 504 KB Output is correct
48 Correct 8 ms 504 KB Output is correct
49 Correct 6 ms 520 KB Output is correct
50 Correct 6 ms 504 KB Output is correct
51 Correct 6 ms 504 KB Output is correct
52 Correct 6 ms 504 KB Output is correct
53 Correct 5 ms 504 KB Output is correct
54 Correct 4 ms 504 KB Output is correct
55 Correct 4 ms 504 KB Output is correct
56 Correct 4 ms 504 KB Output is correct
57 Correct 4 ms 504 KB Output is correct
58 Correct 4 ms 504 KB Output is correct
59 Correct 3 ms 504 KB Output is correct
60 Correct 3 ms 504 KB Output is correct
61 Correct 3 ms 420 KB Output is correct
62 Correct 3 ms 504 KB Output is correct
63 Correct 3 ms 504 KB Output is correct
64 Correct 3 ms 504 KB Output is correct
65 Correct 7 ms 508 KB Output is correct
66 Correct 6 ms 592 KB Output is correct
67 Correct 7 ms 504 KB Output is correct
68 Correct 6 ms 632 KB Output is correct
69 Correct 5 ms 504 KB Output is correct
70 Correct 6 ms 504 KB Output is correct
71 Correct 4 ms 504 KB Output is correct
72 Correct 3 ms 504 KB Output is correct
73 Correct 6 ms 504 KB Output is correct
74 Correct 3 ms 476 KB Output is correct
75 Correct 1276 ms 19532 KB Output is correct
76 Correct 1562 ms 19300 KB Output is correct
77 Correct 1073 ms 19560 KB Output is correct
78 Correct 1344 ms 19816 KB Output is correct
79 Correct 176 ms 19816 KB Output is correct
80 Correct 256 ms 19560 KB Output is correct
81 Correct 765 ms 11752 KB Output is correct
82 Correct 1038 ms 12908 KB Output is correct
83 Correct 896 ms 12268 KB Output is correct
84 Correct 1046 ms 13288 KB Output is correct
85 Correct 804 ms 11880 KB Output is correct
86 Correct 409 ms 11368 KB Output is correct
87 Correct 441 ms 11368 KB Output is correct
88 Correct 698 ms 11240 KB Output is correct
89 Correct 620 ms 11880 KB Output is correct
90 Correct 426 ms 12264 KB Output is correct
91 Correct 280 ms 10860 KB Output is correct
92 Correct 289 ms 10856 KB Output is correct
93 Correct 339 ms 11368 KB Output is correct
94 Correct 244 ms 11752 KB Output is correct
95 Correct 404 ms 12264 KB Output is correct
96 Correct 95 ms 10476 KB Output is correct
97 Correct 103 ms 11240 KB Output is correct
98 Correct 103 ms 10988 KB Output is correct
99 Correct 99 ms 11112 KB Output is correct
100 Correct 90 ms 10508 KB Output is correct
101 Correct 92 ms 10472 KB Output is correct
102 Correct 539 ms 10600 KB Output is correct
103 Correct 531 ms 10472 KB Output is correct
104 Correct 595 ms 11112 KB Output is correct
105 Correct 419 ms 10984 KB Output is correct
106 Correct 431 ms 11368 KB Output is correct
107 Correct 380 ms 11008 KB Output is correct
108 Correct 1102 ms 19688 KB Output is correct
109 Correct 849 ms 20172 KB Output is correct
110 Correct 136 ms 9960 KB Output is correct
111 Correct 178 ms 10128 KB Output is correct
112 Correct 586 ms 17900 KB Output is correct
113 Correct 184 ms 20456 KB Output is correct