Submission

Status:

[PPPPPPPPPPPPPPP]

Subtask/Task Score:

{100/100}

Score: 100

User: Kitsunox

Problemset: fireball

Language: cpp

Time: 0.006 second

Submitted On: 2025-12-28 18:56:48

#include <bits/stdc++.h>
using namespace std;
int n,m,q,ci;
int mp[105][105];

int main(){
    cin >> n >> m >> q;
    for(int i = 1;i <= n;i++) for(int j = 1;j<=m;j++) {cin >> mp[i][j]; if(mp[i][j] == 1)ci++;}
    while(q--){
        int a,b;
        cin >> a >> b;
        queue<pair<int,int>> nmp;
        if(mp[a][b] == 1)nmp.push({a,b});
        while(!nmp.empty()){
            auto[n1,n2] = nmp.front();nmp.pop();
            if(mp[n1][n2] == 1){
                ci--;
                mp[n1][n2] = 0;
                nmp.push({n1+1,n2});
                nmp.push({n1-1,n2});
                nmp.push({n1,n2+1});
                nmp.push({n1,n2-1});
            } 
        }
        cout << ci << '\n';
    }
}