제출 #493371

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
493371		blue	푸드 코트 (JOI21_foodcourt)	C++17	2 / 100	1086 ms	40684 KiB

foodcourt

#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 / 2
• Subtask 2: 0 / 5
• Subtask 3: 0 / 7
• Subtask 4: 0 / 21
• Subtask 5: 0 / 15
• Subtask 6: 0 / 13
• Subtask 7: 0 / 26
• Subtask 8: 0 / 11