oj.uz

Submission #122178

# Submission time Handle Problem Language Result Execution time Memory
122178 2019-06-27T19:04:23 Z duality Cake 3 (JOI19_cake3) C++11
100 / 100
 3949 ms 15096 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

pii cake[200000];
set<pii> S,S2;
LLI sum = 0;
int ss,ee;
int insert(int i,int M) {
    if (cake[i].second > S.begin()->first) {
        S2.insert(*S.begin());
        sum -= S.begin()->first,S.erase(S.begin());
        S.insert(mp(cake[i].second,i)),sum += cake[i].second;
    }
    else S2.insert(mp(cake[i].second,i));
    return 0;
}
int erase(int i,int M) {
    auto it = S.find(mp(cake[i].second,i));
    if (it != S.end()) {
        sum -= it->first,S.erase(it);
        S.insert(*(--S2.end())),sum += (--S2.end())->first;
        S2.erase(--S2.end());
    }
    else S2.erase(mp(cake[i].second,i));
    return 0;
}
LLI query(int s,int e,int M) {
    if (e-s+1 < M) return -1e18;
    else {
        while (ss > s) insert(--ss,M);
        while (ee < e) insert(++ee,M);
        while (ss < s) erase(ss++,M);
        while (ee > e) erase(ee--,M);
        return sum-2*(cake[e].first-cake[s].first);
    }
}
LLI ans = -1e18;
int solve(int l,int r,int al,int ar,int M) {
    if (l > r) return 0;
    int i,m = (l+r) / 2,b = al;
    LLI best = -1e18;
    for (i = al; i <= ar; i++) {
        LLI x = query(m,i,M);
        if (x > best) best = x,b = i;
    }
    ans = max(ans,best);
    solve(l,m-1,al,b,M),solve(m+1,r,b,ar,M);
    return 0;
}
int main() {
    int i;
    int N,M;
    scanf("%d %d",&N,&M);
    for (i = 0; i < N; i++) scanf("%d %d",&cake[i].second,&cake[i].first);
    sort(cake,cake+N);
    for (i = 0; i < M; i++) S.insert(mp(cake[i].second,i)),sum += cake[i].second;
    ss = 0,ee = M-1;
    solve(0,N-M,0,N-1,M);
    printf("%lld\n",ans);

    return 0;
}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:107: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:108:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < N; i++) scanf("%d %d",&cake[i].second,&cake[i].first);
                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 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 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 284 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 256 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 256 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 256 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 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 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 284 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 256 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 256 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 9 ms 384 KB Output is correct
