Submission #74082692

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long

const int N = 2e5 + 10, M = 2e6 + 10, mod = 998244353, INF = 0x3ffffffff, LOG = 23;
const long double PI = 3.141592653589793;

int n, m;
/*
int e[M], h[N], ne[M], idx;
inline void add(int u, int v){
    e[idx] = v, ne[idx] = h[u], h[u] = idx ++;
}
*/
int qpow(int x, int d){
    int res = 1;
    while(d){
        if(d & 1){
            res *= x;
        }
        x = (x * x) % mod;
        d >>= 1;
    }
    return res;
}

int __mod(int a){
    return ((a % mod) + mod) % mod;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    // memset(h, -1, sizeof h);
    cin >> n >> m;
    int q;
    cin >> q;
    int l = m, r = n;
    while(q --){
        int op;
        cin >> op;
        int rc;
        if(op == 1){
            cin >> rc;
            cout << rc * l << "\n";
            r -= rc;
        }else{
            cin >> rc;
            cout << rc * r << "\n";
            l -= rc;
        }
    }
    return 0;
}

Submission Info

Judge Result