oj.uz

Submission #246904

# Submission time Handle Problem Language Result Execution time Memory
246904 2020-07-10T13:48:32 Z sealnot123 Two Dishes (JOI19_dishes) C++14
82 / 100
 10000 ms 182116 KB 
#include<bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(),(a).end()
#define SZ(a) (int)(a).size()
#define FOR(i, a, b) for(int i=(a); i<=(b); ++i)
#define iFOR(i, a, b) for(int i=(a); i>=(b); --i)
#define make_unique(a) sort(all((a))), (a).resize(unique(all((a)))-(a).begin())

using namespace std;

typedef pair<int,int> PII;
typedef long long LL;
typedef double DD;
typedef long double LD;
typedef pair<LL,LL> PLL;
typedef pair<DD,DD> PDD;
typedef vector<int> VI;
typedef vector<LL> VL;

const LL inf = 1e18;
const int N = 1000005;
LL n;
LL seg[N<<2], lazy[N<<2], label[N<<2];
LL fastMax(LL x, LL y) { return (((y-x)>>(63))&(x^y))^y; }
int fastMin(int x, int y) { return (((y-x)>>(31))&(x^y))^x; }
void push_add(int l, int r, int nw){
    seg[nw] += lazy[nw];
    if(l != r){
        lazy[nw<<1] += lazy[nw], lazy[nw<<1|1] += lazy[nw];
    }
    lazy[nw] = 0;
}
void push_label(int l, int r, int nw){
    seg[nw] = label[nw];
    if(l != r){
        lazy[nw<<1] = lazy[nw<<1|1] = 0;
        label[nw<<1] = label[nw<<1|1] = label[nw];
    }
    label[nw] = inf;
}
void paste(int ll, int rr, LL v, int l = 0, int r = n, int nw = 1){
    if(label[nw] != inf) push_label(l, r, nw);
    if(lazy[nw] != 0) push_add(l, r, nw);
    if(ll > rr || l > rr || r < ll) return ;
    if(l >= ll && r <= rr){
        label[nw] = v;
        push_label(l, r, nw); 
        return ;
    }
    int m = (l+r)>>1;
    paste(ll, rr, v, l, m, nw<<1);
    paste(ll, rr, v, m+1, r, nw<<1|1);
    seg[nw] = fastMax(seg[nw<<1], seg[nw<<1|1]);
}
void add(int ll, int rr, LL v, int l = 0, int r = n, int nw = 1){
    if(label[nw] != inf) push_label(l, r, nw);
    if(lazy[nw] != 0) push_add(l, r, nw);
    if(l > r || ll > rr || l > rr || r < ll) return ;
    if(l >= ll && r <= rr){
        lazy[nw] = v;
        push_add(l, r, nw);
        return ;
    }
    int m = (l+r)>>1;
    add(ll, rr, v, l, m, nw<<1);
    add(ll, rr, v, m+1, r, nw<<1|1);
    seg[nw] = fastMax(seg[nw<<1], seg[nw<<1|1]);
}
int search(int ll, int rr, LL v, int l = 0, int r = n, int nw = 1){
    if(label[nw] != inf) push_label(l, r, nw);
    if(lazy[nw] != 0) push_add(l, r, nw);
    if(l > rr || r < ll) return rr+1;
    if(l == r){
        if(seg[nw] >= v) return l;
        return rr+1;
    }
    int m = (l+r)>>1;
    if(l >= ll && r <= rr){
        if(label[nw<<1] != inf) push_label(l, m, nw<<1);
        if(lazy[nw<<1] != 0) push_add(l, m, nw<<1);
        if(seg[nw<<1] >= v) return search(ll, rr, v, l, m, nw<<1);
        return search(ll, rr, v, m+1, r, nw<<1|1);
    }
    return fastMin( search(ll, rr, v, l, m, nw<<1), search(ll, rr, v, m+1, r, nw<<1|1));
}
LL get(int idx, int l = 0, int r = n, int nw = 1){
    if(label[nw] != inf) push_label(l, r, nw);
    if(lazy[nw] != 0) push_add(l, r, nw);
    if(l == r) return seg[nw];
    int m = (l+r)>>1;
    if(idx <= m) return get(idx, l, m, nw<<1);
    return get(idx, m+1, r, nw<<1|1);
}

LL A[N], B[N];
LL S[N], T[N];
LL P[N], Q[N];
vector< PLL > sweep[N];
LL m;
void fastscan(LL &x)
{
    bool neg=false;
    register LL c;
    c=getchar();
    if(c=='-')
    {
        neg = true;
        c=getchar();
    }
    for(;(c>47 && c<58);c=getchar())
        x = (x<<1) + (x<<3) +c -48;
    if(neg)
        x *=-1;
} 
void evaluate(PLL a, PLL b){
    int now = a.x;
    LL upd = a.y;
    int nxt = b.x;
    add(now+1, n, upd);
    // printf("##"); seg.print(); puts("");
    if(now == nxt) return ;
    LL value = get(now);
    int stop_point = search(now+1, nxt, value)-1;
    //printf("j %d (%d, %d) %lld stop = %d\n",j,now,nxt,value,stop_point);
    if(stop_point > now) paste(now+1, stop_point, value);
}
int main(){
    fastscan(n); fastscan(m);
    FOR(i, 1, n) fastscan(A[i]), fastscan(S[i]), fastscan(P[i]), A[i] += A[i-1];
    FOR(i, 1, m) fastscan(B[i]), fastscan(T[i]), fastscan(Q[i]), B[i] += B[i-1];
    FOR(i, 1, (n+1)<<2) label[i] = inf;
    FOR(i, 1, n){
        int pA = upper_bound(B, B+1+m, S[i]-A[i]) - B - 1;
        if(pA == -1) continue;
        sweep[pA+1].pb(PLL(i-1, P[i]));
    }
    //seg.print(); puts("");
    FOR(i, 1, m){
        int pB = upper_bound(A, A+1+n, T[i]-B[i]) - A - 1;
        int ch = 0;
        if(pB != -1) add(0, pB, Q[i]), ch = 1;
        //printf("#"); seg.print(); puts("");
        sweep[i].pb( PLL(n, 0) );
        //printf("sweep: "); for(PLL e : sweep[i]) printf("(%lld, %lld) ",e.x,e.y);
        //puts("");
        if(ch && sweep[i][0].x > pB){
            evaluate(PLL(pB, 0), sweep[i][0]);
            ch = 0;
        }
        FOR(j, 0, SZ(sweep[i])-2){
            if(ch && sweep[i][j].x < pB && pB < sweep[i][j+1].x){
                evaluate(sweep[i][j], PLL(pB, 0));
                evaluate(PLL(pB, 0), sweep[i][j+1]);
                ch = 0;
            }else{
                evaluate(sweep[i][j], sweep[i][j+1]);
            }
        }
        sweep[i].clear();
        //seg.print(); puts("");
    }
    //puts("");
    for(PLL e : sweep[m+1]) add(e.x+1, n, e.y);
    printf("%lld",get(n));
	return 0;
}
/*
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *
 */

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 613 ms 57208 KB Output is correct
2 Correct 536 ms 58232 KB Output is correct
3 Correct 281 ms 57576 KB Output is correct
4 Correct 471 ms 53300 KB Output is correct
5 Correct 18 ms 23808 KB Output is correct
6 Correct 535 ms 57104 KB Output is correct
7 Correct 121 ms 35192 KB Output is correct
8 Correct 171 ms 46556 KB Output is correct
9 Correct 289 ms 57548 KB Output is correct
10 Correct 477 ms 57720 KB Output is correct
11 Correct 204 ms 57564 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 20 ms 23968 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 18 ms 23936 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 19 ms 23936 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 19 ms 23808 KB Output is correct
11 Correct 18 ms 23936 KB Output is correct
12 Correct 18 ms 23936 KB Output is correct
13 Correct 18 ms 23936 KB Output is correct
14 Correct 19 ms 23936 KB Output is correct
15 Correct 20 ms 23936 KB Output is correct
16 Correct 20 ms 23808 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 20 ms 23968 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 18 ms 23936 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 19 ms 23936 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 19 ms 23808 KB Output is correct
11 Correct 18 ms 23936 KB Output is correct
12 Correct 18 ms 23936 KB Output is correct
13 Correct 18 ms 23936 KB Output is correct
14 Correct 19 ms 23936 KB Output is correct
15 Correct 20 ms 23936 KB Output is correct
16 Correct 20 ms 23808 KB Output is correct
17 Correct 23 ms 24320 KB Output is correct
18 Correct 23 ms 24320 KB Output is correct
19 Correct 27 ms 24320 KB Output is correct
20 Correct 23 ms 24192 KB Output is correct
21 Correct 24 ms 24320 KB Output is correct
22 Correct 24 ms 24192 KB Output is correct
23 Correct 24 ms 24192 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 20 ms 23968 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 18 ms 23936 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 19 ms 23936 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 19 ms 23808 KB Output is correct
11 Correct 18 ms 23936 KB Output is correct
12 Correct 18 ms 23936 KB Output is correct
13 Correct 18 ms 23936 KB Output is correct
14 Correct 19 ms 23936 KB Output is correct
15 Correct 20 ms 23936 KB Output is correct
16 Correct 20 ms 23808 KB Output is correct
17 Correct 23 ms 24320 KB Output is correct
18 Correct 23 ms 24320 KB Output is correct
19 Correct 27 ms 24320 KB Output is correct
20 Correct 23 ms 24192 KB Output is correct
21 Correct 24 ms 24320 KB Output is correct
22 Correct 24 ms 24192 KB Output is correct
23 Correct 24 ms 24192 KB Output is correct
24 Correct 304 ms 57820 KB Output is correct
25 Correct 613 ms 56164 KB Output is correct
26 Correct 422 ms 57780 KB Output is correct
27 Correct 526 ms 56164 KB Output is correct
28 Correct 545 ms 57400 KB Output is correct
29 Correct 257 ms 57696 KB Output is correct
30 Correct 1508 ms 58488 KB Output is correct
31 Correct 112 ms 35320 KB Output is correct
32 Correct 192 ms 46760 KB Output is correct
33 Correct 829 ms 56188 KB Output is correct
34 Correct 1110 ms 58140 KB Output is correct
35 Correct 1379 ms 58188 KB Output is correct
36 Correct 1360 ms 58380 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 20 ms 23968 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 18 ms 23936 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 19 ms 23936 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 19 ms 23808 KB Output is correct
11 Correct 18 ms 23936 KB Output is correct
12 Correct 18 ms 23936 KB Output is correct
13 Correct 18 ms 23936 KB Output is correct
14 Correct 19 ms 23936 KB Output is correct
15 Correct 20 ms 23936 KB Output is correct
16 Correct 20 ms 23808 KB Output is correct
17 Correct 23 ms 24320 KB Output is correct
18 Correct 23 ms 24320 KB Output is correct
19 Correct 27 ms 24320 KB Output is correct
20 Correct 23 ms 24192 KB Output is correct
21 Correct 24 ms 24320 KB Output is correct
22 Correct 24 ms 24192 KB Output is correct
23 Correct 24 ms 24192 KB Output is correct
24 Correct 304 ms 57820 KB Output is correct
25 Correct 613 ms 56164 KB Output is correct
26 Correct 422 ms 57780 KB Output is correct
27 Correct 526 ms 56164 KB Output is correct
28 Correct 545 ms 57400 KB Output is correct
29 Correct 257 ms 57696 KB Output is correct
30 Correct 1508 ms 58488 KB Output is correct
31 Correct 112 ms 35320 KB Output is correct
32 Correct 192 ms 46760 KB Output is correct
33 Correct 829 ms 56188 KB Output is correct
34 Correct 1110 ms 58140 KB Output is correct
35 Correct 1379 ms 58188 KB Output is correct
36 Correct 1360 ms 58380 KB Output is correct
37 Correct 463 ms 57636 KB Output is correct
38 Correct 598 ms 56164 KB Output is correct
39 Correct 603 ms 57716 KB Output is correct
40 Correct 493 ms 57688 KB Output is correct
41 Correct 19 ms 23928 KB Output is correct
42 Correct 1580 ms 58548 KB Output is correct
43 Correct 881 ms 56056 KB Output is correct
44 Correct 1130 ms 58088 KB Output is correct
45 Correct 1436 ms 58480 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 20 ms 23968 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 18 ms 23936 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 19 ms 23936 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 19 ms 23808 KB Output is correct
11 Correct 18 ms 23936 KB Output is correct
12 Correct 18 ms 23936 KB Output is correct
13 Correct 18 ms 23936 KB Output is correct
14 Correct 19 ms 23936 KB Output is correct
15 Correct 20 ms 23936 KB Output is correct
16 Correct 20 ms 23808 KB Output is correct
17 Correct 23 ms 24320 KB Output is correct
18 Correct 23 ms 24320 KB Output is correct
19 Correct 27 ms 24320 KB Output is correct
20 Correct 23 ms 24192 KB Output is correct
21 Correct 24 ms 24320 KB Output is correct
22 Correct 24 ms 24192 KB Output is correct
23 Correct 24 ms 24192 KB Output is correct
24 Correct 304 ms 57820 KB Output is correct
25 Correct 613 ms 56164 KB Output is correct
26 Correct 422 ms 57780 KB Output is correct
27 Correct 526 ms 56164 KB Output is correct
28 Correct 545 ms 57400 KB Output is correct
29 Correct 257 ms 57696 KB Output is correct
30 Correct 1508 ms 58488 KB Output is correct
31 Correct 112 ms 35320 KB Output is correct
32 Correct 192 ms 46760 KB Output is correct
33 Correct 829 ms 56188 KB Output is correct
34 Correct 1110 ms 58140 KB Output is correct
35 Correct 1379 ms 58188 KB Output is correct
36 Correct 1360 ms 58380 KB Output is correct
37 Correct 463 ms 57636 KB Output is correct
38 Correct 598 ms 56164 KB Output is correct
39 Correct 603 ms 57716 KB Output is correct
40 Correct 493 ms 57688 KB Output is correct
41 Correct 19 ms 23928 KB Output is correct
42 Correct 1580 ms 58548 KB Output is correct
43 Correct 881 ms 56056 KB Output is correct
44 Correct 1130 ms 58088 KB Output is correct
45 Correct 1436 ms 58480 KB Output is correct
46 Correct 2427 ms 182116 KB Output is correct
47 Correct 3180 ms 174188 KB Output is correct
48 Correct 3522 ms 182076 KB Output is correct
49 Correct 2582 ms 181944 KB Output is correct
50 Execution timed out 10033 ms 181716 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 613 ms 57208 KB Output is correct
2 Correct 536 ms 58232 KB Output is correct
3 Correct 281 ms 57576 KB Output is correct
4 Correct 471 ms 53300 KB Output is correct
5 Correct 18 ms 23808 KB Output is correct
6 Correct 535 ms 57104 KB Output is correct
7 Correct 121 ms 35192 KB Output is correct
8 Correct 171 ms 46556 KB Output is correct
9 Correct 289 ms 57548 KB Output is correct
10 Correct 477 ms 57720 KB Output is correct
11 Correct 204 ms 57564 KB Output is correct
12 Correct 19 ms 23936 KB Output is correct
13 Correct 19 ms 23808 KB Output is correct
14 Correct 20 ms 23968 KB Output is correct
15 Correct 19 ms 23808 KB Output is correct
16 Correct 18 ms 23936 KB Output is correct
17 Correct 18 ms 23808 KB Output is correct
18 Correct 19 ms 23936 KB Output is correct
19 Correct 19 ms 23808 KB Output is correct
20 Correct 19 ms 23808 KB Output is correct
21 Correct 19 ms 23808 KB Output is correct
22 Correct 18 ms 23936 KB Output is correct
23 Correct 18 ms 23936 KB Output is correct
24 Correct 18 ms 23936 KB Output is correct
25 Correct 19 ms 23936 KB Output is correct
26 Correct 20 ms 23936 KB Output is correct
27 Correct 20 ms 23808 KB Output is correct
28 Correct 23 ms 24320 KB Output is correct
29 Correct 23 ms 24320 KB Output is correct
30 Correct 27 ms 24320 KB Output is correct
31 Correct 23 ms 24192 KB Output is correct
32 Correct 24 ms 24320 KB Output is correct
33 Correct 24 ms 24192 KB Output is correct
34 Correct 24 ms 24192 KB Output is correct
35 Correct 304 ms 57820 KB Output is correct
36 Correct 613 ms 56164 KB Output is correct
37 Correct 422 ms 57780 KB Output is correct
38 Correct 526 ms 56164 KB Output is correct
39 Correct 545 ms 57400 KB Output is correct
40 Correct 257 ms 57696 KB Output is correct
41 Correct 1508 ms 58488 KB Output is correct
42 Correct 112 ms 35320 KB Output is correct
43 Correct 192 ms 46760 KB Output is correct
44 Correct 829 ms 56188 KB Output is correct
45 Correct 1110 ms 58140 KB Output is correct
46 Correct 1379 ms 58188 KB Output is correct
47 Correct 1360 ms 58380 KB Output is correct
48 Correct 463 ms 57636 KB Output is correct
49 Correct 598 ms 56164 KB Output is correct
50 Correct 603 ms 57716 KB Output is correct
51 Correct 493 ms 57688 KB Output is correct
52 Correct 19 ms 23928 KB Output is correct
53 Correct 1580 ms 58548 KB Output is correct
54 Correct 881 ms 56056 KB Output is correct
55 Correct 1130 ms 58088 KB Output is correct
56 Correct 1436 ms 58480 KB Output is correct
57 Correct 563 ms 57200 KB Output is correct
58 Correct 507 ms 55720 KB Output is correct
59 Correct 475 ms 57208 KB Output is correct
60 Correct 601 ms 57184 KB Output is correct
61 Correct 1257 ms 57920 KB Output is correct
62 Correct 19 ms 23808 KB Output is correct
63 Correct 1514 ms 57772 KB Output is correct
64 Correct 846 ms 55460 KB Output is correct
65 Correct 1277 ms 57352 KB Output is correct
66 Correct 1450 ms 57932 KB Output is correct

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 613 ms 57208 KB Output is correct
2 Correct 536 ms 58232 KB Output is correct
3 Correct 281 ms 57576 KB Output is correct
4 Correct 471 ms 53300 KB Output is correct
5 Correct 18 ms 23808 KB Output is correct
6 Correct 535 ms 57104 KB Output is correct
7 Correct 121 ms 35192 KB Output is correct
8 Correct 171 ms 46556 KB Output is correct
9 Correct 289 ms 57548 KB Output is correct
10 Correct 477 ms 57720 KB Output is correct
11 Correct 204 ms 57564 KB Output is correct
12 Correct 19 ms 23936 KB Output is correct
13 Correct 19 ms 23808 KB Output is correct
14 Correct 20 ms 23968 KB Output is correct
15 Correct 19 ms 23808 KB Output is correct
16 Correct 18 ms 23936 KB Output is correct
17 Correct 18 ms 23808 KB Output is correct
18 Correct 19 ms 23936 KB Output is correct
19 Correct 19 ms 23808 KB Output is correct
20 Correct 19 ms 23808 KB Output is correct
21 Correct 19 ms 23808 KB Output is correct
22 Correct 18 ms 23936 KB Output is correct
23 Correct 18 ms 23936 KB Output is correct
24 Correct 18 ms 23936 KB Output is correct
25 Correct 19 ms 23936 KB Output is correct
26 Correct 20 ms 23936 KB Output is correct
27 Correct 20 ms 23808 KB Output is correct
28 Correct 23 ms 24320 KB Output is correct
29 Correct 23 ms 24320 KB Output is correct
30 Correct 27 ms 24320 KB Output is correct
31 Correct 23 ms 24192 KB Output is correct
32 Correct 24 ms 24320 KB Output is correct
33 Correct 24 ms 24192 KB Output is correct
34 Correct 24 ms 24192 KB Output is correct
35 Correct 304 ms 57820 KB Output is correct
36 Correct 613 ms 56164 KB Output is correct
37 Correct 422 ms 57780 KB Output is correct
38 Correct 526 ms 56164 KB Output is correct
39 Correct 545 ms 57400 KB Output is correct
40 Correct 257 ms 57696 KB Output is correct
41 Correct 1508 ms 58488 KB Output is correct
42 Correct 112 ms 35320 KB Output is correct
43 Correct 192 ms 46760 KB Output is correct
44 Correct 829 ms 56188 KB Output is correct
45 Correct 1110 ms 58140 KB Output is correct
46 Correct 1379 ms 58188 KB Output is correct
47 Correct 1360 ms 58380 KB Output is correct
48 Correct 463 ms 57636 KB Output is correct
49 Correct 598 ms 56164 KB Output is correct
50 Correct 603 ms 57716 KB Output is correct
51 Correct 493 ms 57688 KB Output is correct
52 Correct 19 ms 23928 KB Output is correct
53 Correct 1580 ms 58548 KB Output is correct
54 Correct 881 ms 56056 KB Output is correct
55 Correct 1130 ms 58088 KB Output is correct
56 Correct 1436 ms 58480 KB Output is correct
57 Correct 2427 ms 182116 KB Output is correct
58 Correct 3180 ms 174188 KB Output is correct
59 Correct 3522 ms 182076 KB Output is correct
60 Correct 2582 ms 181944 KB Output is correct
61 Execution timed out 10033 ms 181716 KB Time limit exceeded
62 Halted 0 ms 0 KB -