oj.uz

답안 #579488

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
579488 2022-06-19T08:54:57 Z Lucpp Two Dishes (JOI19_dishes) C++17
74 / 100
 3082 ms 96236 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int MAX = 1e6+2;

ll A[2][MAX], T[2][MAX], P[2][MAX];
int B[2][MAX];

struct Seg{
    vector<ll> S, O;
    vector<bool> lazy;
    int cap;
    void init(int n){
        for(cap = 1; cap < n; cap*=2);
        S.assign(2*cap, -INF);
        O.assign(2*cap, 0);
        lazy.assign(2*cap, false);
    }
    void push(int i){
        if(lazy[i]){
            S[2*i] += O[i];
            O[2*i] += O[i];
            lazy[2*i] = true;
            S[2*i+1] += O[i];
            O[2*i+1] += O[i];
            lazy[2*i+1] = true;
            O[i] = 0;
            lazy[i] = false;
        }
    }
    void add(int l, int r, ll v, int a, int b, int i){
        if(l <= a && b <= r){
            S[i] += v;
            O[i] += v;
            lazy[i] = true;
        }
        else if(b < l || r < a);
        else{
            push(i);
            int m = (a+b)/2;
            add(l, r, v, a, m, 2*i);
            add(l, r, v, m+1, b, 2*i+1);
            S[i] = max(S[2*i], S[2*i+1]);
        }
    }
    void add(int l, int r, ll v){add(l, r, v, 1, cap, 1);}
    void upd(int p, ll v, int a, int b, int i){
        if(a == b) S[i] = v;
        else{
            push(i);
            int m = (a+b)/2;
            if(p <= m) upd(p, v, a, m, 2*i);
            else upd(p, v, m+1, b, 2*i+1);
            S[i] = max(S[2*i], S[2*i+1]);
        }
    }
    void upd(int p, ll v){upd(p, v, 1, cap, 1);}
    ll qry(int l, int r, int a, int b, int i){
        if(l <= a && b <= r) return S[i];
        if(b < l || r < a) return -INF;
        push(i);
        int m = (a+b)/2;
        return max(qry(l, r, a, m, 2*i), qry(l, r, m+1, b, 2*i+1));
    }
    ll qry(int l, int r){return qry(l, r, 1, cap, 1);}
};

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    int n, m;
    cin >> n >> m;
    for(int i = 0; i < 2; i++){
        A[i][0] = P[i][0] = 0;
        for(int j = 1; j <= (i==0?n:m); j++){
            cin >> A[i][j] >> T[i][j] >> P[i][j];
            A[i][j] += A[i][j-1];
        }
    }
    
    for(int i = 0; i < 2; i++){
        B[i][0] = 0;
        int x = (i==0?m:n);
        for(int j = 1; j <= (i==0?n:m); j++){
            if(A[i][j] > T[i][j]) B[i][j] = -1;
            else if(A[i][j]+A[1-i][x] <= T[i][j]) B[i][j] = x;
            else B[i][j] = (int)(upper_bound(A[1-i], A[1-i]+x, T[i][j]-A[i][j])-A[1-i]-1);
        }
    }
    n++;
    B[0][n] = m;
    P[0][n] = 0;
    n++;

    vector<pair<int, int>> byH;
    for(int i = 1; i < n; i++) if(B[0][i] >= 0) byH.emplace_back(B[0][i], i);
    sort(byH.begin(), byH.end());

    ll sum = 0;
    for(int i = 0; i < n; ++i){
        if(B[0][i] >= 0) sum += P[0][i];
    }
    Seg seg; seg.init(n);
    seg.upd(1, sum);

    vector<int> todo;
    int lastH = 0;
    for(auto [h, i] : byH){
        if(lastH != h){
            for(int j : todo){
                seg.add(1, j, -P[0][j]);
            }
            todo.clear();
            for(int j = lastH+1; j <= h; j++){
                if(B[1][j] >= 0){
                    seg.add(1, B[1][j]+1, P[1][j]);
                }
            }
        }
        ll dp = seg.qry(1, i);
        seg.upd(i+1, dp);
        lastH = h;
        todo.push_back(i);
    }
    ll ans = seg.qry(n, n);
    cout << ans << "\n";
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 21040 KB Output is correct
2 Correct 315 ms 21188 KB Output is correct
3 Correct 253 ms 22992 KB Output is correct
4 Correct 259 ms 20368 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 309 ms 21128 KB Output is correct
7 Correct 72 ms 5752 KB Output is correct
8 Correct 142 ms 17404 KB Output is correct
9 Correct 271 ms 22940 KB Output is correct
10 Correct 296 ms 21184 KB Output is correct
11 Correct 217 ms 22940 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 300 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 532 KB Output is correct
19 Correct 3 ms 468 KB Output is correct
20 Correct 4 ms 468 KB Output is correct
21 Correct 3 ms 468 KB Output is correct
22 Correct 3 ms 596 KB Output is correct
23 Correct 3 ms 468 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 300 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 532 KB Output is correct
19 Correct 3 ms 468 KB Output is correct
20 Correct 4 ms 468 KB Output is correct
21 Correct 3 ms 468 KB Output is correct
22 Correct 3 ms 596 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 267 ms 22880 KB Output is correct
25 Correct 198 ms 21264 KB Output is correct
26 Correct 267 ms 21316 KB Output is correct
27 Correct 215 ms 21360 KB Output is correct
28 Correct 291 ms 22040 KB Output is correct
29 Correct 247 ms 22924 KB Output is correct
30 Correct 471 ms 21228 KB Output is correct
31 Correct 71 ms 5836 KB Output is correct
32 Correct 168 ms 16712 KB Output is correct
33 Correct 291 ms 20336 KB Output is correct
34 Correct 417 ms 21392 KB Output is correct
35 Correct 420 ms 21332 KB Output is correct
36 Correct 422 ms 21220 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 300 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 532 KB Output is correct
19 Correct 3 ms 468 KB Output is correct
20 Correct 4 ms 468 KB Output is correct
21 Correct 3 ms 468 KB Output is correct
22 Correct 3 ms 596 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 267 ms 22880 KB Output is correct
25 Correct 198 ms 21264 KB Output is correct
26 Correct 267 ms 21316 KB Output is correct
27 Correct 215 ms 21360 KB Output is correct
28 Correct 291 ms 22040 KB Output is correct
29 Correct 247 ms 22924 KB Output is correct
30 Correct 471 ms 21228 KB Output is correct
31 Correct 71 ms 5836 KB Output is correct
32 Correct 168 ms 16712 KB Output is correct
33 Correct 291 ms 20336 KB Output is correct
34 Correct 417 ms 21392 KB Output is correct
35 Correct 420 ms 21332 KB Output is correct
36 Correct 422 ms 21220 KB Output is correct
37 Correct 314 ms 21264 KB Output is correct
38 Correct 237 ms 21248 KB Output is correct
39 Correct 318 ms 21272 KB Output is correct
40 Correct 316 ms 21140 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 502 ms 21412 KB Output is correct
43 Correct 318 ms 20288 KB Output is correct
44 Correct 427 ms 21308 KB Output is correct
45 Correct 451 ms 21320 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 300 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 532 KB Output is correct
19 Correct 3 ms 468 KB Output is correct
20 Correct 4 ms 468 KB Output is correct
21 Correct 3 ms 468 KB Output is correct
22 Correct 3 ms 596 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 267 ms 22880 KB Output is correct
25 Correct 198 ms 21264 KB Output is correct
26 Correct 267 ms 21316 KB Output is correct
27 Correct 215 ms 21360 KB Output is correct
28 Correct 291 ms 22040 KB Output is correct
29 Correct 247 ms 22924 KB Output is correct
30 Correct 471 ms 21228 KB Output is correct
31 Correct 71 ms 5836 KB Output is correct
32 Correct 168 ms 16712 KB Output is correct
33 Correct 291 ms 20336 KB Output is correct
34 Correct 417 ms 21392 KB Output is correct
35 Correct 420 ms 21332 KB Output is correct
36 Correct 422 ms 21220 KB Output is correct
37 Correct 314 ms 21264 KB Output is correct
38 Correct 237 ms 21248 KB Output is correct
39 Correct 318 ms 21272 KB Output is correct
40 Correct 316 ms 21140 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 502 ms 21412 KB Output is correct
43 Correct 318 ms 20288 KB Output is correct
44 Correct 427 ms 21308 KB Output is correct
45 Correct 451 ms 21320 KB Output is correct
46 Correct 1676 ms 96172 KB Output is correct
47 Correct 1244 ms 96080 KB Output is correct
48 Correct 1676 ms 96040 KB Output is correct
49 Correct 1670 ms 96044 KB Output is correct
50 Correct 3082 ms 95960 KB Output is correct
51 Correct 1824 ms 90140 KB Output is correct
52 Correct 2394 ms 96236 KB Output is correct
53 Correct 2735 ms 95940 KB Output is correct

Subtask #7
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 21040 KB Output is correct
2 Correct 315 ms 21188 KB Output is correct
3 Correct 253 ms 22992 KB Output is correct
4 Correct 259 ms 20368 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 309 ms 21128 KB Output is correct
7 Correct 72 ms 5752 KB Output is correct
8 Correct 142 ms 17404 KB Output is correct
9 Correct 271 ms 22940 KB Output is correct
10 Correct 296 ms 21184 KB Output is correct
11 Correct 217 ms 22940 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 300 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 532 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 4 ms 468 KB Output is correct
32 Correct 3 ms 468 KB Output is correct
33 Correct 3 ms 596 KB Output is correct
34 Correct 3 ms 468 KB Output is correct
35 Correct 267 ms 22880 KB Output is correct
36 Correct 198 ms 21264 KB Output is correct
37 Correct 267 ms 21316 KB Output is correct
38 Correct 215 ms 21360 KB Output is correct
39 Correct 291 ms 22040 KB Output is correct
40 Correct 247 ms 22924 KB Output is correct
41 Correct 471 ms 21228 KB Output is correct
42 Correct 71 ms 5836 KB Output is correct
43 Correct 168 ms 16712 KB Output is correct
44 Correct 291 ms 20336 KB Output is correct
45 Correct 417 ms 21392 KB Output is correct
46 Correct 420 ms 21332 KB Output is correct
47 Correct 422 ms 21220 KB Output is correct
48 Correct 314 ms 21264 KB Output is correct
49 Correct 237 ms 21248 KB Output is correct
50 Correct 318 ms 21272 KB Output is correct
51 Correct 316 ms 21140 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 502 ms 21412 KB Output is correct
54 Correct 318 ms 20288 KB Output is correct
55 Correct 427 ms 21308 KB Output is correct
56 Correct 451 ms 21320 KB Output is correct
57 Correct 309 ms 21260 KB Output is correct
58 Incorrect 242 ms 21372 KB Output isn't correct
59 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 21040 KB Output is correct
2 Correct 315 ms 21188 KB Output is correct
3 Correct 253 ms 22992 KB Output is correct
4 Correct 259 ms 20368 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 309 ms 21128 KB Output is correct
7 Correct 72 ms 5752 KB Output is correct
8 Correct 142 ms 17404 KB Output is correct
9 Correct 271 ms 22940 KB Output is correct
10 Correct 296 ms 21184 KB Output is correct
11 Correct 217 ms 22940 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 300 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 532 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 4 ms 468 KB Output is correct
32 Correct 3 ms 468 KB Output is correct
33 Correct 3 ms 596 KB Output is correct
34 Correct 3 ms 468 KB Output is correct
35 Correct 267 ms 22880 KB Output is correct
36 Correct 198 ms 21264 KB Output is correct
37 Correct 267 ms 21316 KB Output is correct
38 Correct 215 ms 21360 KB Output is correct
39 Correct 291 ms 22040 KB Output is correct
40 Correct 247 ms 22924 KB Output is correct
41 Correct 471 ms 21228 KB Output is correct
42 Correct 71 ms 5836 KB Output is correct
43 Correct 168 ms 16712 KB Output is correct
44 Correct 291 ms 20336 KB Output is correct
45 Correct 417 ms 21392 KB Output is correct
46 Correct 420 ms 21332 KB Output is correct
47 Correct 422 ms 21220 KB Output is correct
48 Correct 314 ms 21264 KB Output is correct
49 Correct 237 ms 21248 KB Output is correct
50 Correct 318 ms 21272 KB Output is correct
51 Correct 316 ms 21140 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 502 ms 21412 KB Output is correct
54 Correct 318 ms 20288 KB Output is correct
55 Correct 427 ms 21308 KB Output is correct
56 Correct 451 ms 21320 KB Output is correct
57 Correct 1676 ms 96172 KB Output is correct
58 Correct 1244 ms 96080 KB Output is correct
59 Correct 1676 ms 96040 KB Output is correct
60 Correct 1670 ms 96044 KB Output is correct
61 Correct 3082 ms 95960 KB Output is correct
62 Correct 1824 ms 90140 KB Output is correct
63 Correct 2394 ms 96236 KB Output is correct
64 Correct 2735 ms 95940 KB Output is correct
65 Correct 309 ms 21260 KB Output is correct
66 Incorrect 242 ms 21372 KB Output isn't correct
67 Halted 0 ms 0 KB -