oj.uz

답안 #246886

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246886 2020-07-10T13:30:57 Z sealnot123 Two Dishes (JOI19_dishes) C++14
82 / 100
 10000 ms 214992 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;
} 
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;
        if(pB != -1) add(0, pB, Q[i]), sweep[i].pb( PLL(pB, 0) );
        //printf("#"); seg.print(); puts("");
        sweep[i].pb( PLL(n, 0) );
        sort( all( sweep[i] ) );
        //printf("sweep: "); for(PLL e : sweep[i]) printf("(%lld, %lld) ",e.x,e.y);
        //puts("");
        FOR(j, 0, SZ(sweep[i])-2){
            int now = sweep[i][j].x;
            LL upd = sweep[i][j].y;
            int nxt = sweep[i][j+1].x;
            add(now+1, n, upd);
            // printf("##"); seg.print(); puts("");
            if(now == nxt) continue;
            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);
        }
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 671 ms 60976 KB Output is correct
2 Correct 576 ms 62064 KB Output is correct
3 Correct 289 ms 63452 KB Output is correct
4 Correct 503 ms 59696 KB Output is correct
5 Correct 19 ms 23808 KB Output is correct
6 Correct 550 ms 64108 KB Output is correct
7 Correct 138 ms 40952 KB Output is correct
8 Correct 180 ms 49452 KB Output is correct
9 Correct 315 ms 63452 KB Output is correct
10 Correct 555 ms 66812 KB Output is correct
11 Correct 219 ms 63452 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 19 ms 23936 KB Output is correct
3 Correct 19 ms 23808 KB Output is correct
4 Correct 19 ms 23936 KB Output is correct
5 Correct 18 ms 23808 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 20 ms 23808 KB Output is correct
8 Correct 18 ms 23936 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 18 ms 23896 KB Output is correct
11 Correct 19 ms 23808 KB Output is correct
12 Correct 19 ms 23936 KB Output is correct
13 Correct 20 ms 23840 KB Output is correct
14 Correct 18 ms 23808 KB Output is correct
15 Correct 19 ms 23808 KB Output is correct
16 Correct 19 ms 23808 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 19 ms 23936 KB Output is correct
3 Correct 19 ms 23808 KB Output is correct
4 Correct 19 ms 23936 KB Output is correct
5 Correct 18 ms 23808 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 20 ms 23808 KB Output is correct
8 Correct 18 ms 23936 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 18 ms 23896 KB Output is correct
11 Correct 19 ms 23808 KB Output is correct
12 Correct 19 ms 23936 KB Output is correct
13 Correct 20 ms 23840 KB Output is correct
14 Correct 18 ms 23808 KB Output is correct
15 Correct 19 ms 23808 KB Output is correct
16 Correct 19 ms 23808 KB Output is correct
17 Correct 23 ms 24320 KB Output is correct
18 Correct 25 ms 24320 KB Output is correct
19 Correct 25 ms 24320 KB Output is correct
20 Correct 22 ms 24320 KB Output is correct
21 Correct 29 ms 24312 KB Output is correct
22 Correct 25 ms 24320 KB Output is correct
23 Correct 24 ms 24320 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 19 ms 23936 KB Output is correct
3 Correct 19 ms 23808 KB Output is correct
4 Correct 19 ms 23936 KB Output is correct
5 Correct 18 ms 23808 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 20 ms 23808 KB Output is correct
8 Correct 18 ms 23936 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 18 ms 23896 KB Output is correct
11 Correct 19 ms 23808 KB Output is correct
12 Correct 19 ms 23936 KB Output is correct
13 Correct 20 ms 23840 KB Output is correct
14 Correct 18 ms 23808 KB Output is correct
15 Correct 19 ms 23808 KB Output is correct
16 Correct 19 ms 23808 KB Output is correct
17 Correct 23 ms 24320 KB Output is correct
18 Correct 25 ms 24320 KB Output is correct
19 Correct 25 ms 24320 KB Output is correct
20 Correct 22 ms 24320 KB Output is correct
21 Correct 29 ms 24312 KB Output is correct
22 Correct 25 ms 24320 KB Output is correct
23 Correct 24 ms 24320 KB Output is correct
24 Correct 317 ms 62044 KB Output is correct
25 Correct 594 ms 61924 KB Output is correct
26 Correct 436 ms 63608 KB Output is correct
27 Correct 572 ms 62052 KB Output is correct
28 Correct 568 ms 63556 KB Output is correct
29 Correct 261 ms 63452 KB Output is correct
30 Correct 1599 ms 66040 KB Output is correct
31 Correct 130 ms 41208 KB Output is correct
32 Correct 211 ms 49448 KB Output is correct
33 Correct 857 ms 60724 KB Output is correct
34 Correct 1176 ms 64996 KB Output is correct
35 Correct 1578 ms 65708 KB Output is correct
36 Correct 1464 ms 65660 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 19 ms 23936 KB Output is correct
3 Correct 19 ms 23808 KB Output is correct
4 Correct 19 ms 23936 KB Output is correct
5 Correct 18 ms 23808 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 20 ms 23808 KB Output is correct
8 Correct 18 ms 23936 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 18 ms 23896 KB Output is correct
11 Correct 19 ms 23808 KB Output is correct
12 Correct 19 ms 23936 KB Output is correct
13 Correct 20 ms 23840 KB Output is correct
14 Correct 18 ms 23808 KB Output is correct
15 Correct 19 ms 23808 KB Output is correct
16 Correct 19 ms 23808 KB Output is correct
17 Correct 23 ms 24320 KB Output is correct
18 Correct 25 ms 24320 KB Output is correct
19 Correct 25 ms 24320 KB Output is correct
20 Correct 22 ms 24320 KB Output is correct
21 Correct 29 ms 24312 KB Output is correct
22 Correct 25 ms 24320 KB Output is correct
23 Correct 24 ms 24320 KB Output is correct
24 Correct 317 ms 62044 KB Output is correct
25 Correct 594 ms 61924 KB Output is correct
26 Correct 436 ms 63608 KB Output is correct
27 Correct 572 ms 62052 KB Output is correct
28 Correct 568 ms 63556 KB Output is correct
29 Correct 261 ms 63452 KB Output is correct
30 Correct 1599 ms 66040 KB Output is correct
31 Correct 130 ms 41208 KB Output is correct
32 Correct 211 ms 49448 KB Output is correct
33 Correct 857 ms 60724 KB Output is correct
34 Correct 1176 ms 64996 KB Output is correct
35 Correct 1578 ms 65708 KB Output is correct
36 Correct 1464 ms 65660 KB Output is correct
37 Correct 474 ms 63608 KB Output is correct
38 Correct 576 ms 62052 KB Output is correct
39 Correct 653 ms 66640 KB Output is correct
40 Correct 538 ms 66680 KB Output is correct
41 Correct 19 ms 23808 KB Output is correct
42 Correct 1724 ms 65912 KB Output is correct
43 Correct 903 ms 60920 KB Output is correct
44 Correct 1394 ms 65776 KB Output is correct
45 Correct 1760 ms 67212 KB Output is correct

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 19 ms 23936 KB Output is correct
3 Correct 19 ms 23808 KB Output is correct
4 Correct 19 ms 23936 KB Output is correct
5 Correct 18 ms 23808 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 20 ms 23808 KB Output is correct
8 Correct 18 ms 23936 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 18 ms 23896 KB Output is correct
11 Correct 19 ms 23808 KB Output is correct
12 Correct 19 ms 23936 KB Output is correct
13 Correct 20 ms 23840 KB Output is correct
14 Correct 18 ms 23808 KB Output is correct
15 Correct 19 ms 23808 KB Output is correct
16 Correct 19 ms 23808 KB Output is correct
17 Correct 23 ms 24320 KB Output is correct
18 Correct 25 ms 24320 KB Output is correct
19 Correct 25 ms 24320 KB Output is correct
20 Correct 22 ms 24320 KB Output is correct
21 Correct 29 ms 24312 KB Output is correct
22 Correct 25 ms 24320 KB Output is correct
23 Correct 24 ms 24320 KB Output is correct
24 Correct 317 ms 62044 KB Output is correct
25 Correct 594 ms 61924 KB Output is correct
26 Correct 436 ms 63608 KB Output is correct
27 Correct 572 ms 62052 KB Output is correct
28 Correct 568 ms 63556 KB Output is correct
29 Correct 261 ms 63452 KB Output is correct
30 Correct 1599 ms 66040 KB Output is correct
31 Correct 130 ms 41208 KB Output is correct
32 Correct 211 ms 49448 KB Output is correct
33 Correct 857 ms 60724 KB Output is correct
34 Correct 1176 ms 64996 KB Output is correct
35 Correct 1578 ms 65708 KB Output is correct
36 Correct 1464 ms 65660 KB Output is correct
37 Correct 474 ms 63608 KB Output is correct
38 Correct 576 ms 62052 KB Output is correct
39 Correct 653 ms 66640 KB Output is correct
40 Correct 538 ms 66680 KB Output is correct
41 Correct 19 ms 23808 KB Output is correct
42 Correct 1724 ms 65912 KB Output is correct
43 Correct 903 ms 60920 KB Output is correct
44 Correct 1394 ms 65776 KB Output is correct
45 Correct 1760 ms 67212 KB Output is correct
46 Correct 2821 ms 198328 KB Output is correct
47 Correct 3630 ms 190384 KB Output is correct
48 Correct 3917 ms 214728 KB Output is correct
49 Correct 2942 ms 214992 KB Output is correct
50 Execution timed out 10111 ms 198532 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #7
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 671 ms 60976 KB Output is correct
2 Correct 576 ms 62064 KB Output is correct
3 Correct 289 ms 63452 KB Output is correct
4 Correct 503 ms 59696 KB Output is correct
5 Correct 19 ms 23808 KB Output is correct
6 Correct 550 ms 64108 KB Output is correct
7 Correct 138 ms 40952 KB Output is correct
8 Correct 180 ms 49452 KB Output is correct
9 Correct 315 ms 63452 KB Output is correct
10 Correct 555 ms 66812 KB Output is correct
11 Correct 219 ms 63452 KB Output is correct
12 Correct 19 ms 23936 KB Output is correct
13 Correct 19 ms 23936 KB Output is correct
14 Correct 19 ms 23808 KB Output is correct
15 Correct 19 ms 23936 KB Output is correct
16 Correct 18 ms 23808 KB Output is correct
17 Correct 18 ms 23808 KB Output is correct
18 Correct 20 ms 23808 KB Output is correct
19 Correct 18 ms 23936 KB Output is correct
20 Correct 19 ms 23808 KB Output is correct
21 Correct 18 ms 23896 KB Output is correct
22 Correct 19 ms 23808 KB Output is correct
23 Correct 19 ms 23936 KB Output is correct
24 Correct 20 ms 23840 KB Output is correct
25 Correct 18 ms 23808 KB Output is correct
26 Correct 19 ms 23808 KB Output is correct
27 Correct 19 ms 23808 KB Output is correct
28 Correct 23 ms 24320 KB Output is correct
29 Correct 25 ms 24320 KB Output is correct
30 Correct 25 ms 24320 KB Output is correct
31 Correct 22 ms 24320 KB Output is correct
32 Correct 29 ms 24312 KB Output is correct
33 Correct 25 ms 24320 KB Output is correct
34 Correct 24 ms 24320 KB Output is correct
35 Correct 317 ms 62044 KB Output is correct
36 Correct 594 ms 61924 KB Output is correct
37 Correct 436 ms 63608 KB Output is correct
38 Correct 572 ms 62052 KB Output is correct
39 Correct 568 ms 63556 KB Output is correct
40 Correct 261 ms 63452 KB Output is correct
41 Correct 1599 ms 66040 KB Output is correct
42 Correct 130 ms 41208 KB Output is correct
43 Correct 211 ms 49448 KB Output is correct
44 Correct 857 ms 60724 KB Output is correct
45 Correct 1176 ms 64996 KB Output is correct
46 Correct 1578 ms 65708 KB Output is correct
47 Correct 1464 ms 65660 KB Output is correct
48 Correct 474 ms 63608 KB Output is correct
49 Correct 576 ms 62052 KB Output is correct
50 Correct 653 ms 66640 KB Output is correct
51 Correct 538 ms 66680 KB Output is correct
52 Correct 19 ms 23808 KB Output is correct
53 Correct 1724 ms 65912 KB Output is correct
54 Correct 903 ms 60920 KB Output is correct
55 Correct 1394 ms 65776 KB Output is correct
56 Correct 1760 ms 67212 KB Output is correct
57 Correct 639 ms 63540 KB Output is correct
58 Correct 589 ms 61952 KB Output is correct
59 Correct 578 ms 66636 KB Output is correct
60 Correct 745 ms 66652 KB Output is correct
61 Correct 1364 ms 66220 KB Output is correct
62 Correct 19 ms 23936 KB Output is correct
63 Correct 1739 ms 65932 KB Output is correct
64 Correct 889 ms 60636 KB Output is correct
65 Correct 1193 ms 64676 KB Output is correct
66 Correct 1639 ms 65840 KB Output is correct

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 671 ms 60976 KB Output is correct
2 Correct 576 ms 62064 KB Output is correct
3 Correct 289 ms 63452 KB Output is correct
4 Correct 503 ms 59696 KB Output is correct
5 Correct 19 ms 23808 KB Output is correct
6 Correct 550 ms 64108 KB Output is correct
7 Correct 138 ms 40952 KB Output is correct
8 Correct 180 ms 49452 KB Output is correct
9 Correct 315 ms 63452 KB Output is correct
10 Correct 555 ms 66812 KB Output is correct
11 Correct 219 ms 63452 KB Output is correct
12 Correct 19 ms 23936 KB Output is correct
13 Correct 19 ms 23936 KB Output is correct
14 Correct 19 ms 23808 KB Output is correct
15 Correct 19 ms 23936 KB Output is correct
16 Correct 18 ms 23808 KB Output is correct
17 Correct 18 ms 23808 KB Output is correct
18 Correct 20 ms 23808 KB Output is correct
19 Correct 18 ms 23936 KB Output is correct
20 Correct 19 ms 23808 KB Output is correct
21 Correct 18 ms 23896 KB Output is correct
22 Correct 19 ms 23808 KB Output is correct
23 Correct 19 ms 23936 KB Output is correct
24 Correct 20 ms 23840 KB Output is correct
25 Correct 18 ms 23808 KB Output is correct
26 Correct 19 ms 23808 KB Output is correct
27 Correct 19 ms 23808 KB Output is correct
28 Correct 23 ms 24320 KB Output is correct
29 Correct 25 ms 24320 KB Output is correct
30 Correct 25 ms 24320 KB Output is correct
31 Correct 22 ms 24320 KB Output is correct
32 Correct 29 ms 24312 KB Output is correct
33 Correct 25 ms 24320 KB Output is correct
34 Correct 24 ms 24320 KB Output is correct
35 Correct 317 ms 62044 KB Output is correct
36 Correct 594 ms 61924 KB Output is correct
37 Correct 436 ms 63608 KB Output is correct
38 Correct 572 ms 62052 KB Output is correct
39 Correct 568 ms 63556 KB Output is correct
40 Correct 261 ms 63452 KB Output is correct
41 Correct 1599 ms 66040 KB Output is correct
42 Correct 130 ms 41208 KB Output is correct
43 Correct 211 ms 49448 KB Output is correct
44 Correct 857 ms 60724 KB Output is correct
45 Correct 1176 ms 64996 KB Output is correct
46 Correct 1578 ms 65708 KB Output is correct
47 Correct 1464 ms 65660 KB Output is correct
48 Correct 474 ms 63608 KB Output is correct
49 Correct 576 ms 62052 KB Output is correct
50 Correct 653 ms 66640 KB Output is correct
51 Correct 538 ms 66680 KB Output is correct
52 Correct 19 ms 23808 KB Output is correct
53 Correct 1724 ms 65912 KB Output is correct
54 Correct 903 ms 60920 KB Output is correct
55 Correct 1394 ms 65776 KB Output is correct
56 Correct 1760 ms 67212 KB Output is correct
57 Correct 2821 ms 198328 KB Output is correct
58 Correct 3630 ms 190384 KB Output is correct
59 Correct 3917 ms 214728 KB Output is correct
60 Correct 2942 ms 214992 KB Output is correct
61 Execution timed out 10111 ms 198532 KB Time limit exceeded
62 Halted 0 ms 0 KB -