oj.uz

Submission #154415

# Submission time Handle Problem Language Result Execution time Memory
154415 2019-09-21T18:03:02 Z arnold518 Cake 3 (JOI19_cake3) C++14
100 / 100
 1334 ms 202476 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e5;

struct Cake
{
    int V, C;
    bool operator < (const Cake &p) { return C<p.C; }
}A[MAXN+10];
int N, M, S;
ll ans=-1e18;

vector<int> comp;
int getcomp(int x) { return lower_bound(comp.begin(), comp.end(), x)-comp.begin(); }

struct Node
{
    ll cnt, sum;
    Node *lc, *rc;
    Node() : cnt(0), sum(0), lc(NULL), rc(NULL) {}
};
Node *tree[MAXN+10];

void makeTree(Node *node, int tl, int tr)
{
    if(tl==tr) return;
    int mid=tl+tr>>1;
    node->lc=new Node();
    node->rc=new Node();
    makeTree(node->lc, tl, mid);
    makeTree(node->rc, mid+1, tr);
}

Node *addTree(Node *node, int tl, int tr, int pos)
{
    if(pos<tl || tr<pos) return node;
    Node *ret=new Node();
    if(tl==tr)
    {
        ret->cnt=node->cnt+1;
        ret->sum=node->sum+comp[tl];
        return ret;
    }
    int mid=tl+tr>>1;
    ret->lc=addTree(node->lc, tl, mid, pos);
    ret->rc=addTree(node->rc, mid+1, tr, pos);
    ret->cnt=ret->lc->cnt+ret->rc->cnt;
    ret->sum=ret->lc->sum+ret->rc->sum;
    return ret;
}

ll query(Node *nodel, Node *noder, int tl, int tr, ll k)
{
    if(tl==tr) return comp[tl]*min(k, noder->cnt-nodel->cnt);
    int mid=tl+tr>>1;
    ll t=noder->rc->cnt-nodel->rc->cnt;
    if(k>t) return query(nodel->lc, noder->lc, tl, mid, k-t)+noder->rc->sum-nodel->rc->sum;
    else return query(nodel->rc, noder->rc, mid+1, tr, k);
}

void solve(int sl, int sr, int el, int er)
{
    if(sl>sr) return;
    int i, j;
    int smid=sl+sr>>1, emid=er; ll val=-1e18;
    for(i=max(smid+M-1, el); i<=er; i++)
    {
        ll now=query(tree[smid-1], tree[i], 0, S-1, M)-2ll*(A[i].C-A[smid].C);
        //printf("%d %d %lld\n", smid, i, now);
        if(now>val) val=now, emid=i;
    }
    ans=max(ans, val);
    solve(sl, smid-1, el, emid);
    solve(smid+1, sr, emid, er);
}

int main()
{
    int i, j;

    scanf("%d%d", &N, &M);
    for(i=1; i<=N; i++) scanf("%d%d", &A[i].V, &A[i].C), comp.push_back(A[i].V);
    sort(A+1, A+N+1);

    sort(comp.begin(), comp.end());
    comp.erase(unique(comp.begin(), comp.end()), comp.end());
    S=comp.size();

    tree[0]=new Node();
    makeTree(tree[0], 0, S-1);
    for(i=1; i<=N; i++) tree[i]=addTree(tree[i-1], 0, S-1, getcomp(A[i].V));

    solve(1, N, 1, N);
    printf("%lld", ans);
}

Compilation message

cake3.cpp: In function 'void makeTree(Node*, int, int)':
cake3.cpp:32:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid=tl+tr>>1;
             ~~^~~
cake3.cpp: In function 'Node* addTree(Node*, int, int, int)':
cake3.cpp:49:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid=tl+tr>>1;
             ~~^~~
cake3.cpp: In function 'll query(Node*, Node*, int, int, ll)':
cake3.cpp:60:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid=tl+tr>>1;
             ~~^~~
cake3.cpp: In function 'void solve(int, int, int, int)':
cake3.cpp:70:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int smid=sl+sr>>1, emid=er; ll val=-1e18;
              ~~^~~
cake3.cpp:69:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
cake3.cpp: In function 'int main()':
cake3.cpp:84:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
cake3.cpp:86: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:87:56: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(i=1; i<=N; i++) scanf("%d%d", &A[i].V, &A[i].C), comp.push_back(A[i].V);
                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 372 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 372 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 3 ms 380 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 372 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 372 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 3 ms 380 KB Output is correct
