제출 #678893

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
678893		GordonRemzi007	Awesome Arrowland Adventure (eJOI19_adventure)	C++17	22 / 100	1 ms	336 KiB

adventure

#include <iostream>
#include <algorithm>
#include <map>
#include <vector>

using namespace std;

int trans(char ch) {
    switch(ch) {
        case 'N':
            return 0;
        case 'E':
            return 1;
        case 'S':
            return 2;
        case 'W':
            return 3;
        default:
            return -1;
    }
}
int dis(int from, int to) {
    if(from <= to) return to-from;
    else return 4-from+to;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m, res = 0;
    bool ok = true;
    cin >> n >> m;
    string temp;
    vector<vector<int>> map(n, vector<int>(m));
    for(int i = 0; i < n; i++) {
        cin >> temp;
        for(int j = 0; j < m; j++) {
            if(i == n-1 && j == m-1) continue;
            if(temp[j] == 'X') ok = false;
            map[i][j] = trans(temp[j]);
            res+=dis(map[i][j], 1);
        }
    }
    if(ok) cout << res << "\n";
    else cout << "-1\n";
}

• Subtask 1: 10 / 10
• Subtask 2: 12 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 16
• Subtask 5: 0 / 50