oj.uz

답안 #122245

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
122245 2019-06-27T23:53:51 Z duality Cake 3 (JOI19_cake3) C++11
100 / 100
 1048 ms 26152 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];
priority_queue<pii,vpii,greater<pii> > H;
priority_queue<pii> H2;
LLI sum = 0;
int ss,ee;
int in[200000];
int insert(int i,int M) {
    while (in[H.top().second] != 1) H.pop();
    if (cake[i].second > H.top().first) {
        H2.push(H.top()),in[H.top().second] = 2;
        sum -= H.top().first,H.pop();
        H.push(mp(cake[i].second,i)),sum += cake[i].second;
        in[i] = 1;
    }
    else H2.push(mp(cake[i].second,i)),in[i] = 2;
    return 0;
}
int erase(int i,int M) {
    if (in[i] == 1) {
        while (in[H2.top().second] != 2) H2.pop();
        sum -= cake[i].second;
        H.push(H2.top()),in[H2.top().second] = 1;
        sum += H2.top().first,H2.pop();
    }
    in[i] = 0;
    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++) H.push(mp(cake[i].second,i)),in[i] = 1,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:111: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:112: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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 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 3 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 2 ms 256 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 4 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 2 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 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 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 3 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 2 ms 256 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 4 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 2 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 6 ms 512 KB Output is correct
39 Correct 6 ms 512 KB Output is correct
40 Correct 5 ms 512 KB Output is correct
41 Correct 5 ms 512 KB Output is correct
42 Correct 4 ms 512 KB Output is correct
43 Correct 4 ms 384 KB Output is correct
44 Correct 5 ms 640 KB Output is correct
45 Correct 6 ms 640 KB Output is correct
46 Correct 6 ms 512 KB Output is correct
47 Correct 6 ms 640 KB Output is correct
48 Correct 6 ms 512 KB Output is correct
49 Correct 5 ms 512 KB Output is correct
50 Correct 5 ms 640 KB Output is correct
51 Correct 5 ms 640 KB Output is correct
52 Correct 5 ms 512 KB Output is correct
53 Correct 5 ms 640 KB Output is correct
54 Correct 4 ms 512 KB Output is correct
55 Correct 3 ms 512 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 4 ms 512 KB Output is correct
58 Correct 3 ms 384 KB Output is correct
59 Correct 3 ms 384 KB Output is correct
60 Correct 5 ms 384 KB Output is correct
61 Correct 4 ms 384 KB Output is correct
62 Correct 4 ms 384 KB Output is correct
63 Correct 4 ms 640 KB Output is correct
64 Correct 3 ms 384 KB Output is correct
65 Correct 6 ms 640 KB Output is correct
66 Correct 5 ms 640 KB Output is correct
67 Correct 6 ms 512 KB Output is correct
68 Correct 6 ms 640 KB Output is correct
69 Correct 5 ms 640 KB Output is correct
70 Correct 5 ms 640 KB Output is correct
71 Correct 6 ms 512 KB Output is correct
72 Correct 4 ms 512 KB Output is correct
73 Correct 5 ms 512 KB Output is correct
74 Correct 3 ms 384 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 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 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 3 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 2 ms 256 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 4 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 2 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 6 ms 512 KB Output is correct
39 Correct 6 ms 512 KB Output is correct
40 Correct 5 ms 512 KB Output is correct
41 Correct 5 ms 512 KB Output is correct
42 Correct 4 ms 512 KB Output is correct
43 Correct 4 ms 384 KB Output is correct
44 Correct 5 ms 640 KB Output is correct
45 Correct 6 ms 640 KB Output is correct
46 Correct 6 ms 512 KB Output is correct
47 Correct 6 ms 640 KB Output is correct
48 Correct 6 ms 512 KB Output is correct
49 Correct 5 ms 512 KB Output is correct
50 Correct 5 ms 640 KB Output is correct
51 Correct 5 ms 640 KB Output is correct
52 Correct 5 ms 512 KB Output is correct
53 Correct 5 ms 640 KB Output is correct
54 Correct 4 ms 512 KB Output is correct
55 Correct 3 ms 512 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 4 ms 512 KB Output is correct
58 Correct 3 ms 384 KB Output is correct
59 Correct 3 ms 384 KB Output is correct
60 Correct 5 ms 384 KB Output is correct
61 Correct 4 ms 384 KB Output is correct
62 Correct 4 ms 384 KB Output is correct
63 Correct 4 ms 640 KB Output is correct
64 Correct 3 ms 384 KB Output is correct
65 Correct 6 ms 640 KB Output is correct
66 Correct 5 ms 640 KB Output is correct
67 Correct 6 ms 512 KB Output is correct
68 Correct 6 ms 640 KB Output is correct
69 Correct 5 ms 640 KB Output is correct
70 Correct 5 ms 640 KB Output is correct
71 Correct 6 ms 512 KB Output is correct
72 Correct 4 ms 512 KB Output is correct
73 Correct 5 ms 512 KB Output is correct
74 Correct 3 ms 384 KB Output is correct
75 Correct 828 ms 15624 KB Output is correct
76 Correct 972 ms 15596 KB Output is correct
77 Correct 723 ms 23900 KB Output is correct
78 Correct 763 ms 23904 KB Output is correct
79 Correct 82 ms 8172 KB Output is correct
80 Correct 135 ms 10440 KB Output is correct
81 Correct 876 ms 22672 KB Output is correct
82 Correct 1048 ms 26152 KB Output is correct
83 Correct 995 ms 22976 KB Output is correct
84 Correct 1026 ms 23120 KB Output is correct
85 Correct 888 ms 22864 KB Output is correct
86 Correct 495 ms 22608 KB Output is correct
87 Correct 541 ms 22608 KB Output is correct
88 Correct 770 ms 22408 KB Output is correct
89 Correct 755 ms 22648 KB Output is correct
90 Correct 526 ms 23004 KB Output is correct
91 Correct 311 ms 14248 KB Output is correct
92 Correct 330 ms 14272 KB Output is correct
93 Correct 412 ms 22608 KB Output is correct
94 Correct 258 ms 14176 KB Output is correct
95 Correct 501 ms 23144 KB Output is correct
96 Correct 295 ms 10084 KB Output is correct
97 Correct 302 ms 11492 KB Output is correct
98 Correct 326 ms 10468 KB Output is correct
99 Correct 278 ms 11312 KB Output is correct
100 Correct 214 ms 10852 KB Output is correct
101 Correct 227 ms 10980 KB Output is correct
102 Correct 951 ms 22604 KB Output is correct
103 Correct 888 ms 22748 KB Output is correct
104 Correct 1002 ms 23468 KB Output is correct
105 Correct 760 ms 23552 KB Output is correct
106 Correct 723 ms 23144 KB Output is correct
107 Correct 611 ms 22548 KB Output is correct
108 Correct 690 ms 23760 KB Output is correct
109 Correct 523 ms 24460 KB Output is correct
110 Correct 505 ms 21836 KB Output is correct
111 Correct 854 ms 22288 KB Output is correct
112 Correct 607 ms 21036 KB Output is correct
113 Correct 86 ms 8400 KB Output is correct