#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,O3,unroll-loops")
#define int long long
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vpi vector<pii>
#define vvpi vector<vpi>
#define vb vector<bool>
#define vvb vector<vb>
#define endl "\n"
#define sp << " " <<
#define F(i, s, n) for(int i = s; i < n; i++)
#define pb push_back
#define fi first
#define se second
int inf = LLONG_MAX >> 3;
int n, m;
string grid[100];
int solved;
vector<pair<char, int>> ans;
void floodfill(int y, int x, int d = 0) {
if(x < 0 || y < 0 || x >= m || y >= n || grid[y][x] == '.') return;
if(grid[y][x] == 'x') {
solved = d;
return;
}
if(grid[y][x] == '^') floodfill(y-1, x, d+1);
if(grid[y][x] == 'v') floodfill(y+1, x, d+1);
if(grid[y][x] == '<') floodfill(y, x-1, d+1);
if(grid[y][x] == '>') floodfill(y, x+1, d+1);
}
void solve() {
cin >> n >> m;
F(i, 0, n) cin >> grid[i];
int y, x;
F(i, 0, n) {
F(j, 0, m) {
if(grid[i][j] == 'o') {
y = i; x = j;
break;
}
}
}
int dy[] = {-1, 1, 0, 0};
int dx[] = {0, 0, -1, 1};
string w = "NSWE";
F(i, 0, 4) {
solved = 0;
floodfill(y + dy[i], x + dx[i]);
if(solved) ans.pb({solved, w[i]});
}
if(ans.size()) {
sort(ans.begin(), ans.end());
cout << ":)" << endl << string(1, ans[0].se) << endl;
} else cout << ":(" << endl;
}
void setIO() {
ios::sync_with_stdio(0); cin.tie(0);
#ifdef Local
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
}
signed main() {
setIO();
solve();
}
Compilation message
patkice.cpp: In function 'void solve()':
patkice.cpp:57:18: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
57 | floodfill(y + dy[i], x + dx[i]);
| ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
patkice.cpp:57:18: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |