oj.uz

답안 #129410

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
129410 2019-07-12T08:04:36 Z PeppaPig Cake 3 (JOI19_cake3) C++14
100 / 100
 1631 ms 213608 KB 
#include <bits/stdc++.h>

#define long long long
#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 2e5+5;

vector<int> coord;
map<int, int> M;

struct node {
    long sum, cnt;
    node *l, *r;
    node(long sum, long cnt, node *l, node *r) : sum(sum), cnt(cnt), l(l), r(r) { }
};

node* newleaf(long sum, long cnt) { 
    return new node(sum, cnt, nullptr, nullptr); 
}
node* newpar(node *l, node *r) {
    return new node(l->sum + r->sum, l->cnt + r->cnt, l, r);
}

node* build(int l = 1, int r = coord.size()) {
    if(l == r) return newleaf(0, 0);
    int mid = (l + r) >> 1;
    return newpar(build(l, mid), build(mid + 1, r));
}

node* update(long sum, int x, node *p, int l = 1, int r = coord.size()) {
    if(l == r) return newleaf(p->sum + sum, p->cnt + 1);
    int mid = (l + r) >> 1;
    if(x <= mid) return newpar(update(sum, x, p->l, l, mid), p->r);
    else return newpar(p->l, update(sum, x, p->r, mid + 1, r));
}

long query(int k, node *pa, node *pb, int l = 1, int r = coord.size()) {
    if(!k) return 0;
    if(l == r) return pb->sum - pa->sum;
    long sum_r = pb->r->sum - pa->r->sum, cnt_r = pb->r->cnt - pa->r->cnt;
    int mid = (l + r) >> 1;
    if(cnt_r >= k) return query(k, pa->r, pb->r, mid + 1, r);
    else return sum_r + query(k - cnt_r, pa->l, pb->l, l, mid);
}

int n, m;
node* t[N];
pii v[N];

long ans[N];

void solve(int l, int r, int optl, int optr) {
    if(l > r) return;
    int mid = (l + r) >> 1, idx = optl;
    for(int i = max(mid + m - 1, optl); i <= optr; i++) {
        long now = query(m - 2, t[mid], t[i - 1]) + v[i].x + v[mid].x - 2ll * (v[i].y - v[mid].y);
        if(now > ans[mid]) ans[mid] = now, idx = i;
    }
    solve(l, mid - 1, optl, idx), solve(mid + 1, r, idx, optr);
}

int main() {
    fill_n(ans, N, -2e18);
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; i++) {
        scanf("%d %d", &v[i].x, &v[i].y);
        coord.emplace_back(v[i].x);
    }
    sort(v + 1, v + n + 1, [&](const pii &a, const pii &b) {
        return a.y < b.y;
    });
    sort(coord.begin(), coord.end());
    for(int i = 1; i <= n; i++) if(!M.count(coord[i-1])) M[coord[i-1]] = i;

    t[0] = build();
    for(int i = 1; i <= n; i++) t[i] = update(v[i].x, M[v[i].x]++, t[i-1]);

    solve(1, n - m + 1, 1, n);

    long ret = -2e18;
    for(int i = 1; i <= n; i++) ret = max(ret, ans[i]);
    printf("%lld\n", ret);

    return 0;
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:68:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
cake3.cpp:70:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &v[i].x, &v[i].y);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 3 ms 1912 KB Output is correct
4 Correct 3 ms 1912 KB Output is correct
5 Correct 3 ms 1912 KB Output is correct
6 Correct 3 ms 2040 KB Output is correct
7 Correct 3 ms 1912 KB Output is correct
8 Correct 3 ms 1912 KB Output is correct
9 Correct 3 ms 1912 KB Output is correct
10 Correct 3 ms 1912 KB Output is correct
11 Correct 3 ms 1908 KB Output is correct
12 Correct 3 ms 1912 KB Output is correct
13 Correct 3 ms 1912 KB Output is correct
14 Correct 3 ms 1912 KB Output is correct
15 Correct 3 ms 1912 KB Output is correct
16 Correct 3 ms 1912 KB Output is correct
17 Correct 3 ms 1912 KB Output is correct
18 Correct 3 ms 1912 KB Output is correct
19 Correct 3 ms 1912 KB Output is correct
20 Correct 3 ms 1912 KB Output is correct
21 Correct 3 ms 1912 KB Output is correct
22 Correct 3 ms 1912 KB Output is correct
23 Correct 3 ms 1912 KB Output is correct
24 Correct 3 ms 1912 KB Output is correct
25 Correct 3 ms 1912 KB Output is correct
26 Correct 3 ms 1912 KB Output is correct
27 Correct 3 ms 1912 KB Output is correct
28 Correct 3 ms 1888 KB Output is correct
29 Correct 3 ms 1912 KB Output is correct
30 Correct 4 ms 1912 KB Output is correct
31 Correct 4 ms 1940 KB Output is correct
32 Correct 4 ms 1912 KB Output is correct
33 Correct 3 ms 1912 KB Output is correct
34 Correct 3 ms 1912 KB Output is correct
35 Correct 3 ms 1912 KB Output is correct
36 Correct 3 ms 1912 KB Output is correct
37 Correct 3 ms 1912 KB Output is correct
38 Correct 8 ms 3320 KB Output is correct
39 Correct 8 ms 3448 KB Output is correct
40 Correct 8 ms 3320 KB Output is correct
41 Correct 9 ms 3192 KB Output is correct
42 Correct 7 ms 3320 KB Output is correct
43 Correct 7 ms 3192 KB Output is correct
44 Correct 9 ms 3320 KB Output is correct
45 Correct 8 ms 3320 KB Output is correct
46 Correct 8 ms 3448 KB Output is correct
47 Correct 8 ms 3320 KB Output is correct
48 Correct 8 ms 3192 KB Output is correct
49 Correct 8 ms 3320 KB Output is correct
50 Correct 8 ms 3320 KB Output is correct
51 Correct 8 ms 3320 KB Output is correct
52 Correct 8 ms 3320 KB Output is correct
53 Correct 8 ms 3320 KB Output is correct
54 Correct 7 ms 3320 KB Output is correct
55 Correct 7 ms 3320 KB Output is correct
56 Correct 7 ms 3320 KB Output is correct
57 Correct 7 ms 3320 KB Output is correct
58 Correct 7 ms 3320 KB Output is correct
59 Correct 6 ms 3192 KB Output is correct
60 Correct 7 ms 3192 KB Output is correct
61 Correct 6 ms 3192 KB Output is correct
62 Correct 6 ms 3320 KB Output is correct
63 Correct 7 ms 3192 KB Output is correct
64 Correct 6 ms 3320 KB Output is correct
65 Correct 8 ms 3368 KB Output is correct
66 Correct 7 ms 3320 KB Output is correct
67 Correct 8 ms 3320 KB Output is correct
68 Correct 7 ms 3320 KB Output is correct
69 Correct 7 ms 3320 KB Output is correct
70 Correct 7 ms 3320 KB Output is correct
71 Correct 6 ms 3192 KB Output is correct
72 Correct 6 ms 3320 KB Output is correct
73 Correct 8 ms 3320 KB Output is correct
74 Correct 7 ms 3324 KB Output is correct
75 Correct 1527 ms 198228 KB Output is correct
76 Correct 1614 ms 192612 KB Output is correct
77 Correct 1451 ms 198752 KB Output is correct
78 Correct 1524 ms 201908 KB Output is correct
79 Correct 901 ms 202604 KB Output is correct
80 Correct 909 ms 196508 KB Output is correct
81 Correct 1174 ms 192208 KB Output is correct
82 Correct 1631 ms 195800 KB Output is correct
83 Correct 1335 ms 201836 KB Output is correct
84 Correct 1433 ms 201336 KB Output is correct
85 Correct 1218 ms 193768 KB Output is correct
86 Correct 838 ms 186600 KB Output is correct
87 Correct 893 ms 184296 KB Output is correct
88 Correct 1293 ms 183272 KB Output is correct
89 Correct 1150 ms 193768 KB Output is correct
90 Correct 888 ms 202660 KB Output is correct
91 Correct 757 ms 186828 KB Output is correct
92 Correct 771 ms 185172 KB Output is correct
93 Correct 889 ms 193620 KB Output is correct
94 Correct 759 ms 202380 KB Output is correct
95 Correct 857 ms 202928 KB Output is correct
96 Correct 569 ms 187084 KB Output is correct
97 Correct 612 ms 202472 KB Output is correct
98 Correct 621 ms 199528 KB Output is correct
99 Correct 588 ms 200032 KB Output is correct
100 Correct 507 ms 188012 KB Output is correct
101 Correct 576 ms 187984 KB Output is correct
102 Correct 947 ms 188204 KB Output is correct
103 Correct 1018 ms 185448 KB Output is correct
104 Correct 1306 ms 196244 KB Output is correct
105 Correct 960 ms 195568 KB Output is correct
106 Correct 917 ms 200724 KB Output is correct
107 Correct 797 ms 193396 KB Output is correct
108 Correct 1541 ms 200664 KB Output is correct
109 Correct 1388 ms 213328 KB Output is correct
110 Correct 518 ms 188832 KB Output is correct
111 Correct 619 ms 190952 KB Output is correct
112 Correct 1467 ms 190412 KB Output is correct
113 Correct 954 ms 213608 KB Output is correct