Submission
Status:
PPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: dddrrrr
Problemset: หุ่นพัง
Language: cpp
Time: 0.002 second
Submitted On: 2025-10-17 10:42:47
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int dfs(int i ,int j ,vector <vector <char>>& vec){
int n = vec.size();
if(i==n || j==n || i<0 || j<0)return 0;
if(vec[i][j] == 'X')return 0;
vec[i][j] = 'X';
return 1 + dfs(i ,j-1 ,vec) + dfs(i-1 ,j ,vec);
}
int main(){
cin.tie(0)->sync_with_stdio(0);
cout.tie(0)->sync_with_stdio(0);
int n;cin >> n;
vector <vector <char>> vec(n ,vector <char>(n));
for(auto &row : vec){
for(auto &col : row){
cin >> col;
}
}
cout << dfs(n-1 ,n-1 ,vec);
return 0;
}