oj.uz

Submission #493371

# Submission time Handle Problem Language Result Execution time Memory
493371 2021-12-11T07:33:44 Z blue Food Court (JOI21_foodcourt) C++17
2 / 100
 1000 ms 40684 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;

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

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

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

    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);

    for(int i = 1; i <= N; i++)
    {
        for(int o: st[i])
            S[o] = K[o];

        for(int q: qr[i])
        {
            // cerr << "\n\n";
            // cerr << "query = " << q << '\n';
            // for(int j = 1; j <= Q; j++) cerr << S[j] << ' ';
            // cerr << '\n';




            pair<int, ll> pos{0, 0};
            ll curr_sum = 0;
            for(int j = 1; j <= q-1; j++)
            {
                curr_sum += S[j];
                    // cerr << j << " : " << curr_sum << '\n';
                pos = min(pos, {curr_sum, j});
            }

            int p = pos.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;
    }



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

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 460 KB Output is correct
2 Correct 5 ms 556 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 4 ms 560 KB Output is correct
5 Correct 4 ms 432 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 564 KB Output is correct
9 Correct 3 ms 588 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 3 ms 432 KB Output is correct
14 Correct 3 ms 588 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 3 ms 560 KB Output is correct
17 Correct 3 ms 460 KB Output is correct
18 Correct 3 ms 536 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 3 ms 588 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 460 KB Output is correct
2 Correct 5 ms 556 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 4 ms 560 KB Output is correct
5 Correct 4 ms 432 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 564 KB Output is correct
9 Correct 3 ms 588 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 3 ms 432 KB Output is correct
14 Correct 3 ms 588 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 3 ms 560 KB Output is correct
17 Correct 3 ms 460 KB Output is correct
18 Correct 3 ms 536 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 3 ms 588 KB Output is correct
21 Incorrect 3 ms 588 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 11624 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1086 ms 40684 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 460 KB Output is correct
2 Correct 5 ms 556 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 4 ms 560 KB Output is correct
5 Correct 4 ms 432 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 564 KB Output is correct
9 Correct 3 ms 588 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 3 ms 432 KB Output is correct
14 Correct 3 ms 588 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 3 ms 560 KB Output is correct
17 Correct 3 ms 460 KB Output is correct
18 Correct 3 ms 536 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 3 ms 588 KB Output is correct
21 Execution timed out 1079 ms 11624 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1077 ms 10948 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 460 KB Output is correct
2 Correct 5 ms 556 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 4 ms 560 KB Output is correct
5 Correct 4 ms 432 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 564 KB Output is correct
9 Correct 3 ms 588 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 3 ms 432 KB Output is correct
14 Correct 3 ms 588 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 3 ms 560 KB Output is correct
17 Correct 3 ms 460 KB Output is correct
18 Correct 3 ms 536 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 3 ms 588 KB Output is correct
21 Incorrect 3 ms 588 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 460 KB Output is correct
2 Correct 5 ms 556 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 4 ms 560 KB Output is correct
5 Correct 4 ms 432 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 564 KB Output is correct
9 Correct 3 ms 588 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 3 ms 588 KB Output is correct
13 Correct 3 ms 432 KB Output is correct
14 Correct 3 ms 588 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 3 ms 560 KB Output is correct
17 Correct 3 ms 460 KB Output is correct
18 Correct 3 ms 536 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 3 ms 588 KB Output is correct
21 Incorrect 3 ms 588 KB Output isn't correct
22 Halted 0 ms 0 KB -