oj.uz

Submission #1090461

# Submission time Handle Problem Language Result Execution time Memory
1090461 2024-09-18T11:54:24 Z KasymK Awesome Arrowland Adventure (eJOI19_adventure) C++17
0 / 100
 1 ms 508 KB 
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 5e3+5;
const int INF = 1e9;
char c[N][N];
int dis[N][N];

int main(){
    int n, m;
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j)
            scanf(" %c", &c[i][j]), dis[i][j] = INF;
    auto check = [&](int x, int y){
        return (x >= 1 and x <= n and y >= 1 and y <= m);
    };
    using node = tuple<int, int, int>;
    priority_queue<node, vector<node>, greater<node>> q;
    q.push({0, 1, 1});
    dis[1][1] = 0;
    while(!q.empty()){
        int x, y, step;
        tie(step, x, y) = q.top();
        q.pop();
        if(c[x][y] == 'X'){
            dis[x][y] = INF;
            continue;
        }
        if(check(x, y+1)){
            int add = 0;
            if(c[x][y] == 'N')
                add++;
            else if(c[x][y] == 'W')
                add += 2;
            else if(c[x][y] == 'S')
                add += 3;
            if(umin(dis[x][1+y], dis[x][y]+add))
                q.push({dis[x][1+y], x, 1+y});
        }
        if(check(x, y-1)){
            int add = 0;
            if(c[x][y] == 'S')
                add++;
            else if(c[x][y] == 'E')
                add += 2;
            else if(c[x][y] == 'N')
                add += 3;
            if(umin(dis[x][y-1], dis[x][y]+add))
                q.push({dis[x][y-1], x, y-1});
        }
        if(check(x-1, y)){
            int add = 0;
            if(c[x][y] == 'W')
                add++;
            else if(c[x][y] == 'S')
                add += 2;
            else if(c[x][y] == 'E')
                add += 3;
            if(umin(dis[x-1][y], dis[x][y]+add))
                q.push({dis[x-1][y], x-1, y});
        }
        if(check(x+1, y)){
            int add = 0;
            if(c[x][y] == 'E')
                add++;
            else if(c[x][y] == 'N')
                add += 2;
            else if(c[x][y] == 'W')
                add += 3;
            if(umin(dis[x+1][y], dis[x][y]+add))
                q.push({dis[x+1][y], x+1, y});
        }
    }
    int answer = dis[n][m];
    if(answer == INF)
        answer = -1;
    printf("%d\n", answer);
    return 0;
}

Compilation message

adventure.cpp: In function 'int main()':
adventure.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
adventure.cpp:25:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |             scanf(" %c", &c[i][j]), dis[i][j] = INF;
      |             ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 360 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Incorrect 0 ms 360 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 360 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Incorrect 0 ms 360 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 508 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 360 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Incorrect 0 ms 360 KB Output isn't correct
4 Halted 0 ms 0 KB -