Submission
Status:
PPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: 9drxwz
Problemset: หุ่นพัง
Language: cpp
Time: 0.002 second
Submitted On: 2026-03-05 11:08:47
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<vector<char>> mp(n,vector<char>(n));
for(int i=0;i<n;i++){
string x;
cin>>x;
for(int k=0;k<n;k++){
mp[i][k]=x[k];
}
}
stack<pair<int,int>> dfs;
dfs.push({n-1,n-1});
int sum=0;
sum++;
mp[n-1][n-1]='X';
while(!dfs.empty()){
int x = dfs.top().first;
int y = dfs.top().second;
dfs.pop();
if(x-1>=0 && mp[x-1][y]=='.'){
dfs.push({x-1,y});
mp[x-1][y]='X';
sum++;
}
if(y-1>=0 && mp[x][y-1]=='.'){
dfs.push({x,y-1});
mp[x][y-1]='X';
sum++;
}
}
cout<<sum;
}