# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
851381 | 2023-09-19T17:16:50 Z | vjudge1 | Patkice (COCI20_patkice) | C++17 | 1 ms | 1368 KB |
//author: #include <bits/stdc++.h> using namespace std; using i64 = long long; #define ONLINE_JUDGE const int MAXN = 1000 + 5; char matrix[MAXN][MAXN]; map <char, int> mp; map <int, set <char>> ans; char get() { char ch; cin >> ch; return ch; } void solve() { memset(matrix, '.', sizeof (matrix)); int n, m; cin >> n >> m; int stx, sty, finx, finy; for(int i = 1; i <= n; i++) { for(int j = 1; j <= m; j++) { matrix[i][j] = get(); if(matrix[i][j] == 'o') { stx = i; sty = j; } } } int cnt = 0; function <int(int, int)> dfs = [&](int x, int y) -> int { if(matrix[x][y] == '.' || matrix[x][y] == 'o') return 1e9 + 7; //cerr << x << " " << y << "\n"; if(matrix[x][y] == '>') { return dfs(x, y +1) +1; } else if(matrix[x][y] == 'v') { return dfs(x +1, y) +1; } else if(matrix[x][y] == '<') { return dfs(x, y -1) +1; } else if(matrix[x][y] == '^') { return dfs(x -1, y) +1; } return 0; }; auto check = [&](int yon) -> int { int x; if(yon == 0) { x = dfs(stx -1, sty) +1; } else if(yon == 1) { x = dfs(stx, sty -1) +1; } else if(yon == 2) { x = dfs(stx, sty +1) +1; } else { x = dfs(stx +1, sty) +1; } cerr << "\n"; return min(int(1e9) + 7, x); }; mp['E'] = 2; mp['N'] = 1; mp['S'] = 3; mp['W'] = 0; for(auto &[ch, a] : mp) { int gel = check(a); if(gel != 1e9 + 7) { cerr << gel << " " << ch << "\n"; ans[gel].emplace(ch); } } if(ans.empty()) { cout << ":("; } else { cout << ":)\n"; cout << char(*(ans.begin()->second.begin())); } return; } signed main() { #ifndef ONLINE_JUDGE freopen(".in", "r", stdin); freopen(".out", "w", stdout); #endif ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int t = 1; //cin >> t; while(t--) solve(); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 1368 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1368 KB | Output is correct |
2 | Incorrect | 1 ms | 1368 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |