oj.uz

Submission #333872

# Submission time Handle Problem Language Result Execution time Memory
333872 2020-12-08T01:19:20 Z wiwiho Patkice (COCI20_patkice) C++14
50 / 50
 1 ms 492 KB 
#include <bits/stdc++.h>

#define pii pair<int, int>
#define mp make_pair
#define F first
#define S second

using namespace std;

typedef long long ll;

vector<string> a;

const ll MAX = 2147483647;

int calc(int x, int y){
    int ans = 0;
    while(true){
        if(a[x][y] == '<') y--;
        else if(a[x][y] == '>') y++;
        else if(a[x][y] == '^') x--;
        else if(a[x][y] == 'v') x++;
        else break;
        ans++;
    }
    if(a[x][y] == 'x') return ans + 1;
    else return MAX;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, m;
    cin >> n >> m;

    a.resize(n);
    pii o;
    for(int i = 0; i < n; i++){
        cin >> a[i];
        for(int j = 0; j < m; j++){
            if(a[i][j] == 'o') o = mp(i, j);
        }
    }

    vector<pii> dir = {mp(0, 1), mp(-1, 0), mp(1, 0), mp(0, -1)};
    vector<char> c = {'E', 'N', 'S', 'W'};
    int ans = MAX;
    char ansp = '.';
    for(int i = 0; i < 4; i++){
        int tmp = calc(o.F + dir[i].F, o.S + dir[i].S);
        if(tmp < ans){
            ans = tmp;
            ansp = c[i];
        }
    }
    if(ans == MAX){
        cout << ":(\n";
        return 0;
    }
    cout << ":)\n";
    cout << ansp << "\n";

    return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
20.0 / 20.0

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