oj.uz

Submission #482451

# Submission time Handle Problem Language Result Execution time Memory
482451 2021-10-24T15:19:09 Z jalsol Patkice (COCI20_patkice) C++17
50 / 50
 1 ms 332 KB 
#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
#define TASK "empty"
    if (fopen(TASK".inp", "r")) {
        (void)(!freopen(TASK".inp", "r", stdin));
        (void)(!freopen(TASK".out", "w", stdout)); }
    cout << setprecision(12) << fixed;
    return true;
}();

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// =============================================================================

constexpr int maxn = 100 + 5;

constexpr int dx[4] = { 0, -1, 1,  0 };
constexpr int dy[4] = { 1,  0, 0, -1 };
constexpr const char* dir = "ENSW";

int n, m;
char a[maxn][maxn];

bool inside(int x, int y) {
    return (1 <= x && x <= n) && (1 <= y && y <= m);
}

int Dfs(int x, int y) {
    if (!inside(x, y)) return inf;

    switch (a[x][y]) {
        case '^':
            return 1 + Dfs(x - 1, y);
        case 'v':
            return 1 + Dfs(x + 1, y);
        case '<':
            return 1 + Dfs(x, y - 1);
        case '>':
            return 1 + Dfs(x, y + 1);
        case 'x':
            return 1;
        default:
            return inf;
    }
}

signed main() {
    cin >> n >> m;

    int stx = -1, sty = 1;
    For (i, 1, n) {
        For (j, 1, m) {
            cin >> a[i][j];
            if (a[i][j] == 'o') {
                stx = i;
                sty = j;
            }
        }
    }

    int ans = inf;
    char d;

    Rep (i, 4) {
        int x = stx + dx[i];
        int y = sty + dy[i];

        if (chmin(ans, Dfs(x, y))) {
            d = dir[i];
        }
    }

    if (ans == inf) {
        cout << ":(\n";
    }
    else {
        cout << ":)\n" << d << '\n';
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 316 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 312 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 204 KB Output is correct