oj.uz

답안 #796988

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
796988 2023-07-29T03:02:07 Z ThMinh_ Cake 3 (JOI19_cake3) C++14
100 / 100
 825 ms 206280 KB 
#include<bits/stdc++.h>
#define forin(i, a, b) for(int i = a; i <= b; ++i)
#define ll long long
using namespace std;
const int N = 2e5 + 10;
int n, m;
ll ans, inf = 2e18;
ll s[N];
struct it {
    int cnt;
    ll sum;
    it* lf;
    it* rt;
    it() : cnt(), sum(), lf(), rt() { }
    void build(int f = 1, int l = n) {
        if(f == l) return;
        int mid = f + l >> 1;
        lf = new it();
        rt = new it();
        lf -> build(f, mid);
        rt -> build(mid + 1, l);
    }
    void up(int i, ll val, int f = 1, int l = n) {
        if(f == l) {
            cnt = 1;
            sum = val;
            return;
        }
        int mid = f + l >> 1;
        if(i <= mid) {
            lf = new it(*lf);
            lf -> up(i, val, f, mid);
        }
        else {
            rt = new it(*rt);
            rt -> up(i, val, mid + 1, l);
        }
        sum = cnt = 0;
        if(lf) sum += lf -> sum, cnt += lf -> cnt;
        if(rt) sum += rt -> sum, cnt += rt -> cnt;
    }
};
ll sum(it* id) {
    return id -> sum;
}
int cnt(it* id) {
    return id -> cnt;
}
ll get(it* id1, it* id2, int f = 1, int l = n, int k = m - 2) {
    if(f == l) return sum(id2) - sum(id1);
    int mid = f + l >> 1;
    int res = cnt(id2 -> rt) - cnt(id1 -> rt);
    ll val = sum(id2 -> rt) - sum(id1 -> rt);
    if(res < k) return val + get(id1 -> lf, id2 -> lf, f, mid, k - res);
    return get(id1 -> rt, id2 -> rt, mid + 1, l, k);
}
struct piece {
    ll v, c;
    int pos;
};
piece p[N];
vector<it*> tr;
void solve(int from = 1, int to = n, int f = 1, int l = n) {
    if(f > l) return;
    int mid = f + l >> 1, nxt = 0;
    ll &a = s[mid];
    forin(i, from, min(to, mid)) {
        ll val = -1e18;
        if(mid - i + 1 >= m) {
            val = get(tr[i], tr[mid - 1]) + p[mid].v + p[i].v - 2 * (p[mid].c - p[i].c);
        }
        if(a < val) {
            a = val;
            nxt = i;
        }
    }
    solve(from, nxt, f, mid - 1);
    solve(nxt, to, mid + 1, l);
}
int main () {
    cin.tie(0)->sync_with_stdio(0);
    if(fopen("Task.inp","r")) {
        freopen("Task.inp","r",stdin);
        freopen("WA.out","w",stdout);
    }
    cin>>n>>m;
    forin(i, 1, n) cin>>p[i].v>>p[i].c;
    sort(p + 1, p + n + 1, [] (piece a, piece b) {
        return a.v < b.v;
    });
    forin(i, 1, n) p[i].pos = i;
    sort(p + 1, p + n + 1, [] (piece a, piece b) {
        return a.c < b.c;
    });
    tr.resize(n + 1);
    tr[0] = new it();
    tr[0] -> build();
    forin(i, 1, n) {
        tr[i] = new it(*tr[i - 1]);
        tr[i] -> up(p[i].pos, p[i].v);
        s[i] = -inf;
    }
    solve();
    ans = -inf;
    forin(i, 1, n) ans = max(ans, s[i]);
    cout<<ans;
}

Compilation message

cake3.cpp: In member function 'void it::build(int, int)':
cake3.cpp:17:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   17 |         int mid = f + l >> 1;
      |                   ~~^~~
cake3.cpp: In member function 'void it::up(int, long long int, int, int)':
cake3.cpp:29:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   29 |         int mid = f + l >> 1;
      |                   ~~^~~
cake3.cpp: In function 'long long int get(it*, it*, int, int, int)':
cake3.cpp:51:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   51 |     int mid = f + l >> 1;
      |               ~~^~~
cake3.cpp: In function 'void solve(int, int, int, int)':
cake3.cpp:65:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |     int mid = f + l >> 1, nxt = 0;
      |               ~~^~~
cake3.cpp: In function 'int main()':
cake3.cpp:83:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |         freopen("Task.inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
cake3.cpp:84:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |         freopen("WA.out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

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 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 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 0 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 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 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 0 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 1 ms 340 KB Output is correct
37 Correct 0 ms 340 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 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 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 0 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 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 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 0 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 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 3 ms 1620 KB Output is correct
39 Correct 3 ms 1620 KB Output is correct
40 Correct 2 ms 1620 KB Output is correct
41 Correct 2 ms 1492 KB Output is correct
42 Correct 2 ms 1620 KB Output is correct
43 Correct 2 ms 1492 KB Output is correct
44 Correct 2 ms 1492 KB Output is correct
45 Correct 3 ms 1620 KB Output is correct
46 Correct 3 ms 1620 KB Output is correct
47 Correct 3 ms 1620 KB Output is correct
48 Correct 2 ms 1492 KB Output is correct
49 Correct 2 ms 1620 KB Output is correct
50 Correct 2 ms 1620 KB Output is correct
51 Correct 2 ms 1620 KB Output is correct
52 Correct 2 ms 1620 KB Output is correct
53 Correct 2 ms 1620 KB Output is correct
54 Correct 2 ms 1620 KB Output is correct
55 Correct 2 ms 1620 KB Output is correct
56 Correct 2 ms 1620 KB Output is correct
57 Correct 2 ms 1620 KB Output is correct
58 Correct 2 ms 1620 KB Output is correct
59 Correct 2 ms 1492 KB Output is correct
60 Correct 3 ms 1620 KB Output is correct
61 Correct 2 ms 1620 KB Output is correct
62 Correct 2 ms 1620 KB Output is correct
63 Correct 2 ms 1620 KB Output is correct
64 Correct 2 ms 1620 KB Output is correct
65 Correct 2 ms 1620 KB Output is correct
66 Correct 2 ms 1620 KB Output is correct
67 Correct 2 ms 1620 KB Output is correct
68 Correct 2 ms 1620 KB Output is correct
69 Correct 2 ms 1620 KB Output is correct
70 Correct 2 ms 1620 KB Output is correct
71 Correct 2 ms 1620 KB Output is correct
72 Correct 2 ms 1620 KB Output is correct
73 Correct 2 ms 1620 KB Output is correct
74 Correct 2 ms 1620 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 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 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 0 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 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 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 0 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 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 3 ms 1620 KB Output is correct
39 Correct 3 ms 1620 KB Output is correct
40 Correct 2 ms 1620 KB Output is correct
41 Correct 2 ms 1492 KB Output is correct
42 Correct 2 ms 1620 KB Output is correct
43 Correct 2 ms 1492 KB Output is correct
44 Correct 2 ms 1492 KB Output is correct
45 Correct 3 ms 1620 KB Output is correct
46 Correct 3 ms 1620 KB Output is correct
47 Correct 3 ms 1620 KB Output is correct
48 Correct 2 ms 1492 KB Output is correct
49 Correct 2 ms 1620 KB Output is correct
50 Correct 2 ms 1620 KB Output is correct
51 Correct 2 ms 1620 KB Output is correct
52 Correct 2 ms 1620 KB Output is correct
53 Correct 2 ms 1620 KB Output is correct
54 Correct 2 ms 1620 KB Output is correct
55 Correct 2 ms 1620 KB Output is correct
56 Correct 2 ms 1620 KB Output is correct
57 Correct 2 ms 1620 KB Output is correct
58 Correct 2 ms 1620 KB Output is correct
59 Correct 2 ms 1492 KB Output is correct
60 Correct 3 ms 1620 KB Output is correct
61 Correct 2 ms 1620 KB Output is correct
62 Correct 2 ms 1620 KB Output is correct
63 Correct 2 ms 1620 KB Output is correct
64 Correct 2 ms 1620 KB Output is correct
65 Correct 2 ms 1620 KB Output is correct
66 Correct 2 ms 1620 KB Output is correct
67 Correct 2 ms 1620 KB Output is correct
68 Correct 2 ms 1620 KB Output is correct
69 Correct 2 ms 1620 KB Output is correct
70 Correct 2 ms 1620 KB Output is correct
71 Correct 2 ms 1620 KB Output is correct
72 Correct 2 ms 1620 KB Output is correct
73 Correct 2 ms 1620 KB Output is correct
74 Correct 2 ms 1620 KB Output is correct
75 Correct 767 ms 187700 KB Output is correct
76 Correct 825 ms 182348 KB Output is correct
77 Correct 674 ms 188152 KB Output is correct
78 Correct 712 ms 191180 KB Output is correct
79 Correct 284 ms 191916 KB Output is correct
80 Correct 295 ms 186020 KB Output is correct
81 Correct 542 ms 189996 KB Output is correct
82 Correct 675 ms 192656 KB Output is correct
83 Correct 663 ms 199372 KB Output is correct
84 Correct 652 ms 198836 KB Output is correct
85 Correct 554 ms 191752 KB Output is correct
86 Correct 359 ms 184892 KB Output is correct
87 Correct 363 ms 182376 KB Output is correct
88 Correct 480 ms 180976 KB Output is correct
89 Correct 466 ms 191852 KB Output is correct
90 Correct 389 ms 201160 KB Output is correct
91 Correct 319 ms 185188 KB Output is correct
92 Correct 320 ms 183600 KB Output is correct
93 Correct 358 ms 192172 KB Output is correct
94 Correct 330 ms 200908 KB Output is correct
95 Correct 381 ms 201464 KB Output is correct
96 Correct 485 ms 186184 KB Output is correct
97 Correct 539 ms 201860 KB Output is correct
98 Correct 549 ms 198684 KB Output is correct
99 Correct 488 ms 199184 KB Output is correct
100 Correct 433 ms 187212 KB Output is correct
101 Correct 437 ms 187192 KB Output is correct
102 Correct 649 ms 187468 KB Output is correct
103 Correct 573 ms 184456 KB Output is correct
104 Correct 636 ms 198128 KB Output is correct
105 Correct 452 ms 197324 KB Output is correct
106 Correct 528 ms 202796 KB Output is correct
107 Correct 484 ms 195276 KB Output is correct
108 Correct 691 ms 193728 KB Output is correct
109 Correct 585 ms 205900 KB Output is correct
110 Correct 317 ms 190668 KB Output is correct
111 Correct 369 ms 192924 KB Output is correct
112 Correct 595 ms 183676 KB Output is correct
113 Correct 311 ms 206280 KB Output is correct