题解 | 小红炸砖块

#include <iostream>
#include <bitset>
using namespace std;
const int N = 1000 +10;

int n, m, k, x, y;
bitset<N> bitarr[N];

int main() {
    for (auto& ba : bitarr) ba.set(); 
    cin >> n >> m >> k;

    while (k --) {
        cin >> x >> y;
        if (bitarr[x - 1][y - 1] != 0) { 
            for (int i = x - 1; i >= 1; i-- ) {
                bitarr[i][y - 1] = bitarr[i - 1][y - 1];
            }
            bitarr[0][y - 1] = 0; 
        }
    }
    for (int i = 0; i < n; i++ ) {
        for (int j = 0; j < m; j++ ) {
            if (bitarr[i][j] == 1) cout << "*";
            else cout << ".";
        }
        cout << endl;
    }
}