Submission #1369929

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__",", __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 1120000000

int main(){
  int n,m,l; string s;
  cin>>n>>m>>l>>s;
  vector<string> vec(n);
  rep(i,n) cin>>vec[i];

  vector<vector<pair<int,int>>> gra(n*m*l*4+2);
  // [i][j]マスの[k]文字目,直前の方向がp: ((i*m+j)*4+p)+k
  int f = n*m*l*4;
  int t = n*m*l*4+1;

  rep(i,n) rep(j,m) rep(k,l) if(vec[i][j] == s[k]){
    rep(p,4){
      int g = ((i*m+j)*4+p)*l+k;
      if(k==0) gra[f].pb(mp(g,1));
      if(k==l-1){
        gra[g].pb(mp(t,0));
        continue;
      }
      const int dx[]={1,-1,0,0}, dy[]={0,0,1,-1};
      rep(q,4) if(q!=p){
        int d = 1;
        while(1){
          int nx = i+d*dx[q], ny = j+d*dy[q];
          if(nx<0 || ny<0 || nx>=n || ny>=m) break;
          if(vec[nx][ny]==s[k+1]){
            int nxt = ((nx*m+ny)*4+q)*l+k+1;
            gra[g].pb(mp(nxt,d));
            break;
          }
          d++;
        }
      }
    }
  }

  priority_queue<pair<long, int>, vector<pair<long, int> >, greater<pair<long, int> > > q; //pair<dist, idx>
  vector<long> d(n*m*l*4+2, INF);
  d[f] = 0;
  q.push(mp(0,f));
  while(!q.empty()){
    auto p = q.top(); q.pop();
    int v = p.second;
    long dis = p.first;
    if(d[v] < dis) continue;
    for(auto &e : gra[v]){
      long nd = dis + e.second;
      if(d[e.fi] > nd){
        d[e.fi] = nd;
        q.push(mp(d[e.fi], e.fi));
      }
    }
  }

  if(d[t]==INF) cout << -1 << endl;
  else cout << d[t] << endl;

  return 0;
}

Submission Info

Judge Result