oj.uz

답안 #366392

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
366392 2021-02-14T06:30:41 Z ne4eHbKa Patkice (COCI20_patkice) C++17
50 / 50
 1 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;
#ifndef _LOCAL
//#pragma GCC optimize("O3,Ofast")
#else
#pragma GCC optimize("O0")
#endif
template<typename t> inline void umin(t &a, const t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, const t b) {a = max(a, b);}
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
ll time() {return chrono::system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
#define ft first
#define sd second
#define len(f) int((f).size())
#define bnd(f) (f).begin(), (f).end()
#define _ <<' '<<
const int inf = 1e9 + 5;
const ll inf64 = 4e18 + 5;
const int md = 998244353;
namespace MD {
    void add(int &a, const int b) {if((a += b) >= md) a -= md;}
    void sub(int &a, const int b) {if((a -= b) < 0) a += md;}
    int prod(const int a, const int b) {return ll(a) * b % md;}
};

int n, m;
const int N = 105;
int opt;
char ans;
string c[N];

int f(int x, int y, char d) {
    if(x < 0 || y < 0 || x >= n || y >= m)
        return opt + 1;
    if(d == '#') d = c[x][y];
    if(d == '.' || d == 'o') return opt + 1;
    if(d == 'v') return 1 + f(x + 1, y + 0, '#');
    if(d == '>') return 1 + f(x + 0, y + 1, '#');
    if(d == '^') return 1 + f(x - 1, y - 0, '#');
    if(d == '<') return 1 + f(x - 0, y - 1, '#');
    return 0;
}

void update(char c, int v) {
    if(v > opt || (v == opt && c >= ans)) return;
    opt = v;
    ans = c;
}

void solve() {
    cin >> n >> m;
    int sx, sy;
    for(int i = 0; i < n; ++i) {
        cin >> c[i];
        for(int j = 0; j < m; ++j)
            if(c[i][j] == 'o') sx = i, sy = j;
    }
    opt = n * m + 5;
    update('N', f(sx, sy, '^'));
    update('E', f(sx, sy, '>'));
    update('S', f(sx, sy, 'v'));
    update('W', f(sx, sy, '<'));
    if(opt >= n * m) {
        cout << ":(\n";
        return;
    }
    cout << ":)\n" << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifndef _LOCAL_
//    freopen("file.in", "r", stdin);
//    freopen("file.out", "w", stdout);
#else
    system("color a");
    freopen("in.txt", "r", stdin);
    int t; cin >> t;
    while(t--)
#endif
    solve();
}

Compilation message

patkice.cpp: In function 'void solve()':
patkice.cpp:65:11: warning: 'sy' may be used uninitialized in this function [-Wmaybe-uninitialized]
   65 |     update('W', f(sx, sy, '<'));
      |     ~~~~~~^~~~~~~~~~~~~~~~~~~~~
patkice.cpp:65:11: warning: 'sx' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 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 384 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 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 364 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 0 ms 364 KB Output is correct
20 Correct 0 ms 364 KB Output is correct