Submission #74107192

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(13); } }init;
using ll = long long;
using pll = pair<ll, ll>;
const int inf = 1073741823;
const long long INF = 1LL << 60;
#define el '\n'
#define spa " "
#define pb emplace_back
#define rep(i, s, n) for(int i = (s); i < (int)(n); i++)
#define rrep(i, s, n) for(int i = (int)(n) - 1; i >= (s); i--)
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define unless(c) if(!(c))
#define until(c) while(!(c))

int sub(){
    return 0;
}

int solve() {
    int h, w, q;
    cin >> h >> w >> q;
    vector<vector<bool>> c(h,vector<bool>(w, true));

    while(q--){
        int que;
        cin >> que;
        int cnt = 0;
        if(que == 1){
            int n;
            cin >> n;
            rep(i, h-n, h){
                rep(j, 0, w){
                    if(c[i][j]){
                        cnt++;
                    }
                    c[i][j] = false;
                }
            }
            h -= n;
            cout << cnt << el;
        }
        if(que == 2){
            int n;
            cin >> n;
            rep(i, w-n, w){
                rep(j, 0, h){
                    if(c[j][i])cnt++;
                    c[j][i] = false;
                }
            }
            w -= n;
            cout << cnt << el;
        }
    }
    return 0;
}

int main() {
    int t = 1;
    // cin >> t;
    rep(i, 0, t) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result