Submission #797167

#	Time	Username	Problem	Language	Result	Execution time	Memory
797167		vjudge1	Food Court (JOI21_foodcourt)	C++17	0 / 100	4 ms	5460 KiB

foodcourt

#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 2010;
int n, m, q;

deque<pair<ll, ll>> g[N]; 



int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin >> n >> m >> q;
    if(n <= 2000 && q <= 2000) {
        for(int i = 0; i < q; i++) {
            int t;
            cin >> t;
            if(t == 1) {
                ll l, r, c, k;
                cin >> l >> r >> c >> k;
                for(int j = l; j <= r; j++) {
                    g[j].push_back({c, k});
                }
            }
            if(t == 2) {
                ll l, r, k;
                cin >> l >> r >> k;
                for(int j = l; j <= r; j++) {
                    while(!g[j].empty() && g[j].front().second <= k) {
                        k -= g[j].front().second;
                        g[j].pop_front();
                    }
                    if(!g[j].empty()) 
                        g[j][0].second -= k;
                }
            }
            if(t == 3) {
                ll a, b;
                cin >> a >> b;
                int ans = 0;
                // for(auto [c, k] : g[a]) {
                //     if(b > k) b -= k;
                //     else {ans = c; break;}
                // }
                if(g[a].size() >= b) ans = g[a][b - 1].first;
                cout << ans << '\n';    
                  
            }
        }
        return 0;
    }
}

Compilation message (stderr)

foodcourt.cpp: In function 'int main()':
foodcourt.cpp:48:32: warning: comparison of integer expressions of different signedness: 'std::deque<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   48 |                 if(g[a].size() >= b) ans = g[a][b - 1].first;
      |                    ~~~~~~~~~~~~^~~~

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