oj.uz

답안 #890548

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
890548 2023-12-21T13:05:32 Z LucaIlie 푸드 코트 (JOI21_foodcourt) C++17
68 / 100
 1000 ms 498980 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 );

            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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 17500 KB Output is correct
2 Correct 8 ms 18012 KB Output is correct
3 Correct 6 ms 18012 KB Output is correct
4 Correct 7 ms 18352 KB Output is correct
5 Correct 4 ms 16732 KB Output is correct
6 Correct 4 ms 16732 KB Output is correct
7 Correct 6 ms 17980 KB Output is correct
8 Correct 6 ms 18012 KB Output is correct
9 Correct 6 ms 18012 KB Output is correct
10 Correct 6 ms 18264 KB Output is correct
11 Correct 6 ms 18012 KB Output is correct
12 Correct 6 ms 18012 KB Output is correct
13 Correct 5 ms 18264 KB Output is correct
14 Correct 7 ms 18780 KB Output is correct
15 Correct 5 ms 17960 KB Output is correct
16 Correct 6 ms 18268 KB Output is correct
17 Correct 5 ms 17756 KB Output is correct
18 Correct 6 ms 18012 KB Output is correct
19 Correct 6 ms 17244 KB Output is correct
20 Correct 5 ms 17328 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 17500 KB Output is correct
2 Correct 8 ms 18012 KB Output is correct
3 Correct 6 ms 18012 KB Output is correct
4 Correct 7 ms 18352 KB Output is correct
5 Correct 4 ms 16732 KB Output is correct
6 Correct 4 ms 16732 KB Output is correct
7 Correct 6 ms 17980 KB Output is correct
8 Correct 6 ms 18012 KB Output is correct
9 Correct 6 ms 18012 KB Output is correct
10 Correct 6 ms 18264 KB Output is correct
11 Correct 6 ms 18012 KB Output is correct
12 Correct 6 ms 18012 KB Output is correct
13 Correct 5 ms 18264 KB Output is correct
14 Correct 7 ms 18780 KB Output is correct
15 Correct 5 ms 17960 KB Output is correct
16 Correct 6 ms 18268 KB Output is correct
17 Correct 5 ms 17756 KB Output is correct
18 Correct 6 ms 18012 KB Output is correct
19 Correct 6 ms 17244 KB Output is correct
20 Correct 5 ms 17328 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 16728 KB Output is correct
27 Correct 8 ms 18108 KB Output is correct
28 Correct 7 ms 18268 KB Output is correct
29 Correct 6 ms 18012 KB Output is correct
30 Correct 7 ms 18012 KB Output is correct
31 Correct 6 ms 18072 KB Output is correct
32 Correct 6 ms 18012 KB Output is correct
33 Correct 6 ms 18524 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 18268 KB Output is correct
37 Correct 4 ms 16988 KB Output is correct
38 Correct 5 ms 17240 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 24644 KB Output is correct
2 Correct 65 ms 26500 KB Output is correct
3 Correct 62 ms 27476 KB Output is correct
4 Correct 65 ms 27396 KB Output is correct
5 Correct 75 ms 30288 KB Output is correct
6 Correct 71 ms 30288 KB Output is correct
7 Correct 36 ms 17364 KB Output is correct
8 Correct 37 ms 17728 KB Output is correct
9 Correct 70 ms 25168 KB Output is correct
10 Correct 59 ms 25056 KB Output is correct
11 Correct 60 ms 25000 KB Output is correct
12 Correct 58 ms 25172 KB Output is correct
13 Correct 71 ms 26044 KB Output is correct
14 Correct 62 ms 27580 KB Output is correct
15 Correct 65 ms 29564 KB Output is correct
16 Correct 73 ms 30264 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1066 ms 498980 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 17500 KB Output is correct
2 Correct 8 ms 18012 KB Output is correct
3 Correct 6 ms 18012 KB Output is correct
4 Correct 7 ms 18352 KB Output is correct
5 Correct 4 ms 16732 KB Output is correct
6 Correct 4 ms 16732 KB Output is correct
7 Correct 6 ms 17980 KB Output is correct
8 Correct 6 ms 18012 KB Output is correct
9 Correct 6 ms 18012 KB Output is correct
10 Correct 6 ms 18264 KB Output is correct
11 Correct 6 ms 18012 KB Output is correct
12 Correct 6 ms 18012 KB Output is correct
13 Correct 5 ms 18264 KB Output is correct
14 Correct 7 ms 18780 KB Output is correct
15 Correct 5 ms 17960 KB Output is correct
16 Correct 6 ms 18268 KB Output is correct
17 Correct 5 ms 17756 KB Output is correct
18 Correct 6 ms 18012 KB Output is correct
19 Correct 6 ms 17244 KB Output is correct
20 Correct 5 ms 17328 KB Output is correct
21 Correct 63 ms 24644 KB Output is correct
22 Correct 65 ms 26500 KB Output is correct
23 Correct 62 ms 27476 KB Output is correct
24 Correct 65 ms 27396 KB Output is correct
25 Correct 75 ms 30288 KB Output is correct
26 Correct 71 ms 30288 KB Output is correct
27 Correct 36 ms 17364 KB Output is correct
28 Correct 37 ms 17728 KB Output is correct
29 Correct 70 ms 25168 KB Output is correct
30 Correct 59 ms 25056 KB Output is correct
31 Correct 60 ms 25000 KB Output is correct
32 Correct 58 ms 25172 KB Output is correct
33 Correct 71 ms 26044 KB Output is correct
34 Correct 62 ms 27580 KB Output is correct
35 Correct 65 ms 29564 KB Output is correct
36 Correct 73 ms 30264 KB Output is correct
37 Correct 335 ms 161156 KB Output is correct
38 Correct 407 ms 223256 KB Output is correct
39 Correct 27 ms 17632 KB Output is correct
40 Correct 31 ms 17868 KB Output is correct
41 Correct 433 ms 220132 KB Output is correct
42 Correct 444 ms 222452 KB Output is correct
43 Correct 426 ms 221548 KB Output is correct
44 Correct 434 ms 220132 KB Output is correct
45 Correct 445 ms 221252 KB Output is correct
46 Correct 439 ms 221780 KB Output is correct
47 Correct 462 ms 290080 KB Output is correct
48 Correct 384 ms 234468 KB Output is correct
49 Correct 266 ms 141708 KB Output is correct
50 Correct 354 ms 193168 KB Output is correct
51 Correct 433 ms 222496 KB Output is correct
52 Correct 418 ms 221776 KB Output is correct
53 Correct 57 ms 28076 KB Output is correct
54 Correct 79 ms 30292 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 492 ms 235436 KB Output is correct
2 Correct 513 ms 247420 KB Output is correct
3 Correct 573 ms 268344 KB Output is correct
4 Correct 414 ms 203320 KB Output is correct
5 Correct 538 ms 246432 KB Output is correct
6 Correct 629 ms 284064 KB Output is correct
7 Correct 49 ms 17632 KB Output is correct
8 Correct 46 ms 17684 KB Output is correct
9 Correct 676 ms 402100 KB Output is correct
10 Correct 412 ms 224532 KB Output is correct
11 Correct 589 ms 336960 KB Output is correct
12 Correct 585 ms 328240 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 17500 KB Output is correct
2 Correct 8 ms 18012 KB Output is correct
3 Correct 6 ms 18012 KB Output is correct
4 Correct 7 ms 18352 KB Output is correct
5 Correct 4 ms 16732 KB Output is correct
6 Correct 4 ms 16732 KB Output is correct
7 Correct 6 ms 17980 KB Output is correct
8 Correct 6 ms 18012 KB Output is correct
9 Correct 6 ms 18012 KB Output is correct
10 Correct 6 ms 18264 KB Output is correct
11 Correct 6 ms 18012 KB Output is correct
12 Correct 6 ms 18012 KB Output is correct
13 Correct 5 ms 18264 KB Output is correct
14 Correct 7 ms 18780 KB Output is correct
15 Correct 5 ms 17960 KB Output is correct
16 Correct 6 ms 18268 KB Output is correct
17 Correct 5 ms 17756 KB Output is correct
18 Correct 6 ms 18012 KB Output is correct
19 Correct 6 ms 17244 KB Output is correct
20 Correct 5 ms 17328 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 16728 KB Output is correct
27 Correct 8 ms 18108 KB Output is correct
28 Correct 7 ms 18268 KB Output is correct
29 Correct 6 ms 18012 KB Output is correct
30 Correct 7 ms 18012 KB Output is correct
31 Correct 6 ms 18072 KB Output is correct
32 Correct 6 ms 18012 KB Output is correct
33 Correct 6 ms 18524 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 18268 KB Output is correct
37 Correct 4 ms 16988 KB Output is correct
38 Correct 5 ms 17240 KB Output is correct
39 Correct 63 ms 24644 KB Output is correct
40 Correct 65 ms 26500 KB Output is correct
41 Correct 62 ms 27476 KB Output is correct
42 Correct 65 ms 27396 KB Output is correct
43 Correct 75 ms 30288 KB Output is correct
44 Correct 71 ms 30288 KB Output is correct
45 Correct 36 ms 17364 KB Output is correct
46 Correct 37 ms 17728 KB Output is correct
47 Correct 70 ms 25168 KB Output is correct
48 Correct 59 ms 25056 KB Output is correct
49 Correct 60 ms 25000 KB Output is correct
50 Correct 58 ms 25172 KB Output is correct
51 Correct 71 ms 26044 KB Output is correct
52 Correct 62 ms 27580 KB Output is correct
53 Correct 65 ms 29564 KB Output is correct
54 Correct 73 ms 30264 KB Output is correct
55 Correct 335 ms 161156 KB Output is correct
56 Correct 407 ms 223256 KB Output is correct
57 Correct 27 ms 17632 KB Output is correct
58 Correct 31 ms 17868 KB Output is correct
59 Correct 433 ms 220132 KB Output is correct
60 Correct 444 ms 222452 KB Output is correct
61 Correct 426 ms 221548 KB Output is correct
62 Correct 434 ms 220132 KB Output is correct
63 Correct 445 ms 221252 KB Output is correct
64 Correct 439 ms 221780 KB Output is correct
65 Correct 462 ms 290080 KB Output is correct
66 Correct 384 ms 234468 KB Output is correct
67 Correct 266 ms 141708 KB Output is correct
68 Correct 354 ms 193168 KB Output is correct
69 Correct 433 ms 222496 KB Output is correct
70 Correct 418 ms 221776 KB Output is correct
71 Correct 57 ms 28076 KB Output is correct
72 Correct 79 ms 30292 KB Output is correct
73 Correct 492 ms 235436 KB Output is correct
74 Correct 513 ms 247420 KB Output is correct
75 Correct 573 ms 268344 KB Output is correct
76 Correct 414 ms 203320 KB Output is correct
77 Correct 538 ms 246432 KB Output is correct
78 Correct 629 ms 284064 KB Output is correct
79 Correct 49 ms 17632 KB Output is correct
80 Correct 46 ms 17684 KB Output is correct
81 Correct 676 ms 402100 KB Output is correct
82 Correct 412 ms 224532 KB Output is correct
83 Correct 589 ms 336960 KB Output is correct
84 Correct 585 ms 328240 KB Output is correct
85 Correct 314 ms 152448 KB Output is correct
86 Correct 400 ms 186096 KB Output is correct
87 Correct 466 ms 245308 KB Output is correct
88 Correct 571 ms 283360 KB Output is correct
89 Correct 256 ms 138108 KB Output is correct
90 Correct 471 ms 222504 KB Output is correct
91 Correct 297 ms 155960 KB Output is correct
92 Correct 297 ms 149208 KB Output is correct
93 Correct 485 ms 222092 KB Output is correct
94 Correct 492 ms 223308 KB Output is correct
95 Correct 435 ms 208312 KB Output is correct
96 Correct 499 ms 224644 KB Output is correct
97 Correct 522 ms 222156 KB Output is correct
98 Correct 338 ms 165856 KB Output is correct
99 Correct 483 ms 292732 KB Output is correct
100 Correct 310 ms 188848 KB Output is correct
101 Correct 408 ms 232312 KB Output is correct
102 Correct 260 ms 108116 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 17500 KB Output is correct
2 Correct 8 ms 18012 KB Output is correct
3 Correct 6 ms 18012 KB Output is correct
4 Correct 7 ms 18352 KB Output is correct
5 Correct 4 ms 16732 KB Output is correct
6 Correct 4 ms 16732 KB Output is correct
7 Correct 6 ms 17980 KB Output is correct
8 Correct 6 ms 18012 KB Output is correct
9 Correct 6 ms 18012 KB Output is correct
10 Correct 6 ms 18264 KB Output is correct
11 Correct 6 ms 18012 KB Output is correct
12 Correct 6 ms 18012 KB Output is correct
13 Correct 5 ms 18264 KB Output is correct
14 Correct 7 ms 18780 KB Output is correct
15 Correct 5 ms 17960 KB Output is correct
16 Correct 6 ms 18268 KB Output is correct
17 Correct 5 ms 17756 KB Output is correct
18 Correct 6 ms 18012 KB Output is correct
19 Correct 6 ms 17244 KB Output is correct
20 Correct 5 ms 17328 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 16728 KB Output is correct
27 Correct 8 ms 18108 KB Output is correct
28 Correct 7 ms 18268 KB Output is correct
29 Correct 6 ms 18012 KB Output is correct
30 Correct 7 ms 18012 KB Output is correct
31 Correct 6 ms 18072 KB Output is correct
32 Correct 6 ms 18012 KB Output is correct
33 Correct 6 ms 18524 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 18268 KB Output is correct
37 Correct 4 ms 16988 KB Output is correct
38 Correct 5 ms 17240 KB Output is correct
39 Correct 63 ms 24644 KB Output is correct
40 Correct 65 ms 26500 KB Output is correct
41 Correct 62 ms 27476 KB Output is correct
42 Correct 65 ms 27396 KB Output is correct
43 Correct 75 ms 30288 KB Output is correct
44 Correct 71 ms 30288 KB Output is correct
45 Correct 36 ms 17364 KB Output is correct
46 Correct 37 ms 17728 KB Output is correct
47 Correct 70 ms 25168 KB Output is correct
48 Correct 59 ms 25056 KB Output is correct
49 Correct 60 ms 25000 KB Output is correct
50 Correct 58 ms 25172 KB Output is correct
51 Correct 71 ms 26044 KB Output is correct
52 Correct 62 ms 27580 KB Output is correct
53 Correct 65 ms 29564 KB Output is correct
54 Correct 73 ms 30264 KB Output is correct
55 Execution timed out 1066 ms 498980 KB Time limit exceeded
56 Halted 0 ms 0 KB -