oj.uz

Submission #869375

# Submission time Handle Problem Language Result Execution time Memory
869375 2023-11-04T08:44:26 Z browntoad Cake 3 (JOI19_cake3) C++14
24 / 100
 4000 ms 18516 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define int ll
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n+1)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define RREP1(i, n) for (int i = (n); i >= 1; i--)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)((x).size())
#define pb push_back
#define pii pair<int, int>
#define f first
#define s second

const ll maxn = 5e5+5;
const ll inf = (1ll<<60);
const ll mod = 1000992299;

template <typename T>
using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

bool cmp(pii a, pii b){
    return a.s < b.s;
}

signed main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int n, m; cin>>n>>m;
    vector<pii> vc(n);
    REP(i, n) cin>>vc[i].f>>vc[i].s;
    sort(ALL(vc), cmp);
    int ans = -inf;
    REP(i, n){
        pbds_set<pii> toad;
        int burr = 0;
        FOR(j, i+1, n){
            if (SZ(toad) < m-2){
                toad.insert({-vc[j].f, j});
                burr += vc[j].f;
                continue;
            }  
            ans = max(ans, (burr+vc[i].f+vc[j].f)-2*(vc[j].s-vc[i].s));
            pii poo = *toad.find_by_order(m-3);
            toad.insert({-vc[j].f, j});
            pii np = *toad.find_by_order(m-3);
            if (np.s != poo.s){
                burr += poo.f;
                burr += vc[j].f;
            }
        }
    }
    cout<<ans<<endl;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 452 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 460 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 312 ms 612 KB Output is correct
39 Correct 344 ms 624 KB Output is correct
40 Correct 278 ms 620 KB Output is correct
41 Correct 270 ms 612 KB Output is correct
42 Correct 264 ms 604 KB Output is correct
43 Correct 242 ms 612 KB Output is correct
44 Correct 318 ms 628 KB Output is correct
45 Correct 334 ms 604 KB Output is correct
46 Correct 358 ms 640 KB Output is correct
47 Correct 336 ms 616 KB Output is correct
48 Correct 347 ms 628 KB Output is correct
49 Correct 319 ms 628 KB Output is correct
50 Correct 313 ms 600 KB Output is correct
51 Correct 308 ms 604 KB Output is correct
52 Correct 293 ms 612 KB Output is correct
53 Correct 301 ms 620 KB Output is correct
54 Correct 286 ms 604 KB Output is correct
55 Correct 275 ms 608 KB Output is correct
56 Correct 256 ms 604 KB Output is correct
57 Correct 260 ms 600 KB Output is correct
58 Correct 272 ms 628 KB Output is correct
59 Correct 204 ms 608 KB Output is correct
60 Correct 269 ms 612 KB Output is correct
61 Correct 221 ms 628 KB Output is correct
62 Correct 217 ms 604 KB Output is correct
63 Correct 252 ms 624 KB Output is correct
64 Correct 229 ms 620 KB Output is correct
65 Correct 305 ms 600 KB Output is correct
66 Correct 297 ms 608 KB Output is correct
67 Correct 318 ms 604 KB Output is correct
68 Correct 312 ms 628 KB Output is correct
69 Correct 278 ms 612 KB Output is correct
70 Correct 317 ms 604 KB Output is correct
71 Correct 331 ms 604 KB Output is correct
72 Correct 278 ms 604 KB Output is correct
73 Correct 319 ms 608 KB Output is correct
74 Correct 277 ms 600 KB Output is correct

Subtask #3
0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 452 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 460 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 312 ms 612 KB Output is correct
39 Correct 344 ms 624 KB Output is correct
40 Correct 278 ms 620 KB Output is correct
41 Correct 270 ms 612 KB Output is correct
42 Correct 264 ms 604 KB Output is correct
43 Correct 242 ms 612 KB Output is correct
44 Correct 318 ms 628 KB Output is correct
45 Correct 334 ms 604 KB Output is correct
46 Correct 358 ms 640 KB Output is correct
47 Correct 336 ms 616 KB Output is correct
48 Correct 347 ms 628 KB Output is correct
49 Correct 319 ms 628 KB Output is correct
50 Correct 313 ms 600 KB Output is correct
51 Correct 308 ms 604 KB Output is correct
52 Correct 293 ms 612 KB Output is correct
53 Correct 301 ms 620 KB Output is correct
54 Correct 286 ms 604 KB Output is correct
55 Correct 275 ms 608 KB Output is correct
56 Correct 256 ms 604 KB Output is correct
57 Correct 260 ms 600 KB Output is correct
58 Correct 272 ms 628 KB Output is correct
59 Correct 204 ms 608 KB Output is correct
60 Correct 269 ms 612 KB Output is correct
61 Correct 221 ms 628 KB Output is correct
62 Correct 217 ms 604 KB Output is correct
63 Correct 252 ms 624 KB Output is correct
64 Correct 229 ms 620 KB Output is correct
65 Correct 305 ms 600 KB Output is correct
66 Correct 297 ms 608 KB Output is correct
67 Correct 318 ms 604 KB Output is correct
68 Correct 312 ms 628 KB Output is correct
69 Correct 278 ms 612 KB Output is correct
70 Correct 317 ms 604 KB Output is correct
71 Correct 331 ms 604 KB Output is correct
72 Correct 278 ms 604 KB Output is correct
73 Correct 319 ms 608 KB Output is correct
74 Correct 277 ms 600 KB Output is correct
75 Execution timed out 4043 ms 18516 KB Time limit exceeded
76 Halted 0 ms 0 KB -