38 Correct 7 ms 1656 KB Output is correct
39 Correct 7 ms 1656 KB Output is correct
40 Correct 7 ms 1656 KB Output is correct
41 Correct 7 ms 1656 KB Output is correct
42 Correct 7 ms 1784 KB Output is correct
43 Correct 6 ms 1528 KB Output is correct
44 Correct 6 ms 1528 KB Output is correct
45 Correct 7 ms 1656 KB Output is correct
46 Correct 7 ms 1704 KB Output is correct
47 Correct 7 ms 1656 KB Output is correct
48 Correct 6 ms 1528 KB Output is correct
49 Correct 7 ms 1656 KB Output is correct
50 Correct 6 ms 1684 KB Output is correct
51 Correct 6 ms 1656 KB Output is correct
52 Correct 6 ms 1656 KB Output is correct
53 Correct 7 ms 1656 KB Output is correct
54 Correct 6 ms 1656 KB Output is correct
55 Correct 6 ms 1660 KB Output is correct
56 Correct 5 ms 1656 KB Output is correct
57 Correct 5 ms 1656 KB Output is correct
58 Correct 5 ms 1656 KB Output is correct
59 Correct 3 ms 504 KB Output is correct
60 Correct 3 ms 504 KB Output is correct
61 Correct 3 ms 504 KB Output is correct
62 Correct 4 ms 504 KB Output is correct
63 Correct 3 ms 632 KB Output is correct
64 Correct 3 ms 504 KB Output is correct
65 Correct 6 ms 1656 KB Output is correct
66 Correct 6 ms 1656 KB Output is correct
67 Correct 6 ms 1656 KB Output is correct
68 Correct 6 ms 1700 KB Output is correct
69 Correct 6 ms 1564 KB Output is correct
70 Correct 6 ms 1656 KB Output is correct
71 Correct 4 ms 888 KB Output is correct
72 Correct 4 ms 760 KB Output is correct
73 Correct 6 ms 1656 KB Output is correct
74 Correct 5 ms 1784 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 372 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 372 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 3 ms 380 KB Output is correct
38 Correct 7 ms 1656 KB Output is correct
39 Correct 7 ms 1656 KB Output is correct
40 Correct 7 ms 1656 KB Output is correct
41 Correct 7 ms 1656 KB Output is correct
42 Correct 7 ms 1784 KB Output is correct
43 Correct 6 ms 1528 KB Output is correct
44 Correct 6 ms 1528 KB Output is correct
45 Correct 7 ms 1656 KB Output is correct
46 Correct 7 ms 1704 KB Output is correct
47 Correct 7 ms 1656 KB Output is correct
48 Correct 6 ms 1528 KB Output is correct
49 Correct 7 ms 1656 KB Output is correct
50 Correct 6 ms 1684 KB Output is correct
51 Correct 6 ms 1656 KB Output is correct
52 Correct 6 ms 1656 KB Output is correct
53 Correct 7 ms 1656 KB Output is correct
54 Correct 6 ms 1656 KB Output is correct
55 Correct 6 ms 1660 KB Output is correct
56 Correct 5 ms 1656 KB Output is correct
57 Correct 5 ms 1656 KB Output is correct
58 Correct 5 ms 1656 KB Output is correct
59 Correct 3 ms 504 KB Output is correct
60 Correct 3 ms 504 KB Output is correct
61 Correct 3 ms 504 KB Output is correct
62 Correct 4 ms 504 KB Output is correct
63 Correct 3 ms 632 KB Output is correct
64 Correct 3 ms 504 KB Output is correct
65 Correct 6 ms 1656 KB Output is correct
66 Correct 6 ms 1656 KB Output is correct
67 Correct 6 ms 1656 KB Output is correct
68 Correct 6 ms 1700 KB Output is correct
69 Correct 6 ms 1564 KB Output is correct
70 Correct 6 ms 1656 KB Output is correct
71 Correct 4 ms 888 KB Output is correct
72 Correct 4 ms 760 KB Output is correct
73 Correct 6 ms 1656 KB Output is correct
74 Correct 5 ms 1784 KB Output is correct
75 Correct 1289 ms 187864 KB Output is correct
76 Correct 1334 ms 182376 KB Output is correct
77 Correct 1168 ms 188284 KB Output is correct
78 Correct 1284 ms 191380 KB Output is correct
79 Correct 601 ms 192108 KB Output is correct
80 Correct 598 ms 186040 KB Output is correct
81 Correct 712 ms 149316 KB Output is correct
82 Correct 918 ms 160152 KB Output is correct
83 Correct 843 ms 158112 KB Output is correct
84 Correct 854 ms 159456 KB Output is correct
85 Correct 734 ms 150868 KB Output is correct
86 Correct 501 ms 140160 KB Output is correct
87 Correct 520 ms 139520 KB Output is correct
88 Correct 666 ms 142440 KB Output is correct
89 Correct 631 ms 147436 KB Output is correct
90 Correct 533 ms 149760 KB Output is correct
91 Correct 431 ms 136984 KB Output is correct
92 Correct 433 ms 136300 KB Output is correct
93 Correct 479 ms 142376 KB Output is correct
94 Correct 435 ms 145440 KB Output is correct
95 Correct 527 ms 149288 KB Output is correct
96 Correct 85 ms 15344 KB Output is correct
97 Correct 85 ms 16492 KB Output is correct
98 Correct 88 ms 16220 KB Output is correct
99 Correct 83 ms 16364 KB Output is correct
100 Correct 78 ms 15340 KB Output is correct
101 Correct 79 ms 15440 KB Output is correct
102 Correct 517 ms 119528 KB Output is correct
103 Correct 528 ms 117680 KB Output is correct
104 Correct 625 ms 127212 KB Output is correct
105 Correct 516 ms 117996 KB Output is correct
106 Correct 501 ms 120872 KB Output is correct
107 Correct 428 ms 114852 KB Output is correct
108 Correct 1163 ms 190200 KB Output is correct
109 Correct 1036 ms 202264 KB Output is correct
110 Correct 150 ms 44776 KB Output is correct
111 Correct 165 ms 45488 KB Output is correct
112 Correct 1215 ms 180376 KB Output is correct
113 Correct 616 ms 202476 KB Output is correct