oj.uz

답안 #404609

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
404609 2021-05-14T17:54:18 Z cadmiumsky Awesome Arrowland Adventure (eJOI19_adventure) C++14
100 / 100
 41 ms 8528 KB 
#include <iostream>

using namespace std;

char dir[505][505][4];
char orig[505][505];
int arriv[505][505][4];
int n,m;
int dirx[4]={-1,0,1,0};
int diry[4]={0,1,0,-1};

class QUEUE {
  int qx[262144];
  int qy[262144];
  int qp[262144];
  int l,r;
  public:
    void reset() {
      l=0;
      r=0;
    }
    void pushb(int x,int y,int p) {
      qx[r]=x;
      qy[r]=y;
      qp[r++]=p;
      r&=262143;
    }
    void pushf(int x,int y, int p) {
      l=(l-1)&262143;
      qx[l]=x;
      qy[l]=y;
      qp[l]=p;
    }
    void pop() {
      l=(l+1)&262143;
    }
    int topx() {
      return qx[l];
    }
    int topy() {
      return qy[l];
    }
    int topp() {
      return qp[l];
    }
    bool empty() {
      return l==r;
    }
}que;

static int dbfs() {
  if(que.empty())
    return -1;
  int x=que.topx(),y=que.topy(),p=que.topp();
  que.pop();
  if(x==n && y==m)
    return arriv[x][y][p];
  if(p==4)
    return dbfs();
  int c=dir[x][y][p];
  //cout << x <<' '<< y <<' '<< p << '\n';
  //cout << dirx[c] <<' '<< diry[c] << ' '<< c << "\n\n";
  if(c==-1)
    return dbfs();
  dir[x][y][p]=-1;
  que.pushf(x+dirx[c],y+diry[c],0);
  arriv[x+dirx[c]][y+diry[c]][0]=arriv[x][y][p];
  if(p!=3) {
    que.pushb(x,y,p+1);
    arriv[x][y][p+1]=arriv[x][y][p]+1;
  }
  return dbfs();
}

int main() {
  cin >> n >> m;
  for(int i=1; i<=n; i++) {
    for(int j=1; j<=m; j++) {
      cin >> dir[i][j][0];
      if(dir[i][j][0]=='N') 
        dir[i][j][0]=0;
      else if(dir[i][j][0]=='E')
        dir[i][j][0]=1;
      else if(dir[i][j][0]=='S')
        dir[i][j][0]=2;
      else if(dir[i][j][0]=='W')
        dir[i][j][0]=3;
      else
        dir[i][j][0]=-1;
      if(dir[i][j][0]!=-1) {
        for(int h=1; h<4; h++)
          dir[i][j][h]=((dir[i][j][h-1]+1)&3);
      }
    }
  }
  for(int i=0; i<=n+1; i++) {
    for(int j=0; j<4; j++)
      dir[i][0][j]=dir[i][m+1][j]=-1;
  }
  for(int i=0; i<=m+1; i++) {
    for(int j=0; j<4; j++)
      dir[n+1][i][j]=dir[0][i][j]=-1;
  }
  if(dir[1][1][0]==-1) {
    cout << -1 <<'\n';
    return 0;
  }
  que.reset();
  que.pushb(1,1,0);
  cout << dbfs() <<'\n';
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 440 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 440 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 440 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 304 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 308 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 304 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 1 ms 304 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 5 ms 1468 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 5 ms 2144 KB Output is correct
38 Correct 4 ms 844 KB Output is correct
39 Correct 39 ms 8528 KB Output is correct
40 Correct 39 ms 8496 KB Output is correct
41 Correct 21 ms 1468 KB Output is correct
42 Correct 41 ms 8476 KB Output is correct
43 Correct 27 ms 8396 KB Output is correct
44 Correct 20 ms 1548 KB Output is correct