39 Correct 8 ms 384 KB Output is correct
40 Correct 7 ms 540 KB Output is correct
41 Correct 7 ms 384 KB Output is correct
42 Correct 5 ms 384 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 8 ms 384 KB Output is correct
45 Correct 9 ms 384 KB Output is correct
46 Correct 9 ms 384 KB Output is correct
47 Correct 9 ms 384 KB Output is correct
48 Correct 9 ms 384 KB Output is correct
49 Correct 8 ms 384 KB Output is correct
50 Correct 7 ms 384 KB Output is correct
51 Correct 7 ms 384 KB Output is correct
52 Correct 7 ms 384 KB Output is correct
53 Correct 8 ms 384 KB Output is correct
54 Correct 6 ms 384 KB Output is correct
55 Correct 5 ms 384 KB Output is correct
56 Correct 5 ms 512 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 4 ms 384 KB Output is correct
60 Correct 6 ms 384 KB Output is correct
61 Correct 5 ms 384 KB Output is correct
62 Correct 4 ms 384 KB Output is correct
63 Correct 5 ms 476 KB Output is correct
64 Correct 5 ms 384 KB Output is correct
65 Correct 9 ms 384 KB Output is correct
66 Correct 8 ms 384 KB Output is correct
67 Correct 8 ms 384 KB Output is correct
68 Correct 8 ms 384 KB Output is correct
69 Correct 7 ms 384 KB Output is correct
70 Correct 7 ms 384 KB Output is correct
71 Correct 8 ms 384 KB Output is correct
72 Correct 6 ms 384 KB Output is correct
73 Correct 6 ms 384 KB Output is correct
74 Correct 3 ms 512 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 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 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 284 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 256 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 256 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 9 ms 384 KB Output is correct
39 Correct 8 ms 384 KB Output is correct
40 Correct 7 ms 540 KB Output is correct
41 Correct 7 ms 384 KB Output is correct
42 Correct 5 ms 384 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 8 ms 384 KB Output is correct
45 Correct 9 ms 384 KB Output is correct
46 Correct 9 ms 384 KB Output is correct
47 Correct 9 ms 384 KB Output is correct
48 Correct 9 ms 384 KB Output is correct
49 Correct 8 ms 384 KB Output is correct
50 Correct 7 ms 384 KB Output is correct
51 Correct 7 ms 384 KB Output is correct
52 Correct 7 ms 384 KB Output is correct
53 Correct 8 ms 384 KB Output is correct
54 Correct 6 ms 384 KB Output is correct
55 Correct 5 ms 384 KB Output is correct
56 Correct 5 ms 512 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 4 ms 384 KB Output is correct
60 Correct 6 ms 384 KB Output is correct
61 Correct 5 ms 384 KB Output is correct
62 Correct 4 ms 384 KB Output is correct
63 Correct 5 ms 476 KB Output is correct
64 Correct 5 ms 384 KB Output is correct
65 Correct 9 ms 384 KB Output is correct
66 Correct 8 ms 384 KB Output is correct
67 Correct 8 ms 384 KB Output is correct
68 Correct 8 ms 384 KB Output is correct
69 Correct 7 ms 384 KB Output is correct
70 Correct 7 ms 384 KB Output is correct
71 Correct 8 ms 384 KB Output is correct
72 Correct 6 ms 384 KB Output is correct
73 Correct 6 ms 384 KB Output is correct
74 Correct 3 ms 512 KB Output is correct
75 Correct 3537 ms 10696 KB Output is correct
76 Correct 3949 ms 13780 KB Output is correct
77 Correct 3346 ms 14320 KB Output is correct
78 Correct 3456 ms 14552 KB Output is correct
79 Correct 204 ms 14424 KB Output is correct
80 Correct 473 ms 14200 KB Output is correct
81 Correct 2989 ms 12156 KB Output is correct
82 Correct 3553 ms 12024 KB Output is correct
83 Correct 3464 ms 12556 KB Output is correct
84 Correct 3400 ms 12456 KB Output is correct
85 Correct 3022 ms 12224 KB Output is correct
86 Correct 1607 ms 12252 KB Output is correct
87 Correct 1739 ms 12024 KB Output is correct
88 Correct 2573 ms 11680 KB Output is correct
89 Correct 2450 ms 12496 KB Output is correct
90 Correct 1749 ms 13208 KB Output is correct
91 Correct 1062 ms 12664 KB Output is correct
92 Correct 1095 ms 12412 KB Output is correct
93 Correct 1367 ms 12924 KB Output is correct
94 Correct 918 ms 13652 KB Output is correct
95 Correct 1767 ms 13268 KB Output is correct
96 Correct 611 ms 11896 KB Output is correct
97 Correct 673 ms 12792 KB Output is correct
98 Correct 689 ms 12536 KB Output is correct
99 Correct 613 ms 12792 KB Output is correct
100 Correct 499 ms 12280 KB Output is correct
101 Correct 529 ms 12152 KB Output is correct
102 Correct 2249 ms 11612 KB Output is correct
103 Correct 2133 ms 11596 KB Output is correct
104 Correct 2429 ms 12024 KB Output is correct
105 Correct 1914 ms 12508 KB Output is correct
106 Correct 1822 ms 12820 KB Output is correct
107 Correct 1608 ms 12500 KB Output is correct
108 Correct 3378 ms 14244 KB Output is correct
109 Correct 2641 ms 15020 KB Output is correct
110 Correct 1148 ms 11712 KB Output is correct
111 Correct 1769 ms 11256 KB Output is correct
112 Correct 1570 ms 12468 KB Output is correct
113 Correct 203 ms 15096 KB Output is correct