oj.uz

답안 #708790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
708790 2023-03-12T09:55:10 Z PixelCat Two Dishes (JOI19_dishes) C++14
65 / 100
 605 ms 58424 KB 
#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
#define eb emplace_back
#define int LL
using namespace std;
using LL = long long;
using pii = pair<int, int>;

// const int MAXN = 1000010;
const int MAXN = 200010;
const int INF = 8e18;

// range add, range max
#define L(id) ((id) * 2 + 1)
#define R(id) ((id) * 2 + 2)
struct SegTree {
    struct Node {
        int mx, add;
    } a[MAXN << 2];
    void init(int val) {
        For(i, 0, (MAXN << 2) - 1) {
            a[i].mx = val;
            a[i].add = 0;
        }
    }
    void _add(int id, int x) {
        a[id].add += x;
        a[id].mx += x;
    }
    void pull(int id) {
        a[id].mx = max(a[L(id)].mx, a[R(id)].mx);
    }
    void push(int id) {
        if(a[id].add != 0) {
            _add(L(id), a[id].add);
            _add(R(id), a[id].add);
            a[id].add = 0;
        }
    }
    void add(int id, int l, int r, int L, int R, int x) {
        // if(l > R || r < L) return;
        if(l >= L && r <= R) {
            _add(id, x);
            return;
        }
        push(id);
        int m = (l + r) / 2;
        if(L <= m) add(L(id), l, m, L, R, x);
        if(R > m)  add(R(id), m + 1, r, L, R, x);
        pull(id);
    }
    void set(int id, int l, int r, int i, int x) {
        if(l == r) {
            a[id].mx = x;
            a[id].add = 0;
            return;
        }
        push(id);
        int m = (l + r) / 2;
        if(i <= m) set(L(id), l, m, i, x);
        else       set(R(id), m + 1, r, i, x);
        pull(id);
    }
    int ask(int id, int l, int r, int L, int R) {
        if(l >= L && r <= R) return a[id].mx;
        push(id);
        int m = (l + r) / 2;
        int res = -INF;
        if(L <= m) res = max(res, ask(L(id), l, m, L, R));
        if(R > m)  res = max(res, ask(R(id), m + 1, r, L, R));
        return res;
    }
} seg, seg2, seg3;

int a1[MAXN];
int s1[MAXN];
int p1[MAXN];
int pr1[MAXN];
int t1[MAXN];

int a2[MAXN];
int s2[MAXN];
int p2[MAXN];
int pr2[MAXN];
int t2[MAXN];

// int su[MAXN][MAXN];
int dp[MAXN];

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // NYA =^-w-^=
    int n, m;
// #define QWQ
#ifndef QWQ
    cin >> n >> m;
    assert(n <= MAXN);
    For(i, 1, n) {
        cin >> a1[i] >> s1[i] >> p1[i];
        pr1[i] = pr1[i - 1] + a1[i];
    }
    For(i, 1, m) {
        cin >> a2[i] >> s2[i] >> p2[i];
        pr2[i] = pr2[i - 1] + a2[i];
    }
#else
    mt19937 rng(48763);
    n = m = 5;
    For(i, 1, n) {
        a1[i] = rng() % 10 + 1;
        s1[i] = rng() % 100 + 1;
        p1[i] = 1;
        pr1[i] = pr1[i - 1] + a1[i];
    }
    For(i, 1, m) {
        a2[i] = rng() % 10 + 1;
        s2[i] = rng() % 100 + 1;
        p2[i] = 1;
        pr2[i] = pr2[i - 1] + a2[i];
    }
#endif

    vector<pii> v;
    For(i, 1, n) {
        auto it = upper_bound(pr2, pr2 + m + 1, s1[i] - pr1[i]);
        t1[i] = it - pr2 - 1;
        if(t1[i] >= 0) v.eb(t1[i], i);
    }
    sort(all(v));
    reverse(all(v));
    
    For(i, 1, m) {
        auto it = upper_bound(pr1, pr1 + n + 1, s2[i] - pr2[i]);
        t2[i] = it - pr1 - 1;
    }
    
    seg.init(-INF);
    seg2.init(0);
    for(auto &i:v) {
        seg2.add(0, 0, n, i.S, n, p1[i.S]);
    }
    seg.set(0, 0, n, 0, 0);
    
    For(it, 0, m) {
        if(it && (t2[it] >= 0)) {
            seg.add(0, 0, n, 0, t2[it], p2[it]);
        }
        while(sz(v) && v.back().F == it) {
            int i = v.back().S;
            v.pop_back();

            seg2.add(0, 0, n, i, n, -p1[i]);
            seg.add(0, 0, n, i, n, p1[i]);
            
            int val = seg.ask(0, 0, n, 0, i - 1) + seg2.ask(0, 0, n, i, i) + p1[i];
            seg.set(0, 0, n, i, val - seg2.ask(0, 0, n, i, i));
        }
    }
    cout << seg.ask(0, 0, n, 0, n) << "\n";
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 347 ms 45240 KB Output is correct
2 Correct 373 ms 56500 KB Output is correct
3 Correct 351 ms 57120 KB Output is correct
4 Correct 299 ms 55592 KB Output is correct
5 Correct 10 ms 25332 KB Output is correct
6 Correct 356 ms 56340 KB Output is correct
7 Correct 88 ms 40028 KB Output is correct
8 Correct 264 ms 43480 KB Output is correct
9 Correct 359 ms 56844 KB Output is correct
10 Correct 331 ms 51640 KB Output is correct
11 Correct 287 ms 52036 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 25428 KB Output is correct
2 Correct 10 ms 25428 KB Output is correct
3 Correct 10 ms 25428 KB Output is correct
4 Correct 10 ms 25420 KB Output is correct
5 Correct 10 ms 25428 KB Output is correct
6 Correct 10 ms 25416 KB Output is correct
7 Correct 10 ms 25420 KB Output is correct
8 Correct 9 ms 25428 KB Output is correct
9 Correct 10 ms 25428 KB Output is correct
10 Correct 10 ms 25368 KB Output is correct
11 Correct 10 ms 25428 KB Output is correct
12 Correct 10 ms 25356 KB Output is correct
13 Correct 10 ms 25428 KB Output is correct
14 Correct 10 ms 25428 KB Output is correct
15 Correct 10 ms 25420 KB Output is correct
16 Correct 13 ms 25368 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 25428 KB Output is correct
2 Correct 10 ms 25428 KB Output is correct
3 Correct 10 ms 25428 KB Output is correct
4 Correct 10 ms 25420 KB Output is correct
5 Correct 10 ms 25428 KB Output is correct
6 Correct 10 ms 25416 KB Output is correct
7 Correct 10 ms 25420 KB Output is correct
8 Correct 9 ms 25428 KB Output is correct
9 Correct 10 ms 25428 KB Output is correct
10 Correct 10 ms 25368 KB Output is correct
11 Correct 10 ms 25428 KB Output is correct
12 Correct 10 ms 25356 KB Output is correct
13 Correct 10 ms 25428 KB Output is correct
14 Correct 10 ms 25428 KB Output is correct
15 Correct 10 ms 25420 KB Output is correct
16 Correct 13 ms 25368 KB Output is correct
17 Correct 13 ms 25684 KB Output is correct
18 Correct 12 ms 25684 KB Output is correct
19 Correct 13 ms 25684 KB Output is correct
20 Correct 14 ms 25696 KB Output is correct
21 Correct 17 ms 25716 KB Output is correct
22 Correct 13 ms 25684 KB Output is correct
23 Correct 13 ms 25684 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 25428 KB Output is correct
2 Correct 10 ms 25428 KB Output is correct
3 Correct 10 ms 25428 KB Output is correct
4 Correct 10 ms 25420 KB Output is correct
5 Correct 10 ms 25428 KB Output is correct
6 Correct 10 ms 25416 KB Output is correct
7 Correct 10 ms 25420 KB Output is correct
8 Correct 9 ms 25428 KB Output is correct
9 Correct 10 ms 25428 KB Output is correct
10 Correct 10 ms 25368 KB Output is correct
11 Correct 10 ms 25428 KB Output is correct
12 Correct 10 ms 25356 KB Output is correct
13 Correct 10 ms 25428 KB Output is correct
14 Correct 10 ms 25428 KB Output is correct
15 Correct 10 ms 25420 KB Output is correct
16 Correct 13 ms 25368 KB Output is correct
17 Correct 13 ms 25684 KB Output is correct
18 Correct 12 ms 25684 KB Output is correct
19 Correct 13 ms 25684 KB Output is correct
20 Correct 14 ms 25696 KB Output is correct
21 Correct 17 ms 25716 KB Output is correct
22 Correct 13 ms 25684 KB Output is correct
23 Correct 13 ms 25684 KB Output is correct
24 Correct 310 ms 45420 KB Output is correct
25 Correct 248 ms 43840 KB Output is correct
26 Correct 315 ms 45344 KB Output is correct
27 Correct 261 ms 43860 KB Output is correct
28 Correct 374 ms 44980 KB Output is correct
29 Correct 309 ms 45580 KB Output is correct
30 Correct 570 ms 45312 KB Output is correct
31 Correct 74 ms 34296 KB Output is correct
32 Correct 266 ms 37568 KB Output is correct
33 Correct 365 ms 43744 KB Output is correct
34 Correct 513 ms 45116 KB Output is correct
35 Correct 552 ms 45440 KB Output is correct
36 Correct 531 ms 45384 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 25428 KB Output is correct
2 Correct 10 ms 25428 KB Output is correct
3 Correct 10 ms 25428 KB Output is correct
4 Correct 10 ms 25420 KB Output is correct
5 Correct 10 ms 25428 KB Output is correct
6 Correct 10 ms 25416 KB Output is correct
7 Correct 10 ms 25420 KB Output is correct
8 Correct 9 ms 25428 KB Output is correct
9 Correct 10 ms 25428 KB Output is correct
10 Correct 10 ms 25368 KB Output is correct
11 Correct 10 ms 25428 KB Output is correct
12 Correct 10 ms 25356 KB Output is correct
13 Correct 10 ms 25428 KB Output is correct
14 Correct 10 ms 25428 KB Output is correct
15 Correct 10 ms 25420 KB Output is correct
16 Correct 13 ms 25368 KB Output is correct
17 Correct 13 ms 25684 KB Output is correct
18 Correct 12 ms 25684 KB Output is correct
19 Correct 13 ms 25684 KB Output is correct
20 Correct 14 ms 25696 KB Output is correct
21 Correct 17 ms 25716 KB Output is correct
22 Correct 13 ms 25684 KB Output is correct
23 Correct 13 ms 25684 KB Output is correct
24 Correct 310 ms 45420 KB Output is correct
25 Correct 248 ms 43840 KB Output is correct
26 Correct 315 ms 45344 KB Output is correct
27 Correct 261 ms 43860 KB Output is correct
28 Correct 374 ms 44980 KB Output is correct
29 Correct 309 ms 45580 KB Output is correct
30 Correct 570 ms 45312 KB Output is correct
31 Correct 74 ms 34296 KB Output is correct
32 Correct 266 ms 37568 KB Output is correct
33 Correct 365 ms 43744 KB Output is correct
34 Correct 513 ms 45116 KB Output is correct
35 Correct 552 ms 45440 KB Output is correct
36 Correct 531 ms 45384 KB Output is correct
37 Correct 351 ms 45300 KB Output is correct
38 Correct 308 ms 56392 KB Output is correct
39 Correct 363 ms 55224 KB Output is correct
40 Correct 365 ms 55276 KB Output is correct
41 Correct 14 ms 25428 KB Output is correct
42 Correct 605 ms 58028 KB Output is correct
43 Correct 376 ms 55872 KB Output is correct
44 Correct 548 ms 57340 KB Output is correct
45 Correct 579 ms 51512 KB Output is correct

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 25428 KB Output is correct
2 Correct 10 ms 25428 KB Output is correct
3 Correct 10 ms 25428 KB Output is correct
4 Correct 10 ms 25420 KB Output is correct
5 Correct 10 ms 25428 KB Output is correct
6 Correct 10 ms 25416 KB Output is correct
7 Correct 10 ms 25420 KB Output is correct
8 Correct 9 ms 25428 KB Output is correct
9 Correct 10 ms 25428 KB Output is correct
10 Correct 10 ms 25368 KB Output is correct
11 Correct 10 ms 25428 KB Output is correct
12 Correct 10 ms 25356 KB Output is correct
13 Correct 10 ms 25428 KB Output is correct
14 Correct 10 ms 25428 KB Output is correct
15 Correct 10 ms 25420 KB Output is correct
16 Correct 13 ms 25368 KB Output is correct
17 Correct 13 ms 25684 KB Output is correct
18 Correct 12 ms 25684 KB Output is correct
19 Correct 13 ms 25684 KB Output is correct
20 Correct 14 ms 25696 KB Output is correct
21 Correct 17 ms 25716 KB Output is correct
22 Correct 13 ms 25684 KB Output is correct
23 Correct 13 ms 25684 KB Output is correct
24 Correct 310 ms 45420 KB Output is correct
25 Correct 248 ms 43840 KB Output is correct
26 Correct 315 ms 45344 KB Output is correct
27 Correct 261 ms 43860 KB Output is correct
28 Correct 374 ms 44980 KB Output is correct
29 Correct 309 ms 45580 KB Output is correct
30 Correct 570 ms 45312 KB Output is correct
31 Correct 74 ms 34296 KB Output is correct
32 Correct 266 ms 37568 KB Output is correct
33 Correct 365 ms 43744 KB Output is correct
34 Correct 513 ms 45116 KB Output is correct
35 Correct 552 ms 45440 KB Output is correct
36 Correct 531 ms 45384 KB Output is correct
37 Correct 351 ms 45300 KB Output is correct
38 Correct 308 ms 56392 KB Output is correct
39 Correct 363 ms 55224 KB Output is correct
40 Correct 365 ms 55276 KB Output is correct
41 Correct 14 ms 25428 KB Output is correct
42 Correct 605 ms 58028 KB Output is correct
43 Correct 376 ms 55872 KB Output is correct
44 Correct 548 ms 57340 KB Output is correct
45 Correct 579 ms 51512 KB Output is correct
46 Runtime error 2 ms 468 KB Execution killed with signal 6
47 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 347 ms 45240 KB Output is correct
2 Correct 373 ms 56500 KB Output is correct
3 Correct 351 ms 57120 KB Output is correct
4 Correct 299 ms 55592 KB Output is correct
5 Correct 10 ms 25332 KB Output is correct
6 Correct 356 ms 56340 KB Output is correct
7 Correct 88 ms 40028 KB Output is correct
8 Correct 264 ms 43480 KB Output is correct
9 Correct 359 ms 56844 KB Output is correct
10 Correct 331 ms 51640 KB Output is correct
11 Correct 287 ms 52036 KB Output is correct
12 Correct 11 ms 25428 KB Output is correct
13 Correct 10 ms 25428 KB Output is correct
14 Correct 10 ms 25428 KB Output is correct
15 Correct 10 ms 25420 KB Output is correct
16 Correct 10 ms 25428 KB Output is correct
17 Correct 10 ms 25416 KB Output is correct
18 Correct 10 ms 25420 KB Output is correct
19 Correct 9 ms 25428 KB Output is correct
20 Correct 10 ms 25428 KB Output is correct
21 Correct 10 ms 25368 KB Output is correct
22 Correct 10 ms 25428 KB Output is correct
23 Correct 10 ms 25356 KB Output is correct
24 Correct 10 ms 25428 KB Output is correct
25 Correct 10 ms 25428 KB Output is correct
26 Correct 10 ms 25420 KB Output is correct
27 Correct 13 ms 25368 KB Output is correct
28 Correct 13 ms 25684 KB Output is correct
29 Correct 12 ms 25684 KB Output is correct
30 Correct 13 ms 25684 KB Output is correct
31 Correct 14 ms 25696 KB Output is correct
32 Correct 17 ms 25716 KB Output is correct
33 Correct 13 ms 25684 KB Output is correct
34 Correct 13 ms 25684 KB Output is correct
35 Correct 310 ms 45420 KB Output is correct
36 Correct 248 ms 43840 KB Output is correct
37 Correct 315 ms 45344 KB Output is correct
38 Correct 261 ms 43860 KB Output is correct
39 Correct 374 ms 44980 KB Output is correct
40 Correct 309 ms 45580 KB Output is correct
41 Correct 570 ms 45312 KB Output is correct
42 Correct 74 ms 34296 KB Output is correct
43 Correct 266 ms 37568 KB Output is correct
44 Correct 365 ms 43744 KB Output is correct
45 Correct 513 ms 45116 KB Output is correct
46 Correct 552 ms 45440 KB Output is correct
47 Correct 531 ms 45384 KB Output is correct
48 Correct 351 ms 45300 KB Output is correct
49 Correct 308 ms 56392 KB Output is correct
50 Correct 363 ms 55224 KB Output is correct
51 Correct 365 ms 55276 KB Output is correct
52 Correct 14 ms 25428 KB Output is correct
53 Correct 605 ms 58028 KB Output is correct
54 Correct 376 ms 55872 KB Output is correct
55 Correct 548 ms 57340 KB Output is correct
56 Correct 579 ms 51512 KB Output is correct
57 Correct 371 ms 58424 KB Output is correct
58 Incorrect 311 ms 56836 KB Output isn't correct
59 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 347 ms 45240 KB Output is correct
2 Correct 373 ms 56500 KB Output is correct
3 Correct 351 ms 57120 KB Output is correct
4 Correct 299 ms 55592 KB Output is correct
5 Correct 10 ms 25332 KB Output is correct
6 Correct 356 ms 56340 KB Output is correct
7 Correct 88 ms 40028 KB Output is correct
8 Correct 264 ms 43480 KB Output is correct
9 Correct 359 ms 56844 KB Output is correct
10 Correct 331 ms 51640 KB Output is correct
11 Correct 287 ms 52036 KB Output is correct
12 Correct 11 ms 25428 KB Output is correct
13 Correct 10 ms 25428 KB Output is correct
14 Correct 10 ms 25428 KB Output is correct
15 Correct 10 ms 25420 KB Output is correct
16 Correct 10 ms 25428 KB Output is correct
17 Correct 10 ms 25416 KB Output is correct
18 Correct 10 ms 25420 KB Output is correct
19 Correct 9 ms 25428 KB Output is correct
20 Correct 10 ms 25428 KB Output is correct
21 Correct 10 ms 25368 KB Output is correct
22 Correct 10 ms 25428 KB Output is correct
23 Correct 10 ms 25356 KB Output is correct
24 Correct 10 ms 25428 KB Output is correct
25 Correct 10 ms 25428 KB Output is correct
26 Correct 10 ms 25420 KB Output is correct
27 Correct 13 ms 25368 KB Output is correct
28 Correct 13 ms 25684 KB Output is correct
29 Correct 12 ms 25684 KB Output is correct
30 Correct 13 ms 25684 KB Output is correct
31 Correct 14 ms 25696 KB Output is correct
32 Correct 17 ms 25716 KB Output is correct
33 Correct 13 ms 25684 KB Output is correct
34 Correct 13 ms 25684 KB Output is correct
35 Correct 310 ms 45420 KB Output is correct
36 Correct 248 ms 43840 KB Output is correct
37 Correct 315 ms 45344 KB Output is correct
38 Correct 261 ms 43860 KB Output is correct
39 Correct 374 ms 44980 KB Output is correct
40 Correct 309 ms 45580 KB Output is correct
41 Correct 570 ms 45312 KB Output is correct
42 Correct 74 ms 34296 KB Output is correct
43 Correct 266 ms 37568 KB Output is correct
44 Correct 365 ms 43744 KB Output is correct
45 Correct 513 ms 45116 KB Output is correct
46 Correct 552 ms 45440 KB Output is correct
47 Correct 531 ms 45384 KB Output is correct
48 Correct 351 ms 45300 KB Output is correct
49 Correct 308 ms 56392 KB Output is correct
50 Correct 363 ms 55224 KB Output is correct
51 Correct 365 ms 55276 KB Output is correct
52 Correct 14 ms 25428 KB Output is correct
53 Correct 605 ms 58028 KB Output is correct
54 Correct 376 ms 55872 KB Output is correct
55 Correct 548 ms 57340 KB Output is correct
56 Correct 579 ms 51512 KB Output is correct
57 Runtime error 2 ms 468 KB Execution killed with signal 6
58 Halted 0 ms 0 KB -