提出 #43142095

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define loop(i,l,n) for(int i=l;i<n;i++)
long long int dp[501][501];
bool ans(int i,int j,int n,int m,string arr[],vector<vector<bool>>&visited,map<char,char>&hash,char back){
  
   // cout<<"hello "<<i<<" "<<j<<"\n";
  if((i>n) || (i>m) || (i<0) || (j<0))return false;
  if(visited[i][j])return false;
 
  if((arr[i][j])!=hash[back])return false;
  visited[i][j]=true;
  
  if((i==n) &&(j==m))return true;
 if(dp[i][j]!=-1)return dp[i][j];
  bool ans1=ans(i+1,j,n,m,arr,visited,hash,arr[i][j]);
  bool ans2=ans(i-1,j,n,m,arr,visited,hash,arr[i][j]);
  bool ans3=ans(i,j+1,n,m,arr,visited,hash,arr[i][j]);
  bool ans4=ans(i,j-1,n,m,arr,visited,hash,arr[i][j]);
  return dp[i][j]=(ans1||ans2||ans3||ans4);
}
void solve_tc(){
 ll n,m;
 for(int i=0;i<501;i++){
  for(int j=0;j<501;j++)dp[i][j]=-1;
 }
 cin>>n>>m;
 string arr[n];
 loop(i,0,n)cin>>arr[i];
 map<char,char>hash;
 hash['s']='n';
 hash['n']='u';
 hash['u']='k';
 hash['k']='e';
 hash['e']='s';
 // int m=arr[0].length();
 vector<vector<bool>>visited(n,vector<bool>(m,false));
 bool anss=ans(0,0,n-1,m-1,arr,visited,hash,'e');
 if(anss)cout<<"Yes\n";
 else cout<<"No\n";
 
}

int main() {
ios_base::sync_with_stdio(false);
      cin.tie(NULL);
 #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
 freopen("outpu.txt", "w", stdout);
  #endif
ll test_case=1;
// cin>>test_case;

for(int i=1;i<=test_case;i++){
 
  // cout<<"Case #"<<i<<": ";
  solve_tc();
}
 


  return 0; 

}
  

 
  

 


 
  

提出情報

コンパイルエラー

./Main.cpp: In function ‘bool ans(int, int, int, int, std::string*, std::vector<std::vector<bool> >&, std::map<char, char>&, char)’:
./Main.cpp:22:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   22 |   return dp[i][j]=(ans1||ans2||ans3||ans4);
      |          ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

ジャッジ結果