oj.uz

답안 #246882

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246882 2020-07-10T13:26:51 Z sealnot123 Two Dishes (JOI19_dishes) C++14
82 / 100
 10000 ms 215760 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){
    if(lazy[nw] == 0) return ;
    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){
    if(label[nw] == inf) return ;
    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){
    push_label(l, r, nw);
    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); 
        push_add(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){
    push_label(l, r, nw);
    push_add(l, r, nw);
    if(l > r || ll > rr || l > rr || r < ll) return ;
    if(l >= ll && r <= rr){
        lazy[nw] = v;
        push_label(l, r, nw);
        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){
    push_label(l, r, nw);
    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){
        push_label(l, m, nw<<1);
        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){
    push_label(l, r, nw);
    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 682 ms 63212 KB Output is correct
2 Correct 589 ms 64240 KB Output is correct
3 Correct 306 ms 62812 KB Output is correct
4 Correct 530 ms 59000 KB Output is correct
5 Correct 18 ms 23808 KB Output is correct
6 Correct 542 ms 63208 KB Output is correct
7 Correct 137 ms 40056 KB Output is correct
8 Correct 173 ms 48736 KB Output is correct
9 Correct 312 ms 62804 KB Output is correct
10 Correct 568 ms 65892 KB Output is correct
11 Correct 224 ms 62684 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23808 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 19 ms 23808 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 19 ms 23936 KB Output is correct
6 Correct 19 ms 23808 KB Output is correct
7 Correct 19 ms 23808 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 19 ms 24064 KB Output is correct
10 Correct 19 ms 23936 KB Output is correct
11 Correct 20 ms 23936 KB Output is correct
12 Correct 20 ms 23808 KB Output is correct
13 Correct 19 ms 23808 KB Output is correct
14 Correct 19 ms 23892 KB Output is correct
15 Correct 19 ms 23936 KB Output is correct
16 Correct 18 ms 23808 KB Output is correct
17 Correct 21 ms 24312 KB Output is correct
18 Correct 23 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 25 ms 24320 KB Output is correct
22 Correct 24 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 23808 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 19 ms 23808 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 19 ms 23936 KB Output is correct
6 Correct 19 ms 23808 KB Output is correct
7 Correct 19 ms 23808 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 19 ms 24064 KB Output is correct
10 Correct 19 ms 23936 KB Output is correct
11 Correct 20 ms 23936 KB Output is correct
12 Correct 20 ms 23808 KB Output is correct
13 Correct 19 ms 23808 KB Output is correct
14 Correct 19 ms 23892 KB Output is correct
15 Correct 19 ms 23936 KB Output is correct
16 Correct 18 ms 23808 KB Output is correct
17 Correct 21 ms 24312 KB Output is correct
18 Correct 23 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 25 ms 24320 KB Output is correct
22 Correct 24 ms 24320 KB Output is correct
23 Correct 24 ms 24320 KB Output is correct
24 Correct 310 ms 61148 KB Output is correct
25 Correct 628 ms 61156 KB Output is correct
26 Correct 437 ms 62840 KB Output is correct
27 Correct 559 ms 61284 KB Output is correct
28 Correct 585 ms 62876 KB Output is correct
29 Correct 264 ms 62720 KB Output is correct
30 Correct 1477 ms 65220 KB Output is correct
31 Correct 132 ms 40376 KB Output is correct
32 Correct 180 ms 48788 KB Output is correct
33 Correct 833 ms 60008 KB Output is correct
34 Correct 1076 ms 64104 KB Output is correct
35 Correct 1429 ms 65468 KB Output is correct
36 Correct 1348 ms 65288 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23808 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 19 ms 23808 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 19 ms 23936 KB Output is correct
6 Correct 19 ms 23808 KB Output is correct
7 Correct 19 ms 23808 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 19 ms 24064 KB Output is correct
10 Correct 19 ms 23936 KB Output is correct
11 Correct 20 ms 23936 KB Output is correct
12 Correct 20 ms 23808 KB Output is correct
13 Correct 19 ms 23808 KB Output is correct
14 Correct 19 ms 23892 KB Output is correct
15 Correct 19 ms 23936 KB Output is correct
16 Correct 18 ms 23808 KB Output is correct
17 Correct 21 ms 24312 KB Output is correct
18 Correct 23 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 25 ms 24320 KB Output is correct
22 Correct 24 ms 24320 KB Output is correct
23 Correct 24 ms 24320 KB Output is correct
24 Correct 310 ms 61148 KB Output is correct
25 Correct 628 ms 61156 KB Output is correct
26 Correct 437 ms 62840 KB Output is correct
27 Correct 559 ms 61284 KB Output is correct
28 Correct 585 ms 62876 KB Output is correct
29 Correct 264 ms 62720 KB Output is correct
30 Correct 1477 ms 65220 KB Output is correct
31 Correct 132 ms 40376 KB Output is correct
32 Correct 180 ms 48788 KB Output is correct
33 Correct 833 ms 60008 KB Output is correct
34 Correct 1076 ms 64104 KB Output is correct
35 Correct 1429 ms 65468 KB Output is correct
36 Correct 1348 ms 65288 KB Output is correct
37 Correct 490 ms 62788 KB Output is correct
38 Correct 586 ms 61156 KB Output is correct
39 Correct 668 ms 65956 KB Output is correct
40 Correct 560 ms 65688 KB Output is correct
41 Correct 19 ms 23808 KB Output is correct
42 Correct 1519 ms 64940 KB Output is correct
43 Correct 848 ms 59768 KB Output is correct
44 Correct 1107 ms 63724 KB Output is correct
45 Correct 1507 ms 65068 KB Output is correct

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 23808 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 19 ms 23808 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 19 ms 23936 KB Output is correct
6 Correct 19 ms 23808 KB Output is correct
7 Correct 19 ms 23808 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 19 ms 24064 KB Output is correct
10 Correct 19 ms 23936 KB Output is correct
11 Correct 20 ms 23936 KB Output is correct
12 Correct 20 ms 23808 KB Output is correct
13 Correct 19 ms 23808 KB Output is correct
14 Correct 19 ms 23892 KB Output is correct
15 Correct 19 ms 23936 KB Output is correct
16 Correct 18 ms 23808 KB Output is correct
17 Correct 21 ms 24312 KB Output is correct
18 Correct 23 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 25 ms 24320 KB Output is correct
22 Correct 24 ms 24320 KB Output is correct
23 Correct 24 ms 24320 KB Output is correct
24 Correct 310 ms 61148 KB Output is correct
25 Correct 628 ms 61156 KB Output is correct
26 Correct 437 ms 62840 KB Output is correct
27 Correct 559 ms 61284 KB Output is correct
28 Correct 585 ms 62876 KB Output is correct
29 Correct 264 ms 62720 KB Output is correct
30 Correct 1477 ms 65220 KB Output is correct
31 Correct 132 ms 40376 KB Output is correct
32 Correct 180 ms 48788 KB Output is correct
33 Correct 833 ms 60008 KB Output is correct
34 Correct 1076 ms 64104 KB Output is correct
35 Correct 1429 ms 65468 KB Output is correct
36 Correct 1348 ms 65288 KB Output is correct
37 Correct 490 ms 62788 KB Output is correct
38 Correct 586 ms 61156 KB Output is correct
39 Correct 668 ms 65956 KB Output is correct
40 Correct 560 ms 65688 KB Output is correct
41 Correct 19 ms 23808 KB Output is correct
42 Correct 1519 ms 64940 KB Output is correct
43 Correct 848 ms 59768 KB Output is correct
44 Correct 1107 ms 63724 KB Output is correct
45 Correct 1507 ms 65068 KB Output is correct
46 Correct 2554 ms 198004 KB Output is correct
47 Correct 3309 ms 190500 KB Output is correct
48 Correct 3838 ms 215140 KB Output is correct
49 Correct 2938 ms 215760 KB Output is correct
50 Execution timed out 10113 ms 203676 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #7
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 682 ms 63212 KB Output is correct
2 Correct 589 ms 64240 KB Output is correct
3 Correct 306 ms 62812 KB Output is correct
4 Correct 530 ms 59000 KB Output is correct
5 Correct 18 ms 23808 KB Output is correct
6 Correct 542 ms 63208 KB Output is correct
7 Correct 137 ms 40056 KB Output is correct
8 Correct 173 ms 48736 KB Output is correct
9 Correct 312 ms 62804 KB Output is correct
10 Correct 568 ms 65892 KB Output is correct
11 Correct 224 ms 62684 KB Output is correct
12 Correct 19 ms 23808 KB Output is correct
13 Correct 19 ms 23808 KB Output is correct
14 Correct 19 ms 23808 KB Output is correct
15 Correct 19 ms 23808 KB Output is correct
16 Correct 19 ms 23936 KB Output is correct
17 Correct 19 ms 23808 KB Output is correct
18 Correct 19 ms 23808 KB Output is correct
19 Correct 19 ms 23808 KB Output is correct
20 Correct 19 ms 24064 KB Output is correct
21 Correct 19 ms 23936 KB Output is correct
22 Correct 20 ms 23936 KB Output is correct
23 Correct 20 ms 23808 KB Output is correct
24 Correct 19 ms 23808 KB Output is correct
25 Correct 19 ms 23892 KB Output is correct
26 Correct 19 ms 23936 KB Output is correct
27 Correct 18 ms 23808 KB Output is correct
28 Correct 21 ms 24312 KB Output is correct
29 Correct 23 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 25 ms 24320 KB Output is correct
33 Correct 24 ms 24320 KB Output is correct
34 Correct 24 ms 24320 KB Output is correct
35 Correct 310 ms 61148 KB Output is correct
36 Correct 628 ms 61156 KB Output is correct
37 Correct 437 ms 62840 KB Output is correct
38 Correct 559 ms 61284 KB Output is correct
39 Correct 585 ms 62876 KB Output is correct
40 Correct 264 ms 62720 KB Output is correct
41 Correct 1477 ms 65220 KB Output is correct
42 Correct 132 ms 40376 KB Output is correct
43 Correct 180 ms 48788 KB Output is correct
44 Correct 833 ms 60008 KB Output is correct
45 Correct 1076 ms 64104 KB Output is correct
46 Correct 1429 ms 65468 KB Output is correct
47 Correct 1348 ms 65288 KB Output is correct
48 Correct 490 ms 62788 KB Output is correct
49 Correct 586 ms 61156 KB Output is correct
50 Correct 668 ms 65956 KB Output is correct
51 Correct 560 ms 65688 KB Output is correct
52 Correct 19 ms 23808 KB Output is correct
53 Correct 1519 ms 64940 KB Output is correct
54 Correct 848 ms 59768 KB Output is correct
55 Correct 1107 ms 63724 KB Output is correct
56 Correct 1507 ms 65068 KB Output is correct
57 Correct 560 ms 62588 KB Output is correct
58 Correct 538 ms 60860 KB Output is correct
59 Correct 556 ms 65540 KB Output is correct
60 Correct 679 ms 65656 KB Output is correct
61 Correct 1297 ms 63096 KB Output is correct
62 Correct 19 ms 23808 KB Output is correct
63 Correct 1557 ms 64988 KB Output is correct
64 Correct 928 ms 59536 KB Output is correct
65 Correct 1188 ms 63856 KB Output is correct
66 Correct 1459 ms 64904 KB Output is correct

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 682 ms 63212 KB Output is correct
2 Correct 589 ms 64240 KB Output is correct
3 Correct 306 ms 62812 KB Output is correct
4 Correct 530 ms 59000 KB Output is correct
5 Correct 18 ms 23808 KB Output is correct
6 Correct 542 ms 63208 KB Output is correct
7 Correct 137 ms 40056 KB Output is correct
8 Correct 173 ms 48736 KB Output is correct
9 Correct 312 ms 62804 KB Output is correct
10 Correct 568 ms 65892 KB Output is correct
11 Correct 224 ms 62684 KB Output is correct
12 Correct 19 ms 23808 KB Output is correct
13 Correct 19 ms 23808 KB Output is correct
14 Correct 19 ms 23808 KB Output is correct
15 Correct 19 ms 23808 KB Output is correct
16 Correct 19 ms 23936 KB Output is correct
17 Correct 19 ms 23808 KB Output is correct
18 Correct 19 ms 23808 KB Output is correct
19 Correct 19 ms 23808 KB Output is correct
20 Correct 19 ms 24064 KB Output is correct
21 Correct 19 ms 23936 KB Output is correct
22 Correct 20 ms 23936 KB Output is correct
23 Correct 20 ms 23808 KB Output is correct
24 Correct 19 ms 23808 KB Output is correct
25 Correct 19 ms 23892 KB Output is correct
26 Correct 19 ms 23936 KB Output is correct
27 Correct 18 ms 23808 KB Output is correct
28 Correct 21 ms 24312 KB Output is correct
29 Correct 23 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 25 ms 24320 KB Output is correct
33 Correct 24 ms 24320 KB Output is correct
34 Correct 24 ms 24320 KB Output is correct
35 Correct 310 ms 61148 KB Output is correct
36 Correct 628 ms 61156 KB Output is correct
37 Correct 437 ms 62840 KB Output is correct
38 Correct 559 ms 61284 KB Output is correct
39 Correct 585 ms 62876 KB Output is correct
40 Correct 264 ms 62720 KB Output is correct
41 Correct 1477 ms 65220 KB Output is correct
42 Correct 132 ms 40376 KB Output is correct
43 Correct 180 ms 48788 KB Output is correct
44 Correct 833 ms 60008 KB Output is correct
45 Correct 1076 ms 64104 KB Output is correct
46 Correct 1429 ms 65468 KB Output is correct
47 Correct 1348 ms 65288 KB Output is correct
48 Correct 490 ms 62788 KB Output is correct
49 Correct 586 ms 61156 KB Output is correct
50 Correct 668 ms 65956 KB Output is correct
51 Correct 560 ms 65688 KB Output is correct
52 Correct 19 ms 23808 KB Output is correct
53 Correct 1519 ms 64940 KB Output is correct
54 Correct 848 ms 59768 KB Output is correct
55 Correct 1107 ms 63724 KB Output is correct
56 Correct 1507 ms 65068 KB Output is correct
57 Correct 2554 ms 198004 KB Output is correct
58 Correct 3309 ms 190500 KB Output is correct
59 Correct 3838 ms 215140 KB Output is correct
60 Correct 2938 ms 215760 KB Output is correct
61 Execution timed out 10113 ms 203676 KB Time limit exceeded
62 Halted 0 ms 0 KB -