#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
#define lastbit(i) __builtin_ctz(i)
char a[509][509];
int change[5][2];
int dis[9][509][509];
int dp[9][9][509][509];
int note[509][509];
vector<pii>b[509][509];
pii next[509][509][4];
pii pos[9];
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen(".INP","r",stdin);
//freopen(".OUT","w",stdout);
int n,row,col;
cin>>n>>col>>row;
for1(i,1,row){
for1(j,1,col){
cin>>a[i][j];
if (a[i][j]=='.'){
}
else if (a[i][j]=='x'){
note[i][j]=1;
}
else if (a[i][j]=='A'){
note[i][j]=2;
}
else if (a[i][j]=='C'){
note[i][j]=3;
}
else {
pos[(int)a[i][j]-'1']={i,j};
}
}
}
for1(j,0,4){
int nxt=(j+1)%4;
change[j][0]=nxt;
change[nxt][1]=j;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
4 ms |
6356 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
4 ms |
6356 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
4 ms |
6356 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
4 ms |
6356 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |