oj.uz

답안 #735115

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
735115 2023-05-03T14:59:48 Z Farhan_HY Patkice (COCI20_patkice) C++14
30 / 50
 18 ms 31700 KB 
#include <bits/stdc++.h>
#define int long long
#define F first 
#define S second 
#define T int tc; cin >> tc; while(tc--) 
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
using namespace std;
const int inf = 1e18;
const int N = 1e6 + 5;
const int M = 505; 
const int LOG = 32;
const int CHAR = 26;
const int mod = 1e9 + 7;
const int mod2 = 998244353;
const float pi = atan(1) * 4;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, 1, -1};
const char d[] = {'W', 'E', 'S', 'N'};
int n, m;
string s[N];
bool vis[M][M];
bool inside(int x, int y) {
    return x >= 1 && y >= 1 && x <= m && y <= n;
}

bool ok(int j, int i) {
    if (vis[i][j]) return 0;
    vis[i][j] = 1;
    if (!inside(j, i)) return 0;
    if (s[i][j] == '.') return 0;
    if (s[i][j] == 'x') return 1;
    if (s[i][j] == '>') return ok(j + 1, i);
    if (s[i][j] == '<') return ok(j - 1, i);
    if (s[i][j] == 'v') return ok(j, i + 1);
    return ok(j, i - 1);
}

main() {
    IOS
    cin >> n >> m;
    for(int i = 1; i <= n; i++) cin >> s[i], s[i] = '.' + s[i];
    string ans;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            if (s[i][j] == 'o') {
                for(int k = 0; k < 4; k++) {
                    for(int ii = 0; ii <= n + 1; ii++) for(int jj = 0; jj <= m + 1; jj++) vis[ii][jj] = 0;
                    if (inside(dx[k] + j, dy[k] + i)) {
                        if (ok(dx[k] + j, dy[k] + i)) ans = d[k];
                    }
                }
            }
        }
    }
    if (ans.size() == 0) cout << ":(";
    else cout << ":)\n";
    cout << ans;
}

Compilation message

patkice.cpp:38:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   38 | main() {
      | ^~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 31604 KB Output is correct
2 Correct 15 ms 31612 KB Output is correct
3 Correct 15 ms 31672 KB Output is correct
4 Correct 16 ms 31700 KB Output is correct
5 Correct 15 ms 31664 KB Output is correct
6 Correct 18 ms 31636 KB Output is correct
7 Correct 18 ms 31572 KB Output is correct
8 Correct 17 ms 31632 KB Output is correct
9 Correct 17 ms 31564 KB Output is correct
10 Correct 16 ms 31592 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 31600 KB Output isn't correct
2 Halted 0 ms 0 KB -