제출 #927501

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
927501		Muhammad_Aneeq	Nautilus (BOI19_nautilus)	C++17	66 / 100	1084 ms	174568 KiB

nautilus

/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <vector>
using namespace std;
int r,c,m;
int const R=500+10;
int const M=5000+10;
vector<vector<char>>a(R,vector<char>(R));
string s;
int z=0;
vector<vector<vector<bool>>>vis(R,vector<vector<bool>>(R,vector<bool>(M)));
void dfs(int i,int j,int ind)
{
  if (i<0||i>=r||j<0||j>=c||a[i][j]=='#')
    return;
  if (vis[i][j][ind])
    return;
  vis[i][j][ind]=1;
  if (ind==m)
  {
    z++;
    return;
  }
  if (s[ind]=='?')
  {
    dfs(i+1,j,ind+1);
    dfs(i,j+1,ind+1);
    dfs(i-1,j,ind+1);
    dfs(i,j-1,ind+1);
  }
  if (s[ind]=='N')
    dfs(i-1,j,ind+1);
  if (s[ind]=='S')
    dfs(i+1,j,ind+1);
  if (s[ind]=='E')
    dfs(i,j+1,ind+1);
  if (s[ind]=='W')
    dfs(i,j-1,ind+1);
}
inline void solve()
{
  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++)
      dfs(i,j,0);
  cout<<z<<endl;
}
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}

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