oj.uz

답안 #120770

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
120770 2019-06-25T12:28:03 Z songc Cake 3 (JOI19_cake3) C++14
100 / 100
 1236 ms 183812 KB 
#include <bits/stdc++.h>
#define INF (1ll << 60)
using namespace std;
typedef long long LL;
typedef pair<LL, LL> pii;

int N, M;
pii A[202020];
vector<int> comp;
LL ans = -INF;

struct Node{
    int cnt;
    LL sum;
    Node *lc, *rc;
    Node();
} *PST[202020], *NIL;

Node :: Node(){
    lc = rc = NIL;
    cnt = sum = 0;
}

void update(Node *pr, Node *nw, int s, int e, int t){
    nw->cnt = pr->cnt+1;
    nw->sum = pr->sum+comp[t];
    if (s == e) return;
    int mid = (s+e)/2;
    if (t <= mid){
        nw->lc = new Node;
        nw->rc = pr->rc;
        update(pr->lc, nw->lc, s, mid, t);
    }
    else{
        nw->lc = pr->lc;
        nw->rc = new Node;
        update(pr->rc, nw->rc, mid+1, e, t);
    }
}

LL query(Node *st, Node *ed, int s, int e, int k){
    if (k <= 0) return 0;
    if (s == e) return k * comp[s];
    int mid = (s+e)/2;
    if (ed->rc->cnt - st->rc->cnt > k) return query(st->rc, ed->rc, mid+1, e, k);
    return ed->rc->sum - st->rc->sum + query(st->lc, ed->lc, s, mid, k - ed->rc->cnt + st->rc->cnt);
}

void DNC(int s, int e, int st, int ed){
    if (s > e) return;
    int mid = (s+e)/2;
    LL Max=-INF, id=0;
    for (int i=st; i<=min(ed, mid-M+1); i++){
        LL ret = query(PST[i], PST[mid-1], 0, comp.size(), M-2);
        ret += A[i].second + A[mid].second - 2*(A[mid].first - A[i].first);
        if (Max < ret) Max = ret, id = i;
    }
    ans = max(ans, Max);
    DNC(s, mid-1, st, id);
    DNC(mid+1, e, id, ed);
}

int main(){
    NIL = new Node;
    NIL->lc = NIL->rc = NIL;

    scanf("%d %d", &N, &M);
    for (int i=1; i<=N; i++){
        scanf("%lld %lld", &A[i].second, &A[i].first);
        comp.push_back(A[i].second);
    }
    sort(A+1, A+N+1);
    sort(comp.begin(), comp.end());
    comp.erase(unique(comp.begin(), comp.end()), comp.end());

    PST[0] = new Node;
    for (int i=1; i<=N; i++){
        PST[i] = new Node;
        update(PST[i-1], PST[i], 0, comp.size(), lower_bound(comp.begin(), comp.end(), A[i].second)-comp.begin());
    }
    DNC(M, N, 1, N);
    printf("%lld\n", ans);
    return 0;
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:67: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:69:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld %lld", &A[i].second, &A[i].first);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 5 ms 1408 KB Output is correct
39 Correct 5 ms 1536 KB Output is correct
40 Correct 5 ms 1536 KB Output is correct
41 Correct 4 ms 1408 KB Output is correct
42 Correct 4 ms 1536 KB Output is correct
43 Correct 5 ms 1408 KB Output is correct
44 Correct 5 ms 1408 KB Output is correct
45 Correct 5 ms 1408 KB Output is correct
46 Correct 5 ms 1536 KB Output is correct
47 Correct 5 ms 1408 KB Output is correct
48 Correct 5 ms 1408 KB Output is correct
49 Correct 4 ms 1536 KB Output is correct
50 Correct 5 ms 1536 KB Output is correct
51 Correct 5 ms 1536 KB Output is correct
52 Correct 5 ms 1408 KB Output is correct
53 Correct 5 ms 1536 KB Output is correct
54 Correct 4 ms 1536 KB Output is correct
55 Correct 5 ms 1536 KB Output is correct
56 Correct 5 ms 1408 KB Output is correct
57 Correct 5 ms 1408 KB Output is correct
58 Correct 4 ms 1408 KB Output is correct
59 Correct 3 ms 640 KB Output is correct
60 Correct 3 ms 640 KB Output is correct
61 Correct 3 ms 640 KB Output is correct
62 Correct 6 ms 640 KB Output is correct
63 Correct 3 ms 640 KB Output is correct
64 Correct 3 ms 512 KB Output is correct
65 Correct 5 ms 1408 KB Output is correct
66 Correct 5 ms 1408 KB Output is correct
67 Correct 5 ms 1408 KB Output is correct
68 Correct 5 ms 1536 KB Output is correct
69 Correct 4 ms 1408 KB Output is correct
70 Correct 5 ms 1408 KB Output is correct
71 Correct 3 ms 768 KB Output is correct
72 Correct 3 ms 768 KB Output is correct
73 Correct 4 ms 1408 KB Output is correct
74 Correct 4 ms 1536 KB Output is correct
75 Correct 1108 ms 168708 KB Output is correct
76 Correct 1236 ms 165668 KB Output is correct
77 Correct 1040 ms 171052 KB Output is correct
78 Correct 1103 ms 173812 KB Output is correct
79 Correct 481 ms 174304 KB Output is correct
80 Correct 508 ms 169068 KB Output is correct
81 Correct 615 ms 147884 KB Output is correct
82 Correct 844 ms 156648 KB Output is correct
83 Correct 768 ms 156176 KB Output is correct
84 Correct 794 ms 157144 KB Output is correct
85 Correct 661 ms 149356 KB Output is correct
86 Correct 453 ms 139312 KB Output is correct
87 Correct 450 ms 138604 KB Output is correct
88 Correct 608 ms 141032 KB Output is correct
89 Correct 575 ms 146572 KB Output is correct
90 Correct 438 ms 149100 KB Output is correct
91 Correct 358 ms 136676 KB Output is correct
92 Correct 365 ms 135964 KB Output is correct
93 Correct 414 ms 141780 KB Output is correct
94 Correct 382 ms 145220 KB Output is correct
95 Correct 460 ms 148592 KB Output is correct
96 Correct 97 ms 25128 KB Output is correct
97 Correct 101 ms 26856 KB Output is correct
98 Correct 103 ms 26600 KB Output is correct
99 Correct 100 ms 26604 KB Output is correct
100 Correct 88 ms 25192 KB Output is correct
101 Correct 89 ms 25324 KB Output is correct
102 Correct 519 ms 120424 KB Output is correct
103 Correct 501 ms 118248 KB Output is correct
104 Correct 568 ms 127732 KB Output is correct
105 Correct 374 ms 118884 KB Output is correct
106 Correct 417 ms 121576 KB Output is correct
107 Correct 391 ms 115600 KB Output is correct
108 Correct 1034 ms 172792 KB Output is correct
109 Correct 901 ms 183784 KB Output is correct
110 Correct 124 ms 47980 KB Output is correct
111 Correct 145 ms 48668 KB Output is correct
112 Correct 432 ms 164588 KB Output is correct
113 Correct 457 ms 183812 KB Output is correct