oj.uz

Submission #249428

# Submission time Handle Problem Language Result Execution time Memory
249428 2020-07-15T02:13:33 Z dantoh000 Cake 3 (JOI19_cake3) C++14
24 / 100
 4000 ms 14072 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
multiset<int> good, bad;
const ll INF = 1000000000000000;
int n,m;
ll ans = -INF;
ll sum = 0;
ii a[200005];
void balance(){
    auto G = *(good.begin());
    auto B = *(--bad.end());
    if (G < B){
        bad.insert(G);
        good.insert(B);
        sum += B-G;
        good.erase(good.begin());
        bad.erase(--bad.end());
    }
    assert(good.size() == m);
}
void add(int x){
    //printf("adding %d\n",x);
    if (good.size() < m){
        sum += x;
        good.insert(x);
        return;
    }
    bad.insert(x);
    balance();
}
bool cmp(ii a, ii b){
    return a.second < b.second;
}
int main(){
    scanf("%d%d",&n,&m);
    for (int i = 0; i < n; i++){
        scanf("%d%d",&a[i].first,&a[i].second);
    }
    sort(a,a+n,cmp);
    for (int i = 0; i < n; i++){
        //printf("%d %d\n",a[i].first,a[i].second);
        sum = 0;
        //printf("clearing\n");
        good.clear();
        bad.clear();
        for (int j = i; j < n; j++){
            //printf("processing <%d,%d>\n",a[j].first,a[j].second);
            add(a[j].first);
            if ((int)good.size() == m){
                ans = max(ans,sum-2*(a[j].second-a[i].second));
            }
        }
    }
    printf("%lld",ans);
}

Compilation message

In file included from /usr/include/c++/7/cassert:44:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:33,
                 from cake3.cpp:1:
cake3.cpp: In function 'void balance()':
cake3.cpp:21:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     assert(good.size() == m);
            ~~~~~~~~~~~~^~~~
cake3.cpp: In function 'void add(int)':
cake3.cpp:25:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (good.size() < m){
         ~~~~~~~~~~~~^~~
cake3.cpp: In function 'int main()':
cake3.cpp:37: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:39:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&a[i].first,&a[i].second);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 339 ms 500 KB Output is correct
39 Correct 368 ms 512 KB Output is correct
40 Correct 326 ms 512 KB Output is correct
41 Correct 300 ms 512 KB Output is correct
42 Correct 288 ms 632 KB Output is correct
43 Correct 264 ms 512 KB Output is correct
44 Correct 313 ms 384 KB Output is correct
45 Correct 383 ms 512 KB Output is correct
46 Correct 446 ms 504 KB Output is correct
47 Correct 361 ms 504 KB Output is correct
48 Correct 353 ms 504 KB Output is correct
49 Correct 353 ms 504 KB Output is correct
50 Correct 375 ms 512 KB Output is correct
51 Correct 324 ms 504 KB Output is correct
52 Correct 318 ms 504 KB Output is correct
53 Correct 345 ms 512 KB Output is correct
54 Correct 322 ms 632 KB Output is correct
55 Correct 285 ms 536 KB Output is correct
56 Correct 287 ms 512 KB Output is correct
57 Correct 274 ms 384 KB Output is correct
58 Correct 262 ms 384 KB Output is correct
59 Correct 152 ms 384 KB Output is correct
60 Correct 184 ms 504 KB Output is correct
61 Correct 151 ms 504 KB Output is correct
62 Correct 173 ms 512 KB Output is correct
63 Correct 218 ms 512 KB Output is correct
64 Correct 170 ms 512 KB Output is correct
65 Correct 343 ms 384 KB Output is correct
66 Correct 326 ms 384 KB Output is correct
67 Correct 354 ms 512 KB Output is correct
68 Correct 339 ms 512 KB Output is correct
69 Correct 304 ms 384 KB Output is correct
70 Correct 304 ms 512 KB Output is correct
71 Correct 341 ms 384 KB Output is correct
72 Correct 285 ms 504 KB Output is correct
73 Correct 380 ms 384 KB Output is correct
74 Correct 287 ms 512 KB Output is correct

Subtask #3
0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 339 ms 500 KB Output is correct
39 Correct 368 ms 512 KB Output is correct
40 Correct 326 ms 512 KB Output is correct
41 Correct 300 ms 512 KB Output is correct
42 Correct 288 ms 632 KB Output is correct
43 Correct 264 ms 512 KB Output is correct
44 Correct 313 ms 384 KB Output is correct
45 Correct 383 ms 512 KB Output is correct
46 Correct 446 ms 504 KB Output is correct
47 Correct 361 ms 504 KB Output is correct
48 Correct 353 ms 504 KB Output is correct
49 Correct 353 ms 504 KB Output is correct
50 Correct 375 ms 512 KB Output is correct
51 Correct 324 ms 504 KB Output is correct
52 Correct 318 ms 504 KB Output is correct
53 Correct 345 ms 512 KB Output is correct
54 Correct 322 ms 632 KB Output is correct
55 Correct 285 ms 536 KB Output is correct
56 Correct 287 ms 512 KB Output is correct
57 Correct 274 ms 384 KB Output is correct
58 Correct 262 ms 384 KB Output is correct
59 Correct 152 ms 384 KB Output is correct
60 Correct 184 ms 504 KB Output is correct
61 Correct 151 ms 504 KB Output is correct
62 Correct 173 ms 512 KB Output is correct
63 Correct 218 ms 512 KB Output is correct
64 Correct 170 ms 512 KB Output is correct
65 Correct 343 ms 384 KB Output is correct
66 Correct 326 ms 384 KB Output is correct
67 Correct 354 ms 512 KB Output is correct
68 Correct 339 ms 512 KB Output is correct
69 Correct 304 ms 384 KB Output is correct
70 Correct 304 ms 512 KB Output is correct
71 Correct 341 ms 384 KB Output is correct
72 Correct 285 ms 504 KB Output is correct
73 Correct 380 ms 384 KB Output is correct
74 Correct 287 ms 512 KB Output is correct
75 Execution timed out 4059 ms 14072 KB Time limit exceeded
76 Halted 0 ms 0 KB -