Submission #1369909
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(x,4) if(x!=p){
int d = 1;
while(1){
int nx = i+d*dx[x], ny = j+d*dy[x];
if(nx<0 || ny<0 || nx>=n || ny>=m) break;
if(vec[nx][ny]==s[k+1]){
int nxt = ((nx*m+ny)*4+x)*l+k+1;
gra[g].pb(mp(nxt,d));
}
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
Submission Time |
|
Task |
F - 僕は宇宙人 |
User |
tossy |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2277 Byte |
Status |
WA |
Exec Time |
224 ms |
Memory |
138108 KB |
Judge Result
Set Name |
All |
Score / Max Score |
0 / 100 |
Status |
|
Set Name |
Test Cases |
All |
case_000.txt, case_001.txt, case_002.txt, case_003.txt, case_004.txt, case_005.txt, case_006.txt, case_007.txt, case_008.txt, case_009.txt, case_010.txt, case_011.txt, case_012.txt, case_013.txt, case_014.txt, case_015.txt, case_016.txt, case_017.txt, case_018.txt, case_019.txt, case_020.txt, case_021.txt, case_022.txt, case_023.txt, case_024.txt, case_025.txt, case_026.txt, case_027.txt, case_028.txt, case_029.txt, case_030.txt, case_031.txt, case_032.txt, case_033.txt, case_034.txt, case_035.txt, case_036.txt, case_037.txt, case_038.txt, case_039.txt, case_040.txt, case_041.txt, case_042.txt, case_043.txt, case_044.txt, case_045.txt, case_046.txt, case_047.txt, case_048.txt, case_049.txt, case_050.txt, case_051.txt, case_052.txt, case_053.txt, case_054.txt |
Case Name |
Status |
Exec Time |
Memory |
case_000.txt |
AC |
1 ms |
256 KB |
case_001.txt |
AC |
1 ms |
256 KB |
case_002.txt |
WA |
1 ms |
256 KB |
case_003.txt |
AC |
1 ms |
256 KB |
case_004.txt |
AC |
1 ms |
256 KB |
case_005.txt |
AC |
1 ms |
256 KB |
case_006.txt |
AC |
2 ms |
384 KB |
case_007.txt |
AC |
1 ms |
256 KB |
case_008.txt |
AC |
1 ms |
256 KB |
case_009.txt |
AC |
1 ms |
640 KB |
case_010.txt |
AC |
1 ms |
512 KB |
case_011.txt |
AC |
1 ms |
384 KB |
case_012.txt |
AC |
1 ms |
256 KB |
case_013.txt |
AC |
224 ms |
138108 KB |
case_014.txt |
AC |
224 ms |
137344 KB |
case_015.txt |
WA |
86 ms |
62208 KB |
case_016.txt |
WA |
18 ms |
14464 KB |
case_017.txt |
WA |
31 ms |
24960 KB |
case_018.txt |
WA |
16 ms |
16512 KB |
case_019.txt |
WA |
61 ms |
49920 KB |
case_020.txt |
WA |
9 ms |
7552 KB |
case_021.txt |
WA |
6 ms |
4992 KB |
case_022.txt |
WA |
7 ms |
5760 KB |
case_023.txt |
WA |
14 ms |
13312 KB |
case_024.txt |
WA |
32 ms |
26240 KB |
case_025.txt |
WA |
2 ms |
640 KB |
case_026.txt |
WA |
8 ms |
6528 KB |
case_027.txt |
WA |
10 ms |
9984 KB |
case_028.txt |
WA |
8 ms |
9600 KB |
case_029.txt |
WA |
12 ms |
10624 KB |
case_030.txt |
WA |
65 ms |
43136 KB |
case_031.txt |
WA |
52 ms |
42112 KB |
case_032.txt |
WA |
18 ms |
16768 KB |
case_033.txt |
WA |
7 ms |
5888 KB |
case_034.txt |
WA |
4 ms |
3456 KB |
case_035.txt |
WA |
68 ms |
50048 KB |
case_036.txt |
WA |
3 ms |
2176 KB |
case_037.txt |
WA |
22 ms |
19584 KB |
case_038.txt |
WA |
8 ms |
7296 KB |
case_039.txt |
AC |
13 ms |
9216 KB |
case_040.txt |
WA |
127 ms |
86272 KB |
case_041.txt |
WA |
41 ms |
34816 KB |
case_042.txt |
AC |
2 ms |
1408 KB |
case_043.txt |
WA |
10 ms |
9984 KB |
case_044.txt |
AC |
1 ms |
384 KB |
case_045.txt |
WA |
4 ms |
2944 KB |
case_046.txt |
WA |
3 ms |
2432 KB |
case_047.txt |
WA |
81 ms |
62080 KB |
case_048.txt |
AC |
13 ms |
9856 KB |
case_049.txt |
AC |
2 ms |
1408 KB |
case_050.txt |
WA |
37 ms |
30976 KB |
case_051.txt |
WA |
9 ms |
9984 KB |
case_052.txt |
WA |
51 ms |
38912 KB |
case_053.txt |
WA |
12 ms |
13184 KB |
case_054.txt |
WA |
4 ms |
3328 KB |