oj.uz

Submission #747576

# Submission time Handle Problem Language Result Execution time Memory
747576 2023-05-24T10:56:37 Z nguyentunglam Cake 3 (JOI19_cake3) C++17
100 / 100
 876 ms 203332 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;
const int N = 2e5 + 10;
pair<int, int> a[N];
int n, m;
long long ans = -2e18;

struct node {
    node * left;
    node * right;
    int cnt;
    long long sum;
    node () : cnt(0), sum(0), left(nullptr), right(nullptr) {}
};

void build(node *p, int l, int r) {
    if (l == r) return;
    int mid = l + r >> 1;
    p -> left = new node(); p -> right = new node();
    build(p -> left, l, mid);
    build(p -> right, mid + 1, r);
}

void up(node *p, int l, int r, int pos, int val) {
    if (l == r) {
        p -> sum += val;
        p -> cnt ++;
        return;
    }
    int mid = l + r >> 1;
    if (pos <= mid) {
        p -> left = new node(*p -> left);
        up(p -> left, l, mid, pos, val);
    }
    else {
        p -> right = new node(*p -> right);
        up(p -> right, mid + 1, r, pos, val);
    }
    p -> sum = p -> left -> sum + p -> right -> sum;
    p -> cnt = p -> left -> cnt + p -> right -> cnt;
}

long long query(node *p1, node *p2, int l, int r, int k) {
    if (l == r) return p2 -> sum - p1 -> sum;
    int tmp = p2 -> right -> cnt - p1 -> right -> cnt;
    int mid = l + r >> 1;
    if (k > tmp) return p2 -> right -> sum - p1 -> right -> sum + query(p1 -> left, p2 -> left, l, mid, k - tmp);
    return query(p1 -> right, p2 -> right, mid + 1, r, k);
}

node * it[N];

long long calc(int i, int j) {
    if (j - i + 1 < m) return -1e18;
    long long tmp = a[i].first + a[j].first;
    if (m - 2 > 0) tmp += query(it[i], it[j - 1], 1, n, m - 2);
    return tmp - (a[j].second - a[i].second) * 2;
}
void solve(int l, int r, int from, int to) {
    if (l > r) return;
    int mid = l + r >> 1;
    long long f = -2e18, g = 0;
    for(int j = from; j <= to && j <= mid; j++) {
        long long tmp = calc(j, mid);
        if (tmp > f) {
            f = tmp;
            g = j;
        }
    }
    ans = max(ans, f);
    solve(l, mid - 1, from, g);
    solve(mid + 1, r, g, to);
}
int main() {
    #define task ""
    cin.tie(0) -> sync_with_stdio(0);
    if (fopen ("task.inp", "r")) {
        freopen ("task.inp", "r", stdin);
        freopen ("task.out", "w", stdout);
    }
    if (fopen (task".inp", "r")) {
        freopen (task".inp", "r", stdin);
        freopen (task".out", "w", stdout);
    }
    cin >> n >> m;
    vector<ii> rrh;
    for(int i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;
    sort(a + 1, a + n + 1, [] (const ii &x, const ii &y) {
         return x.se < y.se;
         });
    for(int i = 1; i <= n; i++)  rrh.emplace_back(a[i].first, i);
    sort(rrh.begin(), rrh.end());
    it[0] = new node(); build(it[0], 1, n);

    for(int i = 1; i <= n; i++) {
        it[i] = new node(*it[i - 1]);
        up(it[i], 1, n, upper_bound(rrh.begin(), rrh.end(), make_pair(a[i].first, i)) - rrh.begin(), a[i].first);
    }
    solve(1, n, 1, n);
    cout << ans;
}

Compilation message

cake3.cpp: In constructor 'node::node()':
cake3.cpp:16:15: warning: 'node::sum' will be initialized after [-Wreorder]
   16 |     long long sum;
      |               ^~~
cake3.cpp:13:12: warning:   'node* node::left' [-Wreorder]
   13 |     node * left;
      |            ^~~~
cake3.cpp:17:5: warning:   when initialized here [-Wreorder]
   17 |     node () : cnt(0), sum(0), left(nullptr), right(nullptr) {}
      |     ^~~~
cake3.cpp: In function 'void build(node*, int, int)':
cake3.cpp:22:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   22 |     int mid = l + r >> 1;
      |               ~~^~~
cake3.cpp: In function 'void up(node*, int, int, int, int)':
cake3.cpp:34:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   34 |     int mid = l + r >> 1;
      |               ~~^~~
cake3.cpp: In function 'long long int query(node*, node*, int, int, int)':
cake3.cpp:50:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   50 |     int mid = l + r >> 1;
      |               ~~^~~
cake3.cpp: In function 'void solve(int, int, int, int)':
cake3.cpp:65:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |     int mid = l + r >> 1;
      |               ~~^~~
cake3.cpp: In function 'int main()':
cake3.cpp:82:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |         freopen ("task.inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
cake3.cpp:83:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |         freopen ("task.out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
cake3.cpp:86:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |         freopen (task".inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
cake3.cpp:87:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   87 |         freopen (task".out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory 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 1 ms 340 KB Output is correct
6 Correct 1 ms 340 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 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 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 340 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 340 KB Output is correct
31 Correct 1 ms 340 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 340 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory 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 1 ms 340 KB Output is correct
6 Correct 1 ms 340 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 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 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 340 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 340 KB Output is correct
31 Correct 1 ms 340 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 340 KB Output is correct
38 Correct 4 ms 1620 KB Output is correct
39 Correct 4 ms 1620 KB Output is correct
40 Correct 3 ms 1620 KB Output is correct
41 Correct 3 ms 1620 KB Output is correct
42 Correct 4 ms 1620 KB Output is correct
43 Correct 3 ms 1492 KB Output is correct
44 Correct 4 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 3 ms 1492 KB Output is correct
49 Correct 3 ms 1624 KB Output is correct
50 Correct 3 ms 1620 KB Output is correct
51 Correct 3 ms 1620 KB Output is correct
52 Correct 3 ms 1620 KB Output is correct
53 Correct 3 ms 1620 KB Output is correct
54 Correct 3 ms 1620 KB Output is correct
55 Correct 3 ms 1620 KB Output is correct
56 Correct 3 ms 1620 KB Output is correct
57 Correct 3 ms 1620 KB Output is correct
58 Correct 2 ms 1620 KB Output is correct
59 Correct 3 ms 1492 KB Output is correct
60 Correct 3 ms 1620 KB Output is correct
61 Correct 3 ms 1620 KB Output is correct
62 Correct 3 ms 1624 KB Output is correct
63 Correct 3 ms 1620 KB Output is correct
64 Correct 3 ms 1668 KB Output is correct
65 Correct 3 ms 1620 KB Output is correct
66 Correct 3 ms 1620 KB Output is correct
67 Correct 4 ms 1620 KB Output is correct
68 Correct 3 ms 1620 KB Output is correct
69 Correct 3 ms 1620 KB Output is correct
70 Correct 3 ms 1620 KB Output is correct
71 Correct 3 ms 1620 KB Output is correct
72 Correct 2 ms 1620 KB Output is correct
73 Correct 3 ms 1620 KB Output is correct
74 Correct 2 ms 1620 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory 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 1 ms 340 KB Output is correct
6 Correct 1 ms 340 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 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 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 340 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 340 KB Output is correct
31 Correct 1 ms 340 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 340 KB Output is correct
38 Correct 4 ms 1620 KB Output is correct
39 Correct 4 ms 1620 KB Output is correct
40 Correct 3 ms 1620 KB Output is correct
41 Correct 3 ms 1620 KB Output is correct
42 Correct 4 ms 1620 KB Output is correct
43 Correct 3 ms 1492 KB Output is correct
44 Correct 4 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 3 ms 1492 KB Output is correct
49 Correct 3 ms 1624 KB Output is correct
50 Correct 3 ms 1620 KB Output is correct
51 Correct 3 ms 1620 KB Output is correct
52 Correct 3 ms 1620 KB Output is correct
53 Correct 3 ms 1620 KB Output is correct
54 Correct 3 ms 1620 KB Output is correct
55 Correct 3 ms 1620 KB Output is correct
56 Correct 3 ms 1620 KB Output is correct
57 Correct 3 ms 1620 KB Output is correct
58 Correct 2 ms 1620 KB Output is correct
59 Correct 3 ms 1492 KB Output is correct
60 Correct 3 ms 1620 KB Output is correct
61 Correct 3 ms 1620 KB Output is correct
62 Correct 3 ms 1624 KB Output is correct
63 Correct 3 ms 1620 KB Output is correct
64 Correct 3 ms 1668 KB Output is correct
65 Correct 3 ms 1620 KB Output is correct
66 Correct 3 ms 1620 KB Output is correct
67 Correct 4 ms 1620 KB Output is correct
68 Correct 3 ms 1620 KB Output is correct
69 Correct 3 ms 1620 KB Output is correct
70 Correct 3 ms 1620 KB Output is correct
71 Correct 3 ms 1620 KB Output is correct
72 Correct 2 ms 1620 KB Output is correct
73 Correct 3 ms 1620 KB Output is correct
74 Correct 2 ms 1620 KB Output is correct
75 Correct 798 ms 186216 KB Output is correct
76 Correct 876 ms 183028 KB Output is correct
77 Correct 748 ms 188936 KB Output is correct
78 Correct 769 ms 191948 KB Output is correct
79 Correct 376 ms 192684 KB Output is correct
80 Correct 398 ms 186716 KB Output is correct
81 Correct 670 ms 189976 KB Output is correct
82 Correct 797 ms 192704 KB Output is correct
83 Correct 739 ms 199396 KB Output is correct
84 Correct 749 ms 198788 KB Output is correct
85 Correct 654 ms 191620 KB Output is correct
86 Correct 476 ms 184788 KB Output is correct
87 Correct 457 ms 182344 KB Output is correct
88 Correct 585 ms 180920 KB Output is correct
89 Correct 619 ms 191664 KB Output is correct
90 Correct 489 ms 201104 KB Output is correct
91 Correct 389 ms 185024 KB Output is correct
92 Correct 406 ms 183644 KB Output is correct
93 Correct 431 ms 191892 KB Output is correct
94 Correct 420 ms 200788 KB Output is correct
95 Correct 499 ms 201196 KB Output is correct
96 Correct 355 ms 186012 KB Output is correct
97 Correct 404 ms 201720 KB Output is correct
98 Correct 390 ms 198592 KB Output is correct
99 Correct 358 ms 198948 KB Output is correct
100 Correct 315 ms 186976 KB Output is correct
101 Correct 362 ms 187092 KB Output is correct
102 Correct 623 ms 187104 KB Output is correct
103 Correct 563 ms 184432 KB Output is correct
104 Correct 688 ms 195128 KB Output is correct
105 Correct 498 ms 194364 KB Output is correct
106 Correct 534 ms 199648 KB Output is correct
107 Correct 550 ms 192512 KB Output is correct
108 Correct 735 ms 190744 KB Output is correct
109 Correct 673 ms 202808 KB Output is correct
110 Correct 321 ms 187712 KB Output is correct
111 Correct 373 ms 190020 KB Output is correct
112 Correct 756 ms 180744 KB Output is correct
113 Correct 400 ms 203332 KB Output is correct