Submission #857146

#	Time	Username	Problem	Language	Result	Execution time	Memory
857146		Trisanu_Das	Nautilus (BOI19_nautilus)	C++17	29 / 100	7 ms	604 KiB

nautilus

#include <bits/stdc++.h>
using namespace std;
 
int r, c, m, ans;
char a[500][500];
string s;
 
void paths(int x, int y, int far){
  if(x < 0 || x >= r || y < 0 || y >= c || a[x][y] == '#') return;
  if(far == m){
    ans++; return;
  }
  if(s[far] == 'N') paths(x - 1, y, far + 1);
  if(s[far] == 'S') paths(x + 1, y, far + 1);
  if(s[far] == 'W') paths(x, y - 1, far + 1);
  if(s[far] == 'E') paths(x, y + 1, far + 1);
}
 
int main(){
  cin >> r >> c >> m;
  for(int i = 0; i < r; i++) for(int j = 0; j < c; j++) cin >> a[i][j];
  cin >> s;
  for(int i = 0; i < r; i++) for(int j = 0; j < c; j++) if(a[i][j] != '#') paths(i, j, 0);
  cout << ans << '\n';
}

• Subtask 1: 29 / 29
• Subtask 2: 0 / 37
• Subtask 3: 0 / 34