oj.uz

Submission #890550

# Submission time Handle Problem Language Result Execution time Memory
890550 2023-12-21T13:06:04 Z LucaIlie Food Court (JOI21_foodcourt) C++17
68 / 100
 954 ms 524288 KB 
#include <bits/stdc++.h>

using namespace std;

struct aaa {
    int t, c;
    long long k;
};

const int MAX_N = 3e5;
int bucket[MAX_N + 1], leftB[MAX_N + 1], rightB[MAX_N + 1];
long long queueIndexSize[MAX_N + 1], queueBucketSize[MAX_N + 1];
vector<aaa> queueIndex[MAX_N + 1], queueBucket[MAX_N + 1];

struct SegTree {
    struct info {
        long long sum, minn;

        info operator + ( info &x ) {
            info ans;

            ans.minn = min( minn, sum + x.minn );
            ans.sum = sum + x.sum;

            return ans;
        }
    };

    info lazy[4 * MAX_N];

    void propag( int v, int l, int r ) {
        if ( l != r ) {
            lazy[v * 2 + 1] = lazy[v * 2 + 1] + lazy[v];
            lazy[v * 2 + 2] = lazy[v * 2 + 2] + lazy[v];
            lazy[v] = { 0, 0 };
        }
    }

    void update( int v, int l, int r, int lu, int ru, int x ) {
        propag( v, l, r );

        if ( l > ru || r < lu )
            return;

        if ( lu <= l && r <= ru ) {
            info add = { x, min( x, 0 ) };
            lazy[v] = lazy[v] + add;
            propag( v, l, r );
            return;
        }

        int mid = (l + r) / 2;
        update( v * 2 + 1, l, mid, lu, ru, x );
        update( v * 2 + 2, mid + 1, r, lu, ru, x );
    }

    long long query( int v, int l, int r, int p ) {
        propag( v, l, r );

        if ( l == r )
            return lazy[v].sum - lazy[v].minn;

        int mid = (l + r) / 2;
        if ( p <= mid )
            return query( v * 2 + 1, l, mid, p );
        return query( v * 2 + 2, mid + 1, r, p );
    }
} qs;

signed main() {
    ios_base::sync_with_stdio( false );
    cin.tie( NULL );
    cout.tie( NULL );

    int n, m, q;

    cin >> n >> m >> q;

    int bs = sqrt( n );
    for ( int i = 1; i <= n; i++ ) {
        bucket[i] = i / bs;
        queueIndex[i].push_back( { -1, 0, 0 } );
    }
    for ( int b = 0; b * bs <= n; b++ ) {
        leftB[b] = b * bs;
        rightB[b] = min( n, (b + 1) * bs - 1 );
        queueBucket[b].push_back( { -1, 0, 0 } );
    }

    for ( int t = 0; t < q; t++ ) {
        int type;

        cin >> type;
        if ( type == 1 ) {
            int l, r, c, k;
            cin >> l >> r >> c >> k;
            qs.update( 0, 1, n, l, r, k );
            int bl = bucket[l], br = bucket[r];
            if ( bl == br ) {
                for ( int i = l; i <= r; i++ ) {
                    queueIndexSize[i] += k;
                    queueIndex[i].push_back( { t, c, queueIndexSize[i] } );
                }
            } else {
                for ( int i = l; i <= rightB[bl]; i++ ) {
                    queueIndexSize[i] += k;
                    queueIndex[i].push_back( { t, c, queueIndexSize[i] } );
                }
                for ( int i = leftB[br]; i <= r; i++ ) {
                    queueIndexSize[i] += k;
                    queueIndex[i].push_back( { t, c, queueIndexSize[i] } );
                }
                for ( int b = bl + 1; b <= br - 1; b++ ) {
                    queueBucketSize[b] += k;
                    queueBucket[b].push_back( { t, c, queueBucketSize[b] } );
                }
            }
        } else if ( type == 2 ) {
            int l, r, k;
            cin >> l >> r >> k;
            qs.update( 0, 1, n, l, r, -k );
        } else {
            int p;
            long long x;
            cin >> p >> x;
            int b = bucket[p];
            x += queueIndexSize[p] + queueBucketSize[b] - qs.query( 0, 1, n, p );

            if ( m == 1 ) {
                cout << (x <= queueIndexSize[p] + queueBucketSize[b]) << "\n";
                continue;
            }

            int l = -1, r = t;
            while ( r - l > 1 ) {
                int mid = (l + r) / 2;

                int lp = 0, rp = queueIndex[p].size();
                while ( rp - lp > 1 ) {
                    int mp = (lp + rp) / 2;
                    if ( queueIndex[p][mp].t > mid )
                        rp = mp;
                    else
                        lp = mp;
                }

                int lb = 0, rb = queueBucket[b].size();
                while ( rb - lb > 1 ) {
                    int mb = (lb + rb) / 2;
                    if ( queueBucket[b][mb].t > mid )
                        rb = mb;
                    else
                        lb = mb;
                }

                long long k = (queueIndex[p].size() == 0 ? 0 : queueIndex[p][lp].k) + (queueBucket[b].size() == 0 ? 0 : queueBucket[b][lb].k);
                if ( k >= x )
                    r = mid;
                else
                    l = mid;
            }

            if ( r == t )
                cout << "0\n";
            else {
                int lp = 0, rp = queueIndex[p].size();
                while ( rp - lp > 1 ) {
                    int mp = (lp + rp) / 2;
                    if ( queueIndex[p][mp].t > r )
                        rp = mp;
                    else
                        lp = mp;
                }

                int lb = 0, rb = queueBucket[b].size();
                while ( rb - lb > 1 ) {
                    int mb = (lb + rb) / 2;
                    if ( queueBucket[b][mb].t > r )
                        rb = mb;
                    else
                        lb = mb;
                }

                if ( queueIndex[p][lp].t == r )
                    cout << queueIndex[p][lp].c << "\n";
                else if ( queueBucket[b][lb].t == r )
                    cout << queueBucket[b][lb].c << "\n";
                else
                    return 1;
            }
        }
    }

    return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17496 KB Output is correct
2 Correct 6 ms 18012 KB Output is correct
3 Correct 6 ms 18012 KB Output is correct
4 Correct 7 ms 18524 KB Output is correct
5 Correct 4 ms 16816 KB Output is correct
6 Correct 4 ms 16732 KB Output is correct
7 Correct 6 ms 18012 KB Output is correct
8 Correct 7 ms 18012 KB Output is correct
9 Correct 7 ms 18008 KB Output is correct
10 Correct 7 ms 18268 KB Output is correct
11 Correct 7 ms 18080 KB Output is correct
12 Correct 9 ms 18012 KB Output is correct
13 Correct 6 ms 18356 KB Output is correct
14 Correct 6 ms 18780 KB Output is correct
15 Correct 6 ms 18012 KB Output is correct
16 Correct 6 ms 18268 KB Output is correct
17 Correct 6 ms 17868 KB Output is correct
18 Correct 6 ms 18008 KB Output is correct
19 Correct 5 ms 17244 KB Output is correct
20 Correct 5 ms 17244 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17496 KB Output is correct
2 Correct 6 ms 18012 KB Output is correct
3 Correct 6 ms 18012 KB Output is correct
4 Correct 7 ms 18524 KB Output is correct
5 Correct 4 ms 16816 KB Output is correct
6 Correct 4 ms 16732 KB Output is correct
7 Correct 6 ms 18012 KB Output is correct
8 Correct 7 ms 18012 KB Output is correct
9 Correct 7 ms 18008 KB Output is correct
10 Correct 7 ms 18268 KB Output is correct
11 Correct 7 ms 18080 KB Output is correct
12 Correct 9 ms 18012 KB Output is correct
13 Correct 6 ms 18356 KB Output is correct
14 Correct 6 ms 18780 KB Output is correct
15 Correct 6 ms 18012 KB Output is correct
16 Correct 6 ms 18268 KB Output is correct
17 Correct 6 ms 17868 KB Output is correct
18 Correct 6 ms 18008 KB Output is correct
19 Correct 5 ms 17244 KB Output is correct
20 Correct 5 ms 17244 KB Output is correct
21 Correct 6 ms 17756 KB Output is correct
22 Correct 6 ms 17756 KB Output is correct
23 Correct 6 ms 18012 KB Output is correct
24 Correct 7 ms 18524 KB Output is correct
25 Correct 4 ms 16732 KB Output is correct
26 Correct 4 ms 16732 KB Output is correct
27 Correct 6 ms 18008 KB Output is correct
28 Correct 6 ms 18268 KB Output is correct
29 Correct 6 ms 18068 KB Output is correct
30 Correct 6 ms 18100 KB Output is correct
31 Correct 7 ms 18008 KB Output is correct
32 Correct 6 ms 18012 KB Output is correct
33 Correct 6 ms 18472 KB Output is correct
34 Correct 6 ms 18780 KB Output is correct
35 Correct 6 ms 18012 KB Output is correct
36 Correct 6 ms 18264 KB Output is correct
37 Correct 5 ms 16988 KB Output is correct
38 Correct 5 ms 17212 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 24676 KB Output is correct
2 Correct 62 ms 26396 KB Output is correct
3 Correct 67 ms 27500 KB Output is correct
4 Correct 64 ms 27240 KB Output is correct
5 Correct 71 ms 30284 KB Output is correct
6 Correct 72 ms 30288 KB Output is correct
7 Correct 34 ms 17364 KB Output is correct
8 Correct 36 ms 17724 KB Output is correct
9 Correct 58 ms 25172 KB Output is correct
10 Correct 62 ms 25000 KB Output is correct
11 Correct 58 ms 25172 KB Output is correct
12 Correct 58 ms 25168 KB Output is correct
13 Correct 53 ms 25956 KB Output is correct
14 Correct 62 ms 27648 KB Output is correct
15 Correct 62 ms 29520 KB Output is correct
16 Correct 69 ms 30296 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 954 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17496 KB Output is correct
2 Correct 6 ms 18012 KB Output is correct
3 Correct 6 ms 18012 KB Output is correct
4 Correct 7 ms 18524 KB Output is correct
5 Correct 4 ms 16816 KB Output is correct
6 Correct 4 ms 16732 KB Output is correct
7 Correct 6 ms 18012 KB Output is correct
8 Correct 7 ms 18012 KB Output is correct
9 Correct 7 ms 18008 KB Output is correct
10 Correct 7 ms 18268 KB Output is correct
11 Correct 7 ms 18080 KB Output is correct
12 Correct 9 ms 18012 KB Output is correct
13 Correct 6 ms 18356 KB Output is correct
14 Correct 6 ms 18780 KB Output is correct
15 Correct 6 ms 18012 KB Output is correct
16 Correct 6 ms 18268 KB Output is correct
17 Correct 6 ms 17868 KB Output is correct
18 Correct 6 ms 18008 KB Output is correct
19 Correct 5 ms 17244 KB Output is correct
20 Correct 5 ms 17244 KB Output is correct
21 Correct 57 ms 24676 KB Output is correct
22 Correct 62 ms 26396 KB Output is correct
23 Correct 67 ms 27500 KB Output is correct
24 Correct 64 ms 27240 KB Output is correct
25 Correct 71 ms 30284 KB Output is correct
26 Correct 72 ms 30288 KB Output is correct
27 Correct 34 ms 17364 KB Output is correct
28 Correct 36 ms 17724 KB Output is correct
29 Correct 58 ms 25172 KB Output is correct
30 Correct 62 ms 25000 KB Output is correct
31 Correct 58 ms 25172 KB Output is correct
32 Correct 58 ms 25168 KB Output is correct
33 Correct 53 ms 25956 KB Output is correct
34 Correct 62 ms 27648 KB Output is correct
35 Correct 62 ms 29520 KB Output is correct
36 Correct 69 ms 30296 KB Output is correct
37 Correct 336 ms 160772 KB Output is correct
38 Correct 432 ms 223232 KB Output is correct
39 Correct 27 ms 17364 KB Output is correct
40 Correct 30 ms 17880 KB Output is correct
41 Correct 431 ms 220136 KB Output is correct
42 Correct 438 ms 222488 KB Output is correct
43 Correct 434 ms 221544 KB Output is correct
44 Correct 435 ms 220280 KB Output is correct
45 Correct 438 ms 221528 KB Output is correct
46 Correct 447 ms 221832 KB Output is correct
47 Correct 453 ms 290016 KB Output is correct
48 Correct 393 ms 234724 KB Output is correct
49 Correct 269 ms 141760 KB Output is correct
50 Correct 380 ms 193332 KB Output is correct
51 Correct 437 ms 222092 KB Output is correct
52 Correct 444 ms 221772 KB Output is correct
53 Correct 60 ms 27880 KB Output is correct
54 Correct 87 ms 30140 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 561 ms 235500 KB Output is correct
2 Correct 593 ms 247212 KB Output is correct
3 Correct 641 ms 268196 KB Output is correct
4 Correct 465 ms 203492 KB Output is correct
5 Correct 578 ms 246296 KB Output is correct
6 Correct 693 ms 283836 KB Output is correct
7 Correct 51 ms 17488 KB Output is correct
8 Correct 46 ms 17696 KB Output is correct
9 Correct 711 ms 401976 KB Output is correct
10 Correct 388 ms 224620 KB Output is correct
11 Correct 640 ms 336800 KB Output is correct
12 Correct 625 ms 328104 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17496 KB Output is correct
2 Correct 6 ms 18012 KB Output is correct
3 Correct 6 ms 18012 KB Output is correct
4 Correct 7 ms 18524 KB Output is correct
5 Correct 4 ms 16816 KB Output is correct
6 Correct 4 ms 16732 KB Output is correct
7 Correct 6 ms 18012 KB Output is correct
8 Correct 7 ms 18012 KB Output is correct
9 Correct 7 ms 18008 KB Output is correct
10 Correct 7 ms 18268 KB Output is correct
11 Correct 7 ms 18080 KB Output is correct
12 Correct 9 ms 18012 KB Output is correct
13 Correct 6 ms 18356 KB Output is correct
14 Correct 6 ms 18780 KB Output is correct
15 Correct 6 ms 18012 KB Output is correct
16 Correct 6 ms 18268 KB Output is correct
17 Correct 6 ms 17868 KB Output is correct
18 Correct 6 ms 18008 KB Output is correct
19 Correct 5 ms 17244 KB Output is correct
20 Correct 5 ms 17244 KB Output is correct
21 Correct 6 ms 17756 KB Output is correct
22 Correct 6 ms 17756 KB Output is correct
23 Correct 6 ms 18012 KB Output is correct
24 Correct 7 ms 18524 KB Output is correct
25 Correct 4 ms 16732 KB Output is correct
26 Correct 4 ms 16732 KB Output is correct
27 Correct 6 ms 18008 KB Output is correct
28 Correct 6 ms 18268 KB Output is correct
29 Correct 6 ms 18068 KB Output is correct
30 Correct 6 ms 18100 KB Output is correct
31 Correct 7 ms 18008 KB Output is correct
32 Correct 6 ms 18012 KB Output is correct
33 Correct 6 ms 18472 KB Output is correct
34 Correct 6 ms 18780 KB Output is correct
35 Correct 6 ms 18012 KB Output is correct
36 Correct 6 ms 18264 KB Output is correct
37 Correct 5 ms 16988 KB Output is correct
38 Correct 5 ms 17212 KB Output is correct
39 Correct 57 ms 24676 KB Output is correct
40 Correct 62 ms 26396 KB Output is correct
41 Correct 67 ms 27500 KB Output is correct
42 Correct 64 ms 27240 KB Output is correct
43 Correct 71 ms 30284 KB Output is correct
44 Correct 72 ms 30288 KB Output is correct
45 Correct 34 ms 17364 KB Output is correct
46 Correct 36 ms 17724 KB Output is correct
47 Correct 58 ms 25172 KB Output is correct
48 Correct 62 ms 25000 KB Output is correct
49 Correct 58 ms 25172 KB Output is correct
50 Correct 58 ms 25168 KB Output is correct
51 Correct 53 ms 25956 KB Output is correct
52 Correct 62 ms 27648 KB Output is correct
53 Correct 62 ms 29520 KB Output is correct
54 Correct 69 ms 30296 KB Output is correct
55 Correct 336 ms 160772 KB Output is correct
56 Correct 432 ms 223232 KB Output is correct
57 Correct 27 ms 17364 KB Output is correct
58 Correct 30 ms 17880 KB Output is correct
59 Correct 431 ms 220136 KB Output is correct
60 Correct 438 ms 222488 KB Output is correct
61 Correct 434 ms 221544 KB Output is correct
62 Correct 435 ms 220280 KB Output is correct
63 Correct 438 ms 221528 KB Output is correct
64 Correct 447 ms 221832 KB Output is correct
65 Correct 453 ms 290016 KB Output is correct
66 Correct 393 ms 234724 KB Output is correct
67 Correct 269 ms 141760 KB Output is correct
68 Correct 380 ms 193332 KB Output is correct
69 Correct 437 ms 222092 KB Output is correct
70 Correct 444 ms 221772 KB Output is correct
71 Correct 60 ms 27880 KB Output is correct
72 Correct 87 ms 30140 KB Output is correct
73 Correct 561 ms 235500 KB Output is correct
74 Correct 593 ms 247212 KB Output is correct
75 Correct 641 ms 268196 KB Output is correct
76 Correct 465 ms 203492 KB Output is correct
77 Correct 578 ms 246296 KB Output is correct
78 Correct 693 ms 283836 KB Output is correct
79 Correct 51 ms 17488 KB Output is correct
80 Correct 46 ms 17696 KB Output is correct
81 Correct 711 ms 401976 KB Output is correct
82 Correct 388 ms 224620 KB Output is correct
83 Correct 640 ms 336800 KB Output is correct
84 Correct 625 ms 328104 KB Output is correct
85 Correct 342 ms 152472 KB Output is correct
86 Correct 449 ms 185992 KB Output is correct
87 Correct 497 ms 245460 KB Output is correct
88 Correct 602 ms 283064 KB Output is correct
89 Correct 287 ms 138108 KB Output is correct
90 Correct 475 ms 222464 KB Output is correct
91 Correct 341 ms 156000 KB Output is correct
92 Correct 302 ms 148808 KB Output is correct
93 Correct 488 ms 222080 KB Output is correct
94 Correct 460 ms 222960 KB Output is correct
95 Correct 425 ms 208312 KB Output is correct
96 Correct 470 ms 224600 KB Output is correct
97 Correct 440 ms 222160 KB Output is correct
98 Correct 328 ms 165964 KB Output is correct
99 Correct 461 ms 292636 KB Output is correct
100 Correct 314 ms 188844 KB Output is correct
101 Correct 386 ms 232396 KB Output is correct
102 Correct 222 ms 108008 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17496 KB Output is correct
2 Correct 6 ms 18012 KB Output is correct
3 Correct 6 ms 18012 KB Output is correct
4 Correct 7 ms 18524 KB Output is correct
5 Correct 4 ms 16816 KB Output is correct
6 Correct 4 ms 16732 KB Output is correct
7 Correct 6 ms 18012 KB Output is correct
8 Correct 7 ms 18012 KB Output is correct
9 Correct 7 ms 18008 KB Output is correct
10 Correct 7 ms 18268 KB Output is correct
11 Correct 7 ms 18080 KB Output is correct
12 Correct 9 ms 18012 KB Output is correct
13 Correct 6 ms 18356 KB Output is correct
14 Correct 6 ms 18780 KB Output is correct
15 Correct 6 ms 18012 KB Output is correct
16 Correct 6 ms 18268 KB Output is correct
17 Correct 6 ms 17868 KB Output is correct
18 Correct 6 ms 18008 KB Output is correct
19 Correct 5 ms 17244 KB Output is correct
20 Correct 5 ms 17244 KB Output is correct
21 Correct 6 ms 17756 KB Output is correct
22 Correct 6 ms 17756 KB Output is correct
23 Correct 6 ms 18012 KB Output is correct
24 Correct 7 ms 18524 KB Output is correct
25 Correct 4 ms 16732 KB Output is correct
26 Correct 4 ms 16732 KB Output is correct
27 Correct 6 ms 18008 KB Output is correct
28 Correct 6 ms 18268 KB Output is correct
29 Correct 6 ms 18068 KB Output is correct
30 Correct 6 ms 18100 KB Output is correct
31 Correct 7 ms 18008 KB Output is correct
32 Correct 6 ms 18012 KB Output is correct
33 Correct 6 ms 18472 KB Output is correct
34 Correct 6 ms 18780 KB Output is correct
35 Correct 6 ms 18012 KB Output is correct
36 Correct 6 ms 18264 KB Output is correct
37 Correct 5 ms 16988 KB Output is correct
38 Correct 5 ms 17212 KB Output is correct
39 Correct 57 ms 24676 KB Output is correct
40 Correct 62 ms 26396 KB Output is correct
41 Correct 67 ms 27500 KB Output is correct
42 Correct 64 ms 27240 KB Output is correct
43 Correct 71 ms 30284 KB Output is correct
44 Correct 72 ms 30288 KB Output is correct
45 Correct 34 ms 17364 KB Output is correct
46 Correct 36 ms 17724 KB Output is correct
47 Correct 58 ms 25172 KB Output is correct
48 Correct 62 ms 25000 KB Output is correct
49 Correct 58 ms 25172 KB Output is correct
50 Correct 58 ms 25168 KB Output is correct
51 Correct 53 ms 25956 KB Output is correct
52 Correct 62 ms 27648 KB Output is correct
53 Correct 62 ms 29520 KB Output is correct
54 Correct 69 ms 30296 KB Output is correct
55 Runtime error 954 ms 524288 KB Execution killed with signal 9
56 Halted 0 ms 0 KB -