oj.uz

답안 #750212

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
750212 2023-05-29T07:54:10 Z emad234 Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 61 ms 6016 KB 
#include <bits/stdc++.h>
#define all(v) ((v).begin(),(v).end())
typedef long long ll;
using namespace std;
const ll mod = 1e9 + 7;
const ll mxN = 4e6 + 5;
int n,m;
struct node{
  int i,j,cost;
  char dir;
};
bool operator<(node a,node b){
  return a.cost < b.cost;
}
bool operator>(node a,node b){
  return a.cost > b.cost;
}
int dist[520][520];
int dp[520][520];
char a[520][520];
bool valid(int i,int j){
  return !(i < 0 || i >= n || j < 0 || j >= m);
}
node psh(node u,int x,int y,char dire){
  int val,val1;
  if(dire == 'N') val = 1;
  if(dire == 'E') val = 2;
  if(dire == 'S') val = 3;
  if(dire == 'W') val = 4;
  if(u.dir == 'N') val1 = 1;
  if(u.dir == 'E') val1 = 2;
  if(u.dir == 'S') val1 = 3;
  if(u.dir == 'W') val1 = 4;
  int sum = val - val1;
  if(sum < 0) sum += 4;
  if(!valid(u.i+ x,u.j + y)) return {-1,-1,-1,'Z'};
  if(dist[u.i + x][u.j + y] > u.cost + sum) {
    dist[u.i + x][u.j + y] = u.cost + sum;
    return{u.i + x,u.j + y,dist[u.i + x][u.j + y],a[u.i + x][u.j + y]};
  }
  return {-1,-1,-1,'Z'};
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);cout.tie(0);
  cin >>n>>m;
  for(int i= 0 ;i < n;i++){
    for(int j = 0;j < m;j++){
      cin >>a[i][j];
      dist[i][j] = INT_MAX;
    }
  }
  dist[0][0] = 0;
  priority_queue<node,vector<node>,greater<node>>q;
  q.push({0,0,0,a[0][0]});
  while(q.size()){
    node u = q.top();
    // cout<<u.i<<' '<<u.j<<' '<<u.cost<<' '<<u.dir<<'\n';
    q.pop();
    if(u.dir == 'X') continue;
    if(dist[u.i][u.j] < u.cost) continue;
    node v = psh(u,-1,0,'N');
    if(v.i != -1) q.push(v);
    v = psh(u,1,0,'S');
    if(v.i != -1) q.push(v);
    v = psh(u,0,1,'E');
    if(v.i != -1) q.push(v);
    v = psh(u,0,-1,'W');
    if(v.i != -1) q.push(v);
  }
  if(dist[n - 1][m - 1] == INT_MAX) dist[n - 1][m - 1] = -1;
  cout<<dist[n - 1][m - 1];

}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 3 ms 416 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 4 ms 596 KB Output is correct
38 Correct 1 ms 980 KB Output is correct
39 Correct 30 ms 1880 KB Output is correct
40 Correct 30 ms 1888 KB Output is correct
41 Correct 4 ms 1748 KB Output is correct
42 Correct 31 ms 1876 KB Output is correct
43 Correct 61 ms 6016 KB Output is correct
44 Correct 4 ms 1772 KB Output is correct