oj.uz

답안 #944592

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
944592 2024-03-13T01:30:18 Z LOLOLO Two Dishes (JOI19_dishes) C++17
65 / 100
 541 ms 52340 KB 
#include <bits/stdc++.h>
typedef long long ll;
 
#define           f    first
#define           s    second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
 
using namespace std;
const int N = 2e5 + 10;
ll A[N], B[N], SA[N], SB[N], S[N], T[N], Q[N], P[N];
vector <pair <ll, ll>> pos[N];
struct ST{
    vector <ll> seg, laz, ass;
    ST(int n) {
        for (int i = 0; i <= n * 4 + 100; i++) {
            seg.pb(0);
            laz.pb(0);
        }
    }
 
    void push(int id) {
        ll &t = laz[id];
        laz[id * 2] += t;
        laz[id * 2 + 1] += t;
        seg[id * 2] += t;
        seg[id * 2 + 1] += t;
        t = 0;
    }
 
    void upd(int id, int l, int r, int u, int v, ll t) {
        if (l > v || r < u)
            return;
 
        if (l >= u && r <= v) {
            laz[id] += t;
            seg[id] += t;
            return;
        }
 
        push(id);
        int m = (l + r) / 2;
        upd(id * 2, l, m, u, v, t);
        upd(id * 2 + 1, m + 1, r, u, v, t);
        seg[id] = max(seg[id * 2], seg[id * 2 + 1]);
    }
 
    void point(int id, int l, int r, int p, ll v) {
        if (l > p || r < p)
            return;
 
        if (l == r) {
            seg[id] = max(seg[id], v);
            return;
        }
 
        push(id);
        int m = (l + r) / 2;
        point(id * 2, l, m, p, v);
        point(id * 2 + 1, m + 1, r, p, v);
        seg[id] = max(seg[id * 2], seg[id * 2 + 1]);
    }
 
    ll get(int id, int l, int r, int u, int v) {
        if (u > v || l > v || r < u)
            return -1e12;
 
        if (l >= u && r <= v)
            return seg[id];
 
        push(id);
        int m = (l + r) / 2;
        return max(get(id * 2, l, m, u, v), get(id * 2 + 1, m + 1, r, u, v));
    }
};
 
vector <pair <ll, ll>> compress(vector < pair <ll, ll>> &v) {
    vector <pair <ll, ll>> st;
    for (auto x : v) {
        if (st.empty() || st.back().f != x.f) {
            st.pb(x);
        } else {
            st[sz(st) - 1].s += x.s;
        }
    }
    return st;
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll ans = 0;
    int n, m;
    cin >> n >> m;
 
    for (int i = 1; i <= n; i++) {
        cin >> A[i] >> S[i] >> P[i];
        SA[i] = SA[i - 1] + A[i];
    }
 
    for (int i = 1; i <= m; i++) {
        cin >> B[i] >> T[i] >> Q[i];
        SB[i] = SB[i - 1] + B[i];
    }
 
    for (int i = 1; i <= n; i++) {
        if (SA[i] > S[i])
            continue;
        
        ans += P[i];
        int id = upper_bound(SB, SB + 1 + m, S[i] - SA[i]) - SB - 1;
        pos[i - 1].pb({id + 1, -P[i]});
    }
 
    for (int i = 1; i <= m; i++) {
        if (SB[i] > T[i])
            continue;
 
        int id = upper_bound(SA, SA + 1 + n, T[i] - SB[i]) - SA - 1;
        pos[id].pb({i, Q[i]});
    }
 
    for (int i = 1; i <= n; i++) {
        sort(all(pos[i]));
        pos[i] = compress(pos[i]);
    }
 
    ST seg(m + 10);
 
    int lx = 0;
    for (int i = 0; i <= n; i++) {
        ll cur = 0;
        for (auto x : pos[i]) {
            cur += x.s;
        }
 
        if (sz(pos[i])) {
            lx = pos[i].back().f;
        } else {
            lx = 0;
        }
 
        vector <pair <ll, ll>> save;
        for (int j = sz(pos[i]) - 1; j >= 0; j--) {
            ll t = seg.get(1, 0, m, 0, pos[i][j].f) + cur;
            save.pb({pos[i][j].f, t});
            seg.upd(1, 0, m, pos[i][j].f, m, pos[i][j].s);
            cur -= pos[i][j].s;
        }
 
        for (auto x : save) {
            seg.point(1, 0, m, x.f, x.s);
        }
    }
 
    cout << seg.get(1, 0, m, lx, m) + ans << '\n';
    return 0; 
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 275 ms 43884 KB Output is correct
2 Correct 279 ms 44524 KB Output is correct
3 Correct 230 ms 49136 KB Output is correct
4 Correct 200 ms 37076 KB Output is correct
5 Correct 2 ms 12888 KB Output is correct
6 Correct 271 ms 47208 KB Output is correct
7 Correct 144 ms 41428 KB Output is correct
8 Correct 75 ms 23284 KB Output is correct
9 Correct 232 ms 52340 KB Output is correct
10 Correct 252 ms 42300 KB Output is correct
11 Correct 196 ms 49680 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 3 ms 12888 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 3 ms 12888 KB Output is correct
6 Correct 3 ms 12888 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 3 ms 12924 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12888 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 3 ms 12892 KB Output is correct
16 Correct 2 ms 12888 KB Output is correct
17 Correct 5 ms 13148 KB Output is correct
18 Correct 5 ms 13148 KB Output is correct
19 Correct 5 ms 13148 KB Output is correct
20 Correct 4 ms 13148 KB Output is correct
21 Correct 5 ms 13400 KB Output is correct
22 Correct 5 ms 13148 KB Output is correct
23 Correct 6 ms 13148 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 3 ms 12888 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 3 ms 12888 KB Output is correct
6 Correct 3 ms 12888 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 3 ms 12924 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12888 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 3 ms 12892 KB Output is correct
16 Correct 2 ms 12888 KB Output is correct
17 Correct 5 ms 13148 KB Output is correct
18 Correct 5 ms 13148 KB Output is correct
19 Correct 5 ms 13148 KB Output is correct
20 Correct 4 ms 13148 KB Output is correct
21 Correct 5 ms 13400 KB Output is correct
22 Correct 5 ms 13148 KB Output is correct
23 Correct 6 ms 13148 KB Output is correct
24 Correct 287 ms 43824 KB Output is correct
25 Correct 206 ms 48848 KB Output is correct
26 Correct 263 ms 45524 KB Output is correct
27 Correct 229 ms 38992 KB Output is correct
28 Correct 271 ms 43308 KB Output is correct
29 Correct 214 ms 50416 KB Output is correct
30 Correct 541 ms 42696 KB Output is correct
31 Correct 151 ms 36256 KB Output is correct
32 Correct 69 ms 23376 KB Output is correct
33 Correct 271 ms 37288 KB Output is correct
34 Correct 396 ms 43096 KB Output is correct
35 Correct 436 ms 45316 KB Output is correct
36 Correct 425 ms 43180 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 3 ms 12888 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 3 ms 12888 KB Output is correct
6 Correct 3 ms 12888 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 3 ms 12924 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12888 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 3 ms 12892 KB Output is correct
16 Correct 2 ms 12888 KB Output is correct
17 Correct 5 ms 13148 KB Output is correct
18 Correct 5 ms 13148 KB Output is correct
19 Correct 5 ms 13148 KB Output is correct
20 Correct 4 ms 13148 KB Output is correct
21 Correct 5 ms 13400 KB Output is correct
22 Correct 5 ms 13148 KB Output is correct
23 Correct 6 ms 13148 KB Output is correct
24 Correct 287 ms 43824 KB Output is correct
25 Correct 206 ms 48848 KB Output is correct
26 Correct 263 ms 45524 KB Output is correct
27 Correct 229 ms 38992 KB Output is correct
28 Correct 271 ms 43308 KB Output is correct
29 Correct 214 ms 50416 KB Output is correct
30 Correct 541 ms 42696 KB Output is correct
31 Correct 151 ms 36256 KB Output is correct
32 Correct 69 ms 23376 KB Output is correct
33 Correct 271 ms 37288 KB Output is correct
34 Correct 396 ms 43096 KB Output is correct
35 Correct 436 ms 45316 KB Output is correct
36 Correct 425 ms 43180 KB Output is correct
37 Correct 288 ms 45260 KB Output is correct
38 Correct 249 ms 40444 KB Output is correct
39 Correct 235 ms 43068 KB Output is correct
40 Correct 237 ms 39612 KB Output is correct
41 Correct 2 ms 12892 KB Output is correct
42 Correct 489 ms 43552 KB Output is correct
43 Correct 308 ms 36140 KB Output is correct
44 Correct 400 ms 42240 KB Output is correct
45 Correct 458 ms 44364 KB Output is correct

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12892 KB Output is correct
2 Correct 3 ms 12888 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 3 ms 12888 KB Output is correct
6 Correct 3 ms 12888 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 3 ms 12924 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12888 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 3 ms 12892 KB Output is correct
16 Correct 2 ms 12888 KB Output is correct
17 Correct 5 ms 13148 KB Output is correct
18 Correct 5 ms 13148 KB Output is correct
19 Correct 5 ms 13148 KB Output is correct
20 Correct 4 ms 13148 KB Output is correct
21 Correct 5 ms 13400 KB Output is correct
22 Correct 5 ms 13148 KB Output is correct
23 Correct 6 ms 13148 KB Output is correct
24 Correct 287 ms 43824 KB Output is correct
25 Correct 206 ms 48848 KB Output is correct
26 Correct 263 ms 45524 KB Output is correct
27 Correct 229 ms 38992 KB Output is correct
28 Correct 271 ms 43308 KB Output is correct
29 Correct 214 ms 50416 KB Output is correct
30 Correct 541 ms 42696 KB Output is correct
31 Correct 151 ms 36256 KB Output is correct
32 Correct 69 ms 23376 KB Output is correct
33 Correct 271 ms 37288 KB Output is correct
34 Correct 396 ms 43096 KB Output is correct
35 Correct 436 ms 45316 KB Output is correct
36 Correct 425 ms 43180 KB Output is correct
37 Correct 288 ms 45260 KB Output is correct
38 Correct 249 ms 40444 KB Output is correct
39 Correct 235 ms 43068 KB Output is correct
40 Correct 237 ms 39612 KB Output is correct
41 Correct 2 ms 12892 KB Output is correct
42 Correct 489 ms 43552 KB Output is correct
43 Correct 308 ms 36140 KB Output is correct
44 Correct 400 ms 42240 KB Output is correct
45 Correct 458 ms 44364 KB Output is correct
46 Runtime error 62 ms 30292 KB Execution killed with signal 11
47 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 275 ms 43884 KB Output is correct
2 Correct 279 ms 44524 KB Output is correct
3 Correct 230 ms 49136 KB Output is correct
4 Correct 200 ms 37076 KB Output is correct
5 Correct 2 ms 12888 KB Output is correct
6 Correct 271 ms 47208 KB Output is correct
7 Correct 144 ms 41428 KB Output is correct
8 Correct 75 ms 23284 KB Output is correct
9 Correct 232 ms 52340 KB Output is correct
10 Correct 252 ms 42300 KB Output is correct
11 Correct 196 ms 49680 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 3 ms 12888 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 3 ms 12888 KB Output is correct
17 Correct 3 ms 12888 KB Output is correct
18 Correct 2 ms 12892 KB Output is correct
19 Correct 3 ms 12924 KB Output is correct
20 Correct 2 ms 12892 KB Output is correct
21 Correct 2 ms 12892 KB Output is correct
22 Correct 2 ms 12888 KB Output is correct
23 Correct 2 ms 12892 KB Output is correct
24 Correct 2 ms 12888 KB Output is correct
25 Correct 2 ms 12892 KB Output is correct
26 Correct 3 ms 12892 KB Output is correct
27 Correct 2 ms 12888 KB Output is correct
28 Correct 5 ms 13148 KB Output is correct
29 Correct 5 ms 13148 KB Output is correct
30 Correct 5 ms 13148 KB Output is correct
31 Correct 4 ms 13148 KB Output is correct
32 Correct 5 ms 13400 KB Output is correct
33 Correct 5 ms 13148 KB Output is correct
34 Correct 6 ms 13148 KB Output is correct
35 Correct 287 ms 43824 KB Output is correct
36 Correct 206 ms 48848 KB Output is correct
37 Correct 263 ms 45524 KB Output is correct
38 Correct 229 ms 38992 KB Output is correct
39 Correct 271 ms 43308 KB Output is correct
40 Correct 214 ms 50416 KB Output is correct
41 Correct 541 ms 42696 KB Output is correct
42 Correct 151 ms 36256 KB Output is correct
43 Correct 69 ms 23376 KB Output is correct
44 Correct 271 ms 37288 KB Output is correct
45 Correct 396 ms 43096 KB Output is correct
46 Correct 436 ms 45316 KB Output is correct
47 Correct 425 ms 43180 KB Output is correct
48 Correct 288 ms 45260 KB Output is correct
49 Correct 249 ms 40444 KB Output is correct
50 Correct 235 ms 43068 KB Output is correct
51 Correct 237 ms 39612 KB Output is correct
52 Correct 2 ms 12892 KB Output is correct
53 Correct 489 ms 43552 KB Output is correct
54 Correct 308 ms 36140 KB Output is correct
55 Correct 400 ms 42240 KB Output is correct
56 Correct 458 ms 44364 KB Output is correct
57 Correct 290 ms 44668 KB Output is correct
58 Correct 250 ms 37980 KB Output is correct
59 Incorrect 245 ms 40760 KB Output isn't correct
60 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 275 ms 43884 KB Output is correct
2 Correct 279 ms 44524 KB Output is correct
3 Correct 230 ms 49136 KB Output is correct
4 Correct 200 ms 37076 KB Output is correct
5 Correct 2 ms 12888 KB Output is correct
6 Correct 271 ms 47208 KB Output is correct
7 Correct 144 ms 41428 KB Output is correct
8 Correct 75 ms 23284 KB Output is correct
9 Correct 232 ms 52340 KB Output is correct
10 Correct 252 ms 42300 KB Output is correct
11 Correct 196 ms 49680 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 3 ms 12888 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 3 ms 12888 KB Output is correct
17 Correct 3 ms 12888 KB Output is correct
18 Correct 2 ms 12892 KB Output is correct
19 Correct 3 ms 12924 KB Output is correct
20 Correct 2 ms 12892 KB Output is correct
21 Correct 2 ms 12892 KB Output is correct
22 Correct 2 ms 12888 KB Output is correct
23 Correct 2 ms 12892 KB Output is correct
24 Correct 2 ms 12888 KB Output is correct
25 Correct 2 ms 12892 KB Output is correct
26 Correct 3 ms 12892 KB Output is correct
27 Correct 2 ms 12888 KB Output is correct
28 Correct 5 ms 13148 KB Output is correct
29 Correct 5 ms 13148 KB Output is correct
30 Correct 5 ms 13148 KB Output is correct
31 Correct 4 ms 13148 KB Output is correct
32 Correct 5 ms 13400 KB Output is correct
33 Correct 5 ms 13148 KB Output is correct
34 Correct 6 ms 13148 KB Output is correct
35 Correct 287 ms 43824 KB Output is correct
36 Correct 206 ms 48848 KB Output is correct
37 Correct 263 ms 45524 KB Output is correct
38 Correct 229 ms 38992 KB Output is correct
39 Correct 271 ms 43308 KB Output is correct
40 Correct 214 ms 50416 KB Output is correct
41 Correct 541 ms 42696 KB Output is correct
42 Correct 151 ms 36256 KB Output is correct
43 Correct 69 ms 23376 KB Output is correct
44 Correct 271 ms 37288 KB Output is correct
45 Correct 396 ms 43096 KB Output is correct
46 Correct 436 ms 45316 KB Output is correct
47 Correct 425 ms 43180 KB Output is correct
48 Correct 288 ms 45260 KB Output is correct
49 Correct 249 ms 40444 KB Output is correct
50 Correct 235 ms 43068 KB Output is correct
51 Correct 237 ms 39612 KB Output is correct
52 Correct 2 ms 12892 KB Output is correct
53 Correct 489 ms 43552 KB Output is correct
54 Correct 308 ms 36140 KB Output is correct
55 Correct 400 ms 42240 KB Output is correct
56 Correct 458 ms 44364 KB Output is correct
57 Runtime error 62 ms 30292 KB Execution killed with signal 11
58 Halted 0 ms 0 KB -