Submission
Status:
PPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: Shirolnwza
Problemset: หุ่นพัง
Language: cpp
Time: 0.002 second
Submitted On: 2026-03-19 14:01:19
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
vector<string> grid(n);
for(int i=0;i<n;i++){
cin>>grid[i];
}
int dr[2]={0,-1};
int dc[2]={-1,0};
int cnt=1;
queue<pair<int,int>> q;
q.push({n-1,n-1});
while (!q.empty())
{
auto [r,c]=q.front();
q.pop();
for(int i=0;i<2;i++){
int rr=r+dr[i];
int cc=c+dc[i];
if(rr<0||rr>=n||cc<0||cc>=n||grid[rr][cc]=='X'){continue;}
grid[rr][cc]='X';
cnt++;
q.push({rr,cc});
}
}
cout<<cnt;
return 0;
}