oj.uz

답안 #464434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
464434 2021-08-13T08:34:32 Z Sench2006 Awesome Arrowland Adventure (eJOI19_adventure) C++14
34 / 100
 1 ms 332 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

#define f first
#define s second
#define mpr make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

#define FOR(i, a, b) for(auto i = a; i < b; i++)
#define FORD(i, a, b) for(auto i = a - 1; i >= b; i--)
#define trav(x, v) for(auto x : v)

#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fileio freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);

// --------------- SOLUTION --------------- //

const int INF = 1e6;
int n, m;
char a[501][501];
int d[501][501];
set <pair<int, pair<int, int>>> s;

char dir[4] = {'W', 'S', 'E', 'N'};

bool valid(int x, int y) {
    return (x >= 0 && x < n && y >= 0 && y < m);
}

void solve() {
    cin >> n >> m;
    FOR(i, 0, n) {
        FOR(j, 0, m) {
            cin >> a[i][j];
        }
    }
    FOR(i, 0, n) {
        FOR(j, 0, m) {
            d[i][j] = INF; 
        }
    }
    d[0][0] = 0;
    s.insert({0, {0, 0}});
    while (!s.empty()) {
        auto it = s.begin();
        int dist = (*it).f;
        int x = (*it).s.f;
        int y = (*it).s.s;
        s.erase(it);
        if (a[x][y] == 'X') {
            continue;
        }
        FOR(i, 0, 3) {
            int cnt = 0;
            int xx = 0, yy = 0;
            if (a[x][y] == dir[i]) cnt = 0;
            else if (a[x][y] == dir[(i + 1) % 4]) cnt = 1;
            else if (a[x][y] == dir[(i + 2) % 4]) cnt = 2;
            else cnt = 3;
            switch (dir[i]) {
                case 'W': xx = 0, yy = -1; break;
                case 'S': xx = 1, yy = 0; break;
                case 'E': xx = 0, yy = 1; break;
                case 'N': xx = -1, yy = 0; break;
            }
            if (valid(x + xx, y + yy) && d[x + xx][y + yy] > dist + cnt) {
                s.erase({d[x + xx][y + yy], {x + xx, y + yy}});
                d[x + xx][y + yy] = dist + cnt;
                s.insert({d[x + xx][y + yy], {x + xx, y + yy}});
            }
        }
    }
    if(d[n - 1][m - 1] != INF)
        cout << d[n - 1][m - 1] << endl;
    else 
        cout << -1 << endl;
}

int main() {
    fastio;
    //fileio;
    int tests = 1;
    // cin >> tests;
    while (tests--) {
        solve();
    }

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 224 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Incorrect 0 ms 204 KB Output isn't correct
27 Halted 0 ms 0 KB -