oj.uz

답안 #493403

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
493403 2021-12-11T08:22:50 Z blue 푸드 코트 (JOI21_foodcourt) C++17
14 / 100
 1000 ms 67524 KB 
#include <iostream>
#include <vector>
using namespace std;

using vi = vector<int>;
using ll = long long;
using vll = vector<ll>;

const int mx = 250'000;
const ll INF = 1'000'000'000'000'000'000LL;

vi L(1+mx), R(1+mx), C(1+mx), A(1+mx);
vll K(1+mx), B(1+mx);
vi T(1+mx);

vi st[1+mx], en[1+mx], qr[1+mx];

vi ans(1+mx, 0);



struct segtree
{
    int l;
    int r;

    pair<ll, int> mn;
    ll lp = 0;

    segtree* left = NULL;
    segtree* right = NULL;


    segtree()
    {
        ;
    }

    segtree(int L, int R)
    {
        l = L;
        r = R;
        mn = {0, l};
        if(l == r) return;
        int m = (l+r)/2;
        left = new segtree(l, m);
        right = new segtree(m+1, r);
    }

    void add(int L, int R, ll V)
    {
        if(r < L || R < l) return;
        else if(L <= l && r <= R)
        {
            lp += V;
            mn.first += V;
        }
        else
        {
            left->add(L, R, V);
            right->add(L, R, V);
            mn = min(left->mn, right->mn);
            mn.first += lp;
        }
    }

    pair<ll, int> rangemin(int L, int R)
    {
        if(R < l || r < L) return {INF, -1};
        else if(L <= l && r <= R) return mn;
        else
        {
            auto res = min(left->rangemin(L, R), right->rangemin(L, R));
            res.first += lp;
            return res;
        }
    }
};



int main()
{
    int N, M, Q;
    cin >> N >> M >> Q;

    for(int j = 1; j <= Q; j++)
    {
        cin >> T[j];
        if(T[j] == 1) cin >> L[j] >> R[j] >> C[j] >> K[j];
        else if(T[j] == 2)
        {
            cin >> L[j] >> R[j] >> K[j];
            K[j] *= -1;
        }
        else cin >> A[j] >> B[j];

        if(T[j] <= 2)
        {
            st[L[j]].push_back(j);
            en[R[j]].push_back(j);
        }
        else qr[A[j]].push_back(j);
    }

    vll S(1+Q, 0);

    vi ans(1+Q, 0);

    segtree ST(0, Q);

    for(int i = 1; i <= N; i++)
    {
        for(int o: st[i])
        {
            S[o] = K[o];
            ST.add(o, Q, +K[o]);
        }

        for(int q: qr[i])
        {
            pair<ll, int> pos{0, 0};
            ll curr_sum = 0;
            for(int j = 1; j <= q-1; j++)
            {
                curr_sum += S[j];
                pos = min(pos, {curr_sum, j});
            }

            int p = pos.second;

            p = ST.rangemin(0, q-1).second;

            ll minus_sum = 0;
            for(int j = p+1; j <= q; j++)
                if(S[j] < 0)
                    minus_sum += -S[j];

            // cerr << "p = " << p << '\n';
            // cerr << "total loss = " << minus_sum << '\n';

            ll plus_sum = 0;
            for(int j = p+1; j <= q; j++)
            {
                if(S[j] > 0)
                    plus_sum += S[j];

                if(plus_sum >= minus_sum + B[q])
                {
                    ans[q] = C[j];
                    break;
                }
            }
        }

        for(int o: en[i])
        {
            S[o] = 0;
            ST.add(o, Q, -K[o]);
        }
    }



    for(int q = 1; q <= Q; q++)
        if(T[q] == 3)
            cout << ans[q] << '\n';
    // cout << '\n';
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 27980 KB Output is correct
2 Correct 16 ms 28064 KB Output is correct
3 Correct 19 ms 27892 KB Output is correct
4 Correct 19 ms 27964 KB Output is correct
5 Correct 15 ms 27980 KB Output is correct
6 Correct 18 ms 28012 KB Output is correct
7 Correct 16 ms 28020 KB Output is correct
8 Correct 17 ms 27984 KB Output is correct
9 Correct 16 ms 27980 KB Output is correct
10 Correct 19 ms 27960 KB Output is correct
11 Correct 20 ms 28040 KB Output is correct
12 Correct 17 ms 28012 KB Output is correct
13 Correct 16 ms 27856 KB Output is correct
14 Correct 16 ms 27980 KB Output is correct
15 Correct 15 ms 27872 KB Output is correct
16 Correct 16 ms 28028 KB Output is correct
17 Correct 16 ms 27976 KB Output is correct
18 Correct 16 ms 28008 KB Output is correct
19 Correct 16 ms 28040 KB Output is correct
20 Correct 15 ms 27980 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 27980 KB Output is correct
2 Correct 16 ms 28064 KB Output is correct
3 Correct 19 ms 27892 KB Output is correct
4 Correct 19 ms 27964 KB Output is correct
5 Correct 15 ms 27980 KB Output is correct
6 Correct 18 ms 28012 KB Output is correct
7 Correct 16 ms 28020 KB Output is correct
8 Correct 17 ms 27984 KB Output is correct
9 Correct 16 ms 27980 KB Output is correct
10 Correct 19 ms 27960 KB Output is correct
11 Correct 20 ms 28040 KB Output is correct
12 Correct 17 ms 28012 KB Output is correct
13 Correct 16 ms 27856 KB Output is correct
14 Correct 16 ms 27980 KB Output is correct
15 Correct 15 ms 27872 KB Output is correct
16 Correct 16 ms 28028 KB Output is correct
17 Correct 16 ms 27976 KB Output is correct
18 Correct 16 ms 28008 KB Output is correct
19 Correct 16 ms 28040 KB Output is correct
20 Correct 15 ms 27980 KB Output is correct
21 Correct 15 ms 27980 KB Output is correct
22 Correct 17 ms 28016 KB Output is correct
23 Correct 17 ms 28108 KB Output is correct
24 Correct 18 ms 27980 KB Output is correct
25 Correct 17 ms 27884 KB Output is correct
26 Correct 17 ms 27980 KB Output is correct
27 Correct 20 ms 27956 KB Output is correct
28 Correct 17 ms 28052 KB Output is correct
29 Correct 18 ms 27980 KB Output is correct
30 Correct 17 ms 28008 KB Output is correct
31 Correct 19 ms 27952 KB Output is correct
32 Correct 18 ms 27980 KB Output is correct
33 Correct 16 ms 27980 KB Output is correct
34 Correct 19 ms 27984 KB Output is correct
35 Correct 16 ms 27968 KB Output is correct
36 Correct 17 ms 27984 KB Output is correct
37 Correct 15 ms 27876 KB Output is correct
38 Correct 16 ms 27980 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 39108 KB Output is correct
2 Correct 157 ms 40360 KB Output is correct
3 Correct 154 ms 40276 KB Output is correct
4 Correct 152 ms 40344 KB Output is correct
5 Correct 148 ms 40436 KB Output is correct
6 Correct 182 ms 40540 KB Output is correct
7 Correct 76 ms 37136 KB Output is correct
8 Correct 80 ms 37300 KB Output is correct
9 Correct 168 ms 40468 KB Output is correct
10 Correct 150 ms 40388 KB Output is correct
11 Correct 156 ms 40300 KB Output is correct
12 Correct 150 ms 40356 KB Output is correct
13 Correct 115 ms 38696 KB Output is correct
14 Correct 148 ms 40252 KB Output is correct
15 Correct 159 ms 39944 KB Output is correct
16 Correct 163 ms 40464 KB Output is correct

Subtask #4
0 / 21.0

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

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 27980 KB Output is correct
2 Correct 16 ms 28064 KB Output is correct
3 Correct 19 ms 27892 KB Output is correct
4 Correct 19 ms 27964 KB Output is correct
5 Correct 15 ms 27980 KB Output is correct
6 Correct 18 ms 28012 KB Output is correct
7 Correct 16 ms 28020 KB Output is correct
8 Correct 17 ms 27984 KB Output is correct
9 Correct 16 ms 27980 KB Output is correct
10 Correct 19 ms 27960 KB Output is correct
11 Correct 20 ms 28040 KB Output is correct
12 Correct 17 ms 28012 KB Output is correct
13 Correct 16 ms 27856 KB Output is correct
14 Correct 16 ms 27980 KB Output is correct
15 Correct 15 ms 27872 KB Output is correct
16 Correct 16 ms 28028 KB Output is correct
17 Correct 16 ms 27976 KB Output is correct
18 Correct 16 ms 28008 KB Output is correct
19 Correct 16 ms 28040 KB Output is correct
20 Correct 15 ms 27980 KB Output is correct
21 Correct 135 ms 39108 KB Output is correct
22 Correct 157 ms 40360 KB Output is correct
23 Correct 154 ms 40276 KB Output is correct
24 Correct 152 ms 40344 KB Output is correct
25 Correct 148 ms 40436 KB Output is correct
26 Correct 182 ms 40540 KB Output is correct
27 Correct 76 ms 37136 KB Output is correct
28 Correct 80 ms 37300 KB Output is correct
29 Correct 168 ms 40468 KB Output is correct
30 Correct 150 ms 40388 KB Output is correct
31 Correct 156 ms 40300 KB Output is correct
32 Correct 150 ms 40356 KB Output is correct
33 Correct 115 ms 38696 KB Output is correct
34 Correct 148 ms 40252 KB Output is correct
35 Correct 159 ms 39944 KB Output is correct
36 Correct 163 ms 40464 KB Output is correct
37 Correct 543 ms 38952 KB Output is correct
38 Correct 585 ms 37560 KB Output is correct
39 Correct 332 ms 35908 KB Output is correct
40 Correct 415 ms 37056 KB Output is correct
41 Correct 888 ms 39940 KB Output is correct
42 Correct 931 ms 39924 KB Output is correct
43 Correct 418 ms 39884 KB Output is correct
44 Correct 663 ms 39924 KB Output is correct
45 Correct 948 ms 39924 KB Output is correct
46 Correct 422 ms 39972 KB Output is correct
47 Execution timed out 1034 ms 38416 KB Time limit exceeded
48 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 27980 KB Output is correct
2 Correct 16 ms 28064 KB Output is correct
3 Correct 19 ms 27892 KB Output is correct
4 Correct 19 ms 27964 KB Output is correct
5 Correct 15 ms 27980 KB Output is correct
6 Correct 18 ms 28012 KB Output is correct
7 Correct 16 ms 28020 KB Output is correct
8 Correct 17 ms 27984 KB Output is correct
9 Correct 16 ms 27980 KB Output is correct
10 Correct 19 ms 27960 KB Output is correct
11 Correct 20 ms 28040 KB Output is correct
12 Correct 17 ms 28012 KB Output is correct
13 Correct 16 ms 27856 KB Output is correct
14 Correct 16 ms 27980 KB Output is correct
15 Correct 15 ms 27872 KB Output is correct
16 Correct 16 ms 28028 KB Output is correct
17 Correct 16 ms 27976 KB Output is correct
18 Correct 16 ms 28008 KB Output is correct
19 Correct 16 ms 28040 KB Output is correct
20 Correct 15 ms 27980 KB Output is correct
21 Correct 15 ms 27980 KB Output is correct
22 Correct 17 ms 28016 KB Output is correct
23 Correct 17 ms 28108 KB Output is correct
24 Correct 18 ms 27980 KB Output is correct
25 Correct 17 ms 27884 KB Output is correct
26 Correct 17 ms 27980 KB Output is correct
27 Correct 20 ms 27956 KB Output is correct
28 Correct 17 ms 28052 KB Output is correct
29 Correct 18 ms 27980 KB Output is correct
30 Correct 17 ms 28008 KB Output is correct
31 Correct 19 ms 27952 KB Output is correct
32 Correct 18 ms 27980 KB Output is correct
33 Correct 16 ms 27980 KB Output is correct
34 Correct 19 ms 27984 KB Output is correct
35 Correct 16 ms 27968 KB Output is correct
36 Correct 17 ms 27984 KB Output is correct
37 Correct 15 ms 27876 KB Output is correct
38 Correct 16 ms 27980 KB Output is correct
39 Correct 135 ms 39108 KB Output is correct
40 Correct 157 ms 40360 KB Output is correct
41 Correct 154 ms 40276 KB Output is correct
42 Correct 152 ms 40344 KB Output is correct
43 Correct 148 ms 40436 KB Output is correct
44 Correct 182 ms 40540 KB Output is correct
45 Correct 76 ms 37136 KB Output is correct
46 Correct 80 ms 37300 KB Output is correct
47 Correct 168 ms 40468 KB Output is correct
48 Correct 150 ms 40388 KB Output is correct
49 Correct 156 ms 40300 KB Output is correct
50 Correct 150 ms 40356 KB Output is correct
51 Correct 115 ms 38696 KB Output is correct
52 Correct 148 ms 40252 KB Output is correct
53 Correct 159 ms 39944 KB Output is correct
54 Correct 163 ms 40464 KB Output is correct
55 Correct 543 ms 38952 KB Output is correct
56 Correct 585 ms 37560 KB Output is correct
57 Correct 332 ms 35908 KB Output is correct
58 Correct 415 ms 37056 KB Output is correct
59 Correct 888 ms 39940 KB Output is correct
60 Correct 931 ms 39924 KB Output is correct
61 Correct 418 ms 39884 KB Output is correct
62 Correct 663 ms 39924 KB Output is correct
63 Correct 948 ms 39924 KB Output is correct
64 Correct 422 ms 39972 KB Output is correct
65 Execution timed out 1034 ms 38416 KB Time limit exceeded
66 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 27980 KB Output is correct
2 Correct 16 ms 28064 KB Output is correct
3 Correct 19 ms 27892 KB Output is correct
4 Correct 19 ms 27964 KB Output is correct
5 Correct 15 ms 27980 KB Output is correct
6 Correct 18 ms 28012 KB Output is correct
7 Correct 16 ms 28020 KB Output is correct
8 Correct 17 ms 27984 KB Output is correct
9 Correct 16 ms 27980 KB Output is correct
10 Correct 19 ms 27960 KB Output is correct
11 Correct 20 ms 28040 KB Output is correct
12 Correct 17 ms 28012 KB Output is correct
13 Correct 16 ms 27856 KB Output is correct
14 Correct 16 ms 27980 KB Output is correct
15 Correct 15 ms 27872 KB Output is correct
16 Correct 16 ms 28028 KB Output is correct
17 Correct 16 ms 27976 KB Output is correct
18 Correct 16 ms 28008 KB Output is correct
19 Correct 16 ms 28040 KB Output is correct
20 Correct 15 ms 27980 KB Output is correct
21 Correct 15 ms 27980 KB Output is correct
22 Correct 17 ms 28016 KB Output is correct
23 Correct 17 ms 28108 KB Output is correct
24 Correct 18 ms 27980 KB Output is correct
25 Correct 17 ms 27884 KB Output is correct
26 Correct 17 ms 27980 KB Output is correct
27 Correct 20 ms 27956 KB Output is correct
28 Correct 17 ms 28052 KB Output is correct
29 Correct 18 ms 27980 KB Output is correct
30 Correct 17 ms 28008 KB Output is correct
31 Correct 19 ms 27952 KB Output is correct
32 Correct 18 ms 27980 KB Output is correct
33 Correct 16 ms 27980 KB Output is correct
34 Correct 19 ms 27984 KB Output is correct
35 Correct 16 ms 27968 KB Output is correct
36 Correct 17 ms 27984 KB Output is correct
37 Correct 15 ms 27876 KB Output is correct
38 Correct 16 ms 27980 KB Output is correct
39 Correct 135 ms 39108 KB Output is correct
40 Correct 157 ms 40360 KB Output is correct
41 Correct 154 ms 40276 KB Output is correct
42 Correct 152 ms 40344 KB Output is correct
43 Correct 148 ms 40436 KB Output is correct
44 Correct 182 ms 40540 KB Output is correct
45 Correct 76 ms 37136 KB Output is correct
46 Correct 80 ms 37300 KB Output is correct
47 Correct 168 ms 40468 KB Output is correct
48 Correct 150 ms 40388 KB Output is correct
49 Correct 156 ms 40300 KB Output is correct
50 Correct 150 ms 40356 KB Output is correct
51 Correct 115 ms 38696 KB Output is correct
52 Correct 148 ms 40252 KB Output is correct
53 Correct 159 ms 39944 KB Output is correct
54 Correct 163 ms 40464 KB Output is correct
55 Execution timed out 1095 ms 67524 KB Time limit exceeded
56 Halted 0 ms 0 KB -