oj.uz

Submission #931110

# Submission time Handle Problem Language Result Execution time Memory
931110 2024-02-21T09:03:30 Z Whisper Patkice (COCI20_patkice) C++17
50 / 50
 1 ms 468 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e2 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nRow, nCol;
char a[MAX][MAX];
int stA, stB;

int dfs(int x, int y){
    if (x > nRow || y > nCol || x < 1 || y < 1) return 1e9;
    if (a[x][y] == 'x') return 0;
    if (a[x][y] == '>') return 1 + dfs(x, y + 1);
    if (a[x][y] == '<') return 1 + dfs(x, y - 1);
    if (a[x][y] == '^') return 1 + dfs(x - 1, y);
    if (a[x][y] == 'v') return 1 + dfs(x + 1, y);
    return 1e9;
}
void Whisper(){
    cin >> nRow >> nCol;
    FOR(i, 1, nRow) FOR(j, 1, nCol){
        cin >> a[i][j];
        if (a[i][j] == 'o'){
            stA = i;
            stB = j;
        }
    }
    int ans = INF;
    char dir = '.';
    int East = dfs(stA, stB + 1);
    if (ans > East){
        ans = East; dir = 'E';
    }
    int North = dfs(stA - 1, stB);
    if (ans > North){
        ans = North; dir = 'N';
    }
    int South = dfs(stA + 1, stB);
    if (ans > South){
        ans = South; dir = 'S';
    }
    int West = dfs(stA, stB - 1);
    if (ans > West){
        ans = West; dir = 'W';
    }
    if (ans < 1e9){
        cout << ":)" << '\n' << dir;
    }
    else cout << ":(";
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
30.0 / 30.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 460 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct