oj.uz

답안 #674097

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
674097 2022-12-23T03:45:55 Z Cookie Cake 3 (JOI19_cake3) C++14
100 / 100
 524 ms 10772 KB 
#include<bits/stdc++.h>

#include<fstream>
//#include "factories.h"

using namespace std;
ifstream fin("sus.in");
ofstream fout("sus.out");
#define ll long long
#define vt vector
#define pb push_back
#define fi first
#define se second
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define pii pair<int, int>
#define pll pair<ll, ll>
const int x[4] = {1, -1, 0, 0};
const int y[4] = {0, 0, 1, -1};
#define int long long
const int mxn = 3e5, mxv = 1e6;
int n, m, l = 0, r = 0;
ll d[mxn + 1];
vt<ll>b;
struct th{
    ll v, c;
    bool operator <(const th &b){
        return(c < b.c);
    }
};
struct BIT{
    ll bit[mxn + 1];
    void upd(int p, ll v){
        p--;
        while(p <= mxn) {
            bit[p] += v; p |= (p + 1);
        }
    }
    ll get(int p){
        ll ans = 0;
        while(p){
            ans += bit[p - 1]; p &= (p - 1);
        }
        return(ans);
    }
    int kth(int x){
        int pos = 0;
        for(int i = (1 << 17); i; i >>= 1){
            if(pos + i <= mxn && bit[pos + i - 1] < x){
                pos += i; x -= bit[pos - 1];
            }
        }
        return(pos);
    }
};
BIT sm, cnt;
th a[mxn + 1];
void add(int x){
    //cout << a[x].v << " ";
    cnt.upd(a[x].v, 1); sm.upd(a[x].v, b[a[x].v - 1]);
}
void rem(int x){
    cnt.upd(a[x].v, -1); sm.upd(a[x].v, -b[a[x].v - 1]);
}
ll get(){
    int p = cnt.kth(m) + 1; assert(p < mxn);
    ll ans = sm.get(p - 1), lft = m - cnt.get(p - 1); 
    ans += b[p - 1] * lft; 
    //cout << ans << " ";
    return(ans);
}
void solve(int le, int ri, int bestl, int bestr){
    
    if(le > ri)return;
    int mid = (le + ri) >> 1;
    
    while(l > mid)add(--l);
    while(l < mid)rem(l++);
    ll pos = bestr, val = -1e18;
    
    for(int i = bestl; i <= bestr; i++){
        if(i - mid + 1 < m)continue;
        while(r < i)add(++r); while(r > i)rem(r--);
        ll cr = get() -2 * (a[i].c - a[mid].c);
        //cout << l << ' ' << r << " " << get() << "\n";
        if(cr > val){
            val = cr; pos = i;
        }
    }
    
    //cout << pos << ' ';
    d[mid] = val;
    solve(le, mid - 1, bestl, pos); 
    solve(mid + 1, ri, pos, bestr);
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    forr(i, 0, n){
        cin >> a[i].v >> a[i].c;
        b.pb(a[i].v);
    }
    sort(b.rbegin(), b.rend());
    for(int i = 0; i < n; i++){
        
        int le = 0, ri = b.size() - 1, res;
        while(le <= ri){
            int mid = (le + ri) >> 1;
            if(b[mid] >= a[i].v){
                res = mid; le = mid + 1;
            }else{
                ri = mid - 1;
            }
        }
        a[i].v = res + 1;
        
    }
    
    sort(a, a + n);
    add(0);
    solve(0, n - 1, 0, n - 1);
    ll ans = -1e18;
    for(int i = 0; i + m - 1 < n; i++){
        
        //cout << d[i] << " ";
         ans = max(ans, d[i]);
    }
    cout << ans;
}

Compilation message

cake3.cpp: In function 'void solve(long long int, long long int, long long int, long long int)':
cake3.cpp:83:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   83 |         while(r < i)add(++r); while(r > i)rem(r--);
      |         ^~~~~
cake3.cpp:83:31: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   83 |         while(r < i)add(++r); while(r > i)rem(r--);
      |                               ^~~~~
cake3.cpp: In function 'int main()':
cake3.cpp:115:22: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
  115 |         a[i].v = res + 1;
      |                  ~~~~^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 348 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 348 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 1 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 1 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 1 ms 344 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 344 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 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 348 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 348 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 1 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 1 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 1 ms 344 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 3 ms 488 KB Output is correct
39 Correct 4 ms 468 KB Output is correct
40 Correct 3 ms 468 KB Output is correct
41 Correct 3 ms 468 KB Output is correct
42 Correct 3 ms 552 KB Output is correct
43 Correct 3 ms 468 KB Output is correct
44 Correct 4 ms 468 KB Output is correct
45 Correct 4 ms 480 KB Output is correct
46 Correct 4 ms 556 KB Output is correct
47 Correct 4 ms 468 KB Output is correct
48 Correct 4 ms 468 KB Output is correct
49 Correct 3 ms 524 KB Output is correct
50 Correct 4 ms 488 KB Output is correct
51 Correct 3 ms 468 KB Output is correct
52 Correct 4 ms 468 KB Output is correct
53 Correct 4 ms 480 KB Output is correct
54 Correct 3 ms 468 KB Output is correct
55 Correct 3 ms 468 KB Output is correct
56 Correct 3 ms 468 KB Output is correct
57 Correct 3 ms 468 KB Output is correct
58 Correct 3 ms 424 KB Output is correct
59 Correct 2 ms 488 KB Output is correct
60 Correct 2 ms 468 KB Output is correct
61 Correct 2 ms 468 KB Output is correct
62 Correct 2 ms 484 KB Output is correct
63 Correct 2 ms 468 KB Output is correct
64 Correct 4 ms 488 KB Output is correct
65 Correct 4 ms 480 KB Output is correct
66 Correct 4 ms 480 KB Output is correct
67 Correct 4 ms 524 KB Output is correct
68 Correct 4 ms 468 KB Output is correct
69 Correct 3 ms 468 KB Output is correct
70 Correct 3 ms 480 KB Output is correct
71 Correct 3 ms 468 KB Output is correct
72 Correct 2 ms 524 KB Output is correct
73 Correct 4 ms 468 KB Output is correct
74 Correct 2 ms 468 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 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 348 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 348 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 1 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 1 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 1 ms 344 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 3 ms 488 KB Output is correct
39 Correct 4 ms 468 KB Output is correct
40 Correct 3 ms 468 KB Output is correct
41 Correct 3 ms 468 KB Output is correct
42 Correct 3 ms 552 KB Output is correct
43 Correct 3 ms 468 KB Output is correct
44 Correct 4 ms 468 KB Output is correct
45 Correct 4 ms 480 KB Output is correct
46 Correct 4 ms 556 KB Output is correct
47 Correct 4 ms 468 KB Output is correct
48 Correct 4 ms 468 KB Output is correct
49 Correct 3 ms 524 KB Output is correct
50 Correct 4 ms 488 KB Output is correct
51 Correct 3 ms 468 KB Output is correct
52 Correct 4 ms 468 KB Output is correct
53 Correct 4 ms 480 KB Output is correct
54 Correct 3 ms 468 KB Output is correct
55 Correct 3 ms 468 KB Output is correct
56 Correct 3 ms 468 KB Output is correct
57 Correct 3 ms 468 KB Output is correct
58 Correct 3 ms 424 KB Output is correct
59 Correct 2 ms 488 KB Output is correct
60 Correct 2 ms 468 KB Output is correct
61 Correct 2 ms 468 KB Output is correct
62 Correct 2 ms 484 KB Output is correct
63 Correct 2 ms 468 KB Output is correct
64 Correct 4 ms 488 KB Output is correct
65 Correct 4 ms 480 KB Output is correct
66 Correct 4 ms 480 KB Output is correct
67 Correct 4 ms 524 KB Output is correct
68 Correct 4 ms 468 KB Output is correct
69 Correct 3 ms 468 KB Output is correct
70 Correct 3 ms 480 KB Output is correct
71 Correct 3 ms 468 KB Output is correct
72 Correct 2 ms 524 KB Output is correct
73 Correct 4 ms 468 KB Output is correct
74 Correct 2 ms 468 KB Output is correct
75 Correct 454 ms 9996 KB Output is correct
76 Correct 485 ms 9748 KB Output is correct
77 Correct 475 ms 10024 KB Output is correct
78 Correct 524 ms 10088 KB Output is correct
79 Correct 164 ms 10212 KB Output is correct
80 Correct 186 ms 9904 KB Output is correct
81 Correct 418 ms 10080 KB Output is correct
82 Correct 523 ms 10224 KB Output is correct
83 Correct 487 ms 10528 KB Output is correct
84 Correct 490 ms 10484 KB Output is correct
85 Correct 469 ms 10200 KB Output is correct
86 Correct 274 ms 9852 KB Output is correct
87 Correct 291 ms 9716 KB Output is correct
88 Correct 421 ms 9712 KB Output is correct
89 Correct 412 ms 10104 KB Output is correct
90 Correct 302 ms 10572 KB Output is correct
91 Correct 229 ms 9924 KB Output is correct
92 Correct 228 ms 9836 KB Output is correct
93 Correct 259 ms 10168 KB Output is correct
94 Correct 217 ms 10560 KB Output is correct
95 Correct 279 ms 10668 KB Output is correct
96 Correct 156 ms 7128 KB Output is correct
97 Correct 170 ms 7548 KB Output is correct
98 Correct 155 ms 7376 KB Output is correct
99 Correct 187 ms 7372 KB Output is correct
100 Correct 142 ms 7056 KB Output is correct
101 Correct 136 ms 7104 KB Output is correct
102 Correct 368 ms 10052 KB Output is correct
103 Correct 355 ms 9940 KB Output is correct
104 Correct 413 ms 10316 KB Output is correct
105 Correct 326 ms 10296 KB Output is correct
106 Correct 334 ms 10492 KB Output is correct
107 Correct 284 ms 10132 KB Output is correct
108 Correct 387 ms 10104 KB Output is correct
109 Correct 332 ms 10692 KB Output is correct
110 Correct 187 ms 7360 KB Output is correct
111 Correct 250 ms 7600 KB Output is correct
112 Correct 408 ms 9784 KB Output is correct
113 Correct 174 ms 10772 KB Output is correct