Submission #1266441

#TimeUsernameProblemLanguageResultExecution timeMemory
1266441canhnam357Patkice (COCI20_patkice)C++20
50 / 50
0 ms328 KiB
#include <bits/stdc++.h>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m, sx, sy;
    cin >> n >> m;
    vector<string> a(n);
    for (string &s : a) cin >> s;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (a[i][j] == 'o') {
                sx = i;
                sy = j;
            }
        }
    }
    string dir = "ENSW";
    string sign = ">^v<";
    int dx[4] = {0, -1, 1, 0};
    int dy[4] = {1, 0, 0, -1};
    const int inf = 1e9;
    vector<int> dis(4, inf);
    for (int _ = 0; _ < 4; _++) {
        int x = sx, y = sy;
        vector<vector<int>> d(n, vector<int>(m, -1));
        d[x][y] = 0;
        x += dx[_], y += dy[_];
        if (min({x, y, n - x - 1, m - y - 1}) < 0) continue;
        d[x][y] = 1;
        while (true) {
            if (a[x][y] == 'x') {
                dis[_] = d[x][y];
                break;
            }
            if (a[x][y] == '.') {
                break;
            }
            int p = sign.find(a[x][y]);
            x += dx[p], y += dy[p];
            if (min({x, y, n - x - 1, m - y - 1}) < 0 || d[x][y] >= 0) break;
            d[x][y] = d[x - dx[p]][y - dy[p]] + 1;
        }
    }
    int k = *min_element(dis.begin(), dis.end());
    for (int i = 0; i < 4; i++) {
        if (dis[i] == k && dis[i] != inf) {
            cout << ":)\n" << dir[i] << '\n';
            return 0;
        }
    }   
    cout << ":(";
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...