Submission #851363

#TimeUsernameProblemLanguageResultExecution timeMemory
851363MisterReaperPatkice (COCI20_patkice)C++17
0 / 50
1 ms1368 KiB
//author: #include <bits/stdc++.h> using namespace std; using i64 = long long; #define ONLINE_JUDGE const int MAXN = 1000 + 5; char matrix[MAXN][MAXN]; bool vis[MAXN][MAXN]; map <char, int> mp; map <int, set <char>> ans; char get() { char ch; cin >> ch; return ch; } void solve() { int n, m; cin >> n >> m; int stx, sty, finx, finy; stx = sty = finx = finy = 0; 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; } else if(matrix[i][j] == 'x') { finx = i; finy = j; } } } int cnt = 0; function <void(int, int)> dfs = [&](int x, int y) -> void { if(vis[x][y]) return; vis[x][y] = true; if(matrix[x][y] == '.') return; //cerr << x << " " << y << "\n"; cnt++; if(matrix[x][y] == '>') { dfs(x, y +1); } else if(matrix[x][y] == 'v') { dfs(x +1, y); } else if(matrix[x][y] == '<') { dfs(x, y -1); } else if(matrix[x][y] == '^') { dfs(x -1, y); } }; auto check = [&](int yon) -> bool { memset(vis, false, sizeof(vis)); cnt = 0; if(yon == 0) { dfs(stx -1, sty); } else if(yon == 1) { dfs(stx, sty -1); } else if(yon == 2) { dfs(stx, sty +1); } else { dfs(stx +1, sty); } cerr << "\n"; return vis[finx][finy]; }; mp['E'] = 2; mp['N'] = 1; mp['S'] = 3; mp['W'] = 0; for(auto &[ch, a] : mp) { if(check(a)) { cerr << cnt << " " << ch << "\n"; ans[cnt].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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...