This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<vector<char>> grid(4004,vector<char>(4004));
vector<vector<bool>> vis(4004,vector<bool>(4004,0));
vector<int> dx = {1,0,-1,0};
vector<int> dy = {0,1,0,-1};
int n,m;
int cnt=0;
void dfs(int i,int j,char c){
vis[i][j] = 1;
for(int ind =0;ind < 4;++ind){
int x = i + dx[ind];
int y = j + dy[ind];
if(x > n || x == 0 || y > m || y == 0)continue;
if(vis[x][y])continue;
}
}
signed main(){
int n,m;
cin >> n >> m;
bool f=0,r=0;
for(int i=1;i<=n;++i){
for(int j=1;j<=m;++j){
cin >> grid[i][j];
if(grid[i][j] == 'F')f = 1;
else if(grid[i][j] == 'R')r = 1;
}
}
cout << f + r;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |