제출 #991809

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
991809		n3rm1n	푸드 코트 (JOI21_foodcourt)	C++17	7 / 100	1050 ms	524288 KiB

foodcourt

#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
using namespace std;
const long long MAXN = 7e4+10;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}
long long n, m, q;
long long t[MAXN * 4];

vector < pair < long long/**number*/, long long/**colour*/> > g[MAXN];
vector < long long > pref[MAXN];
long long cutted[MAXN];

void solve()
{
    cin >> n >> m >> q;
    long long type, l, r, k, c;
    for (long long i = 1; i <= n; ++ i)
    {
        pref[i].push_back(0);
        g[i].push_back({0, 0});
    }
    long long aa, bb;
    for (long long i = 1; i <= q; ++ i)
    {
        cin >> type;
        if(type == 1)
        {
            cin >> l >> r >> c >> k;
            for (long long j = l; j <= r; ++ j)
            {
                g[j].push_back(make_pair(k, c));
                pref[j].push_back(pref[j].back()+k);
            }
        }
        else if(type == 2)
        {
            cin >> l >> r >> k;
            for (long long j = l; j <= r; ++ j)
                cutted[j] += min(pref[j].back() - cutted[j], k);
        }
        else
        {

            cin >> aa >> bb;
           /// cout << "* " << cutted[aa] << " " << endl;
            long long l = 0, r = pref[aa].size()-1, mid, ans = 0;
            while(l <= r)
            {
                mid = (l + r)/2;
                if(pref[aa][mid] < bb + cutted[aa])
                {
                    l = mid + 1;
                }
                else
                {
                    ans = mid;
                    r = mid - 1;
                }
            }

            cout << g[aa][ans].second << endl;
        }
    }
}
int main()
{
    speed();


    solve();
    return 0;
}

• Subtask 1: 2 / 2
• Subtask 2: 5 / 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