oj.uz

Submission #246866

# Submission time Handle Problem Language Result Execution time Memory
246866 2020-07-10T12:41:34 Z sealnot123 Two Dishes (JOI19_dishes) C++14
82 / 100
 10000 ms 214956 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;
int n, m;
LL seg[N<<2], lazy[N<<2], label[N<<2];
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 push(int l, int r, int nw){
    push_label(l, r, nw);
    push_add(l, r, nw);
}
void paste(int ll, int rr, LL v, int l = 0, int r = n, int nw = 1){
    push(l, r, nw);
    if(ll > rr || l > rr || r < ll) return ;
    if(l >= ll && r <= rr){
        label[nw] = v;
        push(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] = max(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(l, r, nw);
    if(l > r || ll > rr || l > rr || r < ll) return ;
    if(l >= ll && r <= rr){
        lazy[nw] = v;
        push(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] = max(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(l, r, nw);
    if(l > r || ll > rr || l > rr || r < ll) return 1<<30;
    if(l == r){
        if(seg[nw] >= v) return l;
        return 1<<30;
    }
    int m = (l+r)>>1;
    if(l >= ll && r <= rr){
        push(l, m, nw<<1); push(m+1, r, nw<<1|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 min( 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(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);
}
void print(int l = 0, int r = n, int nw = 1){
    push(l, r, nw);
    if(l == r){
        printf("%lld ",seg[nw]); return ;
    }
    int m = (l+r)>>1;
    print(l, m, nw<<1); print(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];

int main(){
    scanf("%d %d",&n,&m);
    FOR(i, 1, n) scanf("%lld %lld %lld",&A[i],&S[i],&P[i]), A[i] += A[i-1];
    FOR(i, 1, m) scanf("%lld %lld %lld",&B[i],&T[i],&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);
            //printf("j %d (%d, %d) %lld stop = %d\n",j,now,nxt,value,stop_point);
            paste(now+1, min(stop_point-1, nxt), 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;
}
/*
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *
 */

Compilation message

dishes.cpp: In function 'int main()':
dishes.cpp:109:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~~
dishes.cpp:110:59: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     FOR(i, 1, n) scanf("%lld %lld %lld",&A[i],&S[i],&P[i]), A[i] += A[i-1];
                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
dishes.cpp:111:59: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     FOR(i, 1, m) scanf("%lld %lld %lld",&B[i],&T[i],&Q[i]), B[i] += B[i-1];
                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 860 ms 61208 KB Output is correct
2 Correct 857 ms 62348 KB Output is correct
3 Correct 336 ms 60648 KB Output is correct
4 Correct 645 ms 57040 KB Output is correct
5 Correct 19 ms 23936 KB Output is correct
6 Correct 717 ms 61124 KB Output is correct
7 Correct 153 ms 38136 KB Output is correct
8 Correct 198 ms 46760 KB Output is correct
9 Correct 352 ms 60868 KB Output is correct
10 Correct 834 ms 64352 KB Output is correct
11 Correct 295 ms 61032 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
7.0 / 7.0

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

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23936 KB Output is correct
2 Correct 22 ms 23936 KB Output is correct
3 Correct 23 ms 23936 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 19 ms 23936 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 24 ms 23808 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 20 ms 23808 KB Output is correct
10 Correct 19 ms 23936 KB Output is correct
11 Correct 19 ms 23936 KB Output is correct
12 Correct 19 ms 23808 KB Output is correct
13 Correct 19 ms 23808 KB Output is correct
14 Correct 22 ms 23808 KB Output is correct
15 Correct 18 ms 23936 KB Output is correct
16 Correct 18 ms 23936 KB Output is correct
17 Correct 22 ms 24320 KB Output is correct
18 Correct 24 ms 24320 KB Output is correct
19 Correct 26 ms 24320 KB Output is correct
20 Correct 24 ms 24320 KB Output is correct
21 Correct 26 ms 24320 KB Output is correct
22 Correct 26 ms 24320 KB Output is correct
23 Correct 25 ms 24320 KB Output is correct
24 Correct 395 ms 59740 KB Output is correct
25 Correct 850 ms 59748 KB Output is correct
26 Correct 626 ms 61152 KB Output is correct
27 Correct 721 ms 59620 KB Output is correct
28 Correct 766 ms 61288 KB Output is correct
29 Correct 308 ms 61280 KB Output is correct
30 Correct 2242 ms 63732 KB Output is correct
31 Correct 155 ms 38904 KB Output is correct
32 Correct 234 ms 47144 KB Output is correct
33 Correct 1136 ms 58616 KB Output is correct
34 Correct 1581 ms 62484 KB Output is correct
35 Correct 2117 ms 63824 KB Output is correct
36 Correct 2135 ms 63896 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23936 KB Output is correct
2 Correct 22 ms 23936 KB Output is correct
3 Correct 23 ms 23936 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 19 ms 23936 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 24 ms 23808 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 20 ms 23808 KB Output is correct
10 Correct 19 ms 23936 KB Output is correct
11 Correct 19 ms 23936 KB Output is correct
12 Correct 19 ms 23808 KB Output is correct
13 Correct 19 ms 23808 KB Output is correct
14 Correct 22 ms 23808 KB Output is correct
15 Correct 18 ms 23936 KB Output is correct
16 Correct 18 ms 23936 KB Output is correct
17 Correct 22 ms 24320 KB Output is correct
18 Correct 24 ms 24320 KB Output is correct
19 Correct 26 ms 24320 KB Output is correct
20 Correct 24 ms 24320 KB Output is correct
21 Correct 26 ms 24320 KB Output is correct
22 Correct 26 ms 24320 KB Output is correct
23 Correct 25 ms 24320 KB Output is correct
24 Correct 395 ms 59740 KB Output is correct
25 Correct 850 ms 59748 KB Output is correct
26 Correct 626 ms 61152 KB Output is correct
27 Correct 721 ms 59620 KB Output is correct
28 Correct 766 ms 61288 KB Output is correct
29 Correct 308 ms 61280 KB Output is correct
30 Correct 2242 ms 63732 KB Output is correct
31 Correct 155 ms 38904 KB Output is correct
32 Correct 234 ms 47144 KB Output is correct
33 Correct 1136 ms 58616 KB Output is correct
34 Correct 1581 ms 62484 KB Output is correct
35 Correct 2117 ms 63824 KB Output is correct
36 Correct 2135 ms 63896 KB Output is correct
37 Correct 682 ms 61176 KB Output is correct
38 Correct 812 ms 59620 KB Output is correct
39 Correct 901 ms 64328 KB Output is correct
40 Correct 764 ms 64504 KB Output is correct
41 Correct 19 ms 23808 KB Output is correct
42 Correct 2085 ms 63896 KB Output is correct
43 Correct 1158 ms 58360 KB Output is correct
44 Correct 1650 ms 62248 KB Output is correct
45 Correct 2066 ms 63880 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23936 KB Output is correct
2 Correct 22 ms 23936 KB Output is correct
3 Correct 23 ms 23936 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 19 ms 23936 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 24 ms 23808 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 20 ms 23808 KB Output is correct
10 Correct 19 ms 23936 KB Output is correct
11 Correct 19 ms 23936 KB Output is correct
12 Correct 19 ms 23808 KB Output is correct
13 Correct 19 ms 23808 KB Output is correct
14 Correct 22 ms 23808 KB Output is correct
15 Correct 18 ms 23936 KB Output is correct
16 Correct 18 ms 23936 KB Output is correct
17 Correct 22 ms 24320 KB Output is correct
18 Correct 24 ms 24320 KB Output is correct
19 Correct 26 ms 24320 KB Output is correct
20 Correct 24 ms 24320 KB Output is correct
21 Correct 26 ms 24320 KB Output is correct
22 Correct 26 ms 24320 KB Output is correct
23 Correct 25 ms 24320 KB Output is correct
24 Correct 395 ms 59740 KB Output is correct
25 Correct 850 ms 59748 KB Output is correct
26 Correct 626 ms 61152 KB Output is correct
27 Correct 721 ms 59620 KB Output is correct
28 Correct 766 ms 61288 KB Output is correct
29 Correct 308 ms 61280 KB Output is correct
30 Correct 2242 ms 63732 KB Output is correct
31 Correct 155 ms 38904 KB Output is correct
32 Correct 234 ms 47144 KB Output is correct
33 Correct 1136 ms 58616 KB Output is correct
34 Correct 1581 ms 62484 KB Output is correct
35 Correct 2117 ms 63824 KB Output is correct
36 Correct 2135 ms 63896 KB Output is correct
37 Correct 682 ms 61176 KB Output is correct
38 Correct 812 ms 59620 KB Output is correct
39 Correct 901 ms 64328 KB Output is correct
40 Correct 764 ms 64504 KB Output is correct
41 Correct 19 ms 23808 KB Output is correct
42 Correct 2085 ms 63896 KB Output is correct
43 Correct 1158 ms 58360 KB Output is correct
44 Correct 1650 ms 62248 KB Output is correct
45 Correct 2066 ms 63880 KB Output is correct
46 Correct 3564 ms 197784 KB Output is correct
47 Correct 4409 ms 190156 KB Output is correct
48 Correct 4797 ms 214956 KB Output is correct
49 Correct 4135 ms 214848 KB Output is correct
50 Execution timed out 10052 ms 188664 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 860 ms 61208 KB Output is correct
2 Correct 857 ms 62348 KB Output is correct
3 Correct 336 ms 60648 KB Output is correct
4 Correct 645 ms 57040 KB Output is correct
5 Correct 19 ms 23936 KB Output is correct
6 Correct 717 ms 61124 KB Output is correct
7 Correct 153 ms 38136 KB Output is correct
8 Correct 198 ms 46760 KB Output is correct
9 Correct 352 ms 60868 KB Output is correct
10 Correct 834 ms 64352 KB Output is correct
11 Correct 295 ms 61032 KB Output is correct
12 Correct 18 ms 23936 KB Output is correct
13 Correct 22 ms 23936 KB Output is correct
14 Correct 23 ms 23936 KB Output is correct
15 Correct 19 ms 23808 KB Output is correct
16 Correct 19 ms 23936 KB Output is correct
17 Correct 18 ms 23808 KB Output is correct
18 Correct 24 ms 23808 KB Output is correct
19 Correct 19 ms 23808 KB Output is correct
20 Correct 20 ms 23808 KB Output is correct
21 Correct 19 ms 23936 KB Output is correct
22 Correct 19 ms 23936 KB Output is correct
23 Correct 19 ms 23808 KB Output is correct
24 Correct 19 ms 23808 KB Output is correct
25 Correct 22 ms 23808 KB Output is correct
26 Correct 18 ms 23936 KB Output is correct
27 Correct 18 ms 23936 KB Output is correct
28 Correct 22 ms 24320 KB Output is correct
29 Correct 24 ms 24320 KB Output is correct
30 Correct 26 ms 24320 KB Output is correct
31 Correct 24 ms 24320 KB Output is correct
32 Correct 26 ms 24320 KB Output is correct
33 Correct 26 ms 24320 KB Output is correct
34 Correct 25 ms 24320 KB Output is correct
35 Correct 395 ms 59740 KB Output is correct
36 Correct 850 ms 59748 KB Output is correct
37 Correct 626 ms 61152 KB Output is correct
38 Correct 721 ms 59620 KB Output is correct
39 Correct 766 ms 61288 KB Output is correct
40 Correct 308 ms 61280 KB Output is correct
41 Correct 2242 ms 63732 KB Output is correct
42 Correct 155 ms 38904 KB Output is correct
43 Correct 234 ms 47144 KB Output is correct
44 Correct 1136 ms 58616 KB Output is correct
45 Correct 1581 ms 62484 KB Output is correct
46 Correct 2117 ms 63824 KB Output is correct
47 Correct 2135 ms 63896 KB Output is correct
48 Correct 682 ms 61176 KB Output is correct
49 Correct 812 ms 59620 KB Output is correct
50 Correct 901 ms 64328 KB Output is correct
51 Correct 764 ms 64504 KB Output is correct
52 Correct 19 ms 23808 KB Output is correct
53 Correct 2085 ms 63896 KB Output is correct
54 Correct 1158 ms 58360 KB Output is correct
55 Correct 1650 ms 62248 KB Output is correct
56 Correct 2066 ms 63880 KB Output is correct
57 Correct 729 ms 61944 KB Output is correct
58 Correct 726 ms 60464 KB Output is correct
59 Correct 777 ms 65144 KB Output is correct
60 Correct 909 ms 65168 KB Output is correct
61 Correct 2017 ms 62572 KB Output is correct
62 Correct 19 ms 23808 KB Output is correct
63 Correct 2161 ms 64444 KB Output is correct
64 Correct 1161 ms 59128 KB Output is correct
65 Correct 1717 ms 63088 KB Output is correct
66 Correct 2152 ms 64232 KB Output is correct

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 860 ms 61208 KB Output is correct
2 Correct 857 ms 62348 KB Output is correct
3 Correct 336 ms 60648 KB Output is correct
4 Correct 645 ms 57040 KB Output is correct
5 Correct 19 ms 23936 KB Output is correct
6 Correct 717 ms 61124 KB Output is correct
7 Correct 153 ms 38136 KB Output is correct
8 Correct 198 ms 46760 KB Output is correct
9 Correct 352 ms 60868 KB Output is correct
10 Correct 834 ms 64352 KB Output is correct
11 Correct 295 ms 61032 KB Output is correct
12 Correct 18 ms 23936 KB Output is correct
13 Correct 22 ms 23936 KB Output is correct
14 Correct 23 ms 23936 KB Output is correct
15 Correct 19 ms 23808 KB Output is correct
16 Correct 19 ms 23936 KB Output is correct
17 Correct 18 ms 23808 KB Output is correct
18 Correct 24 ms 23808 KB Output is correct
19 Correct 19 ms 23808 KB Output is correct
20 Correct 20 ms 23808 KB Output is correct
21 Correct 19 ms 23936 KB Output is correct
22 Correct 19 ms 23936 KB Output is correct
23 Correct 19 ms 23808 KB Output is correct
24 Correct 19 ms 23808 KB Output is correct
25 Correct 22 ms 23808 KB Output is correct
26 Correct 18 ms 23936 KB Output is correct
27 Correct 18 ms 23936 KB Output is correct
28 Correct 22 ms 24320 KB Output is correct
29 Correct 24 ms 24320 KB Output is correct
30 Correct 26 ms 24320 KB Output is correct
31 Correct 24 ms 24320 KB Output is correct
32 Correct 26 ms 24320 KB Output is correct
33 Correct 26 ms 24320 KB Output is correct
34 Correct 25 ms 24320 KB Output is correct
35 Correct 395 ms 59740 KB Output is correct
36 Correct 850 ms 59748 KB Output is correct
37 Correct 626 ms 61152 KB Output is correct
38 Correct 721 ms 59620 KB Output is correct
39 Correct 766 ms 61288 KB Output is correct
40 Correct 308 ms 61280 KB Output is correct
41 Correct 2242 ms 63732 KB Output is correct
42 Correct 155 ms 38904 KB Output is correct
43 Correct 234 ms 47144 KB Output is correct
44 Correct 1136 ms 58616 KB Output is correct
45 Correct 1581 ms 62484 KB Output is correct
46 Correct 2117 ms 63824 KB Output is correct
47 Correct 2135 ms 63896 KB Output is correct
48 Correct 682 ms 61176 KB Output is correct
49 Correct 812 ms 59620 KB Output is correct
50 Correct 901 ms 64328 KB Output is correct
51 Correct 764 ms 64504 KB Output is correct
52 Correct 19 ms 23808 KB Output is correct
53 Correct 2085 ms 63896 KB Output is correct
54 Correct 1158 ms 58360 KB Output is correct
55 Correct 1650 ms 62248 KB Output is correct
56 Correct 2066 ms 63880 KB Output is correct
57 Correct 3564 ms 197784 KB Output is correct
58 Correct 4409 ms 190156 KB Output is correct
59 Correct 4797 ms 214956 KB Output is correct
60 Correct 4135 ms 214848 KB Output is correct
61 Execution timed out 10052 ms 188664 KB Time limit exceeded
62 Halted 0 ms 0 KB -