| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 445319 |
2021-07-17T13:06:58 Z |
grt |
Patkice (COCI20_patkice) |
C++17 |
|
1 ms |
332 KB |
#include <bits/stdc++.h>
#define ST first
#define ND second
#define PB push_back
using namespace std;
using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;
const int INF = 1e9, nax = 110;
int n, m;
char t[nax][nax];
pi src, tar;
int path(int x, int y) {
int d = 1;
while(1) {
if(t[x][y] == '>') y++;
else if(t[x][y] == '<') y--;
else if(t[x][y] == '^') x--;
else if(t[x][y] == 'v') x++;
else if(t[x][y] == 'x') return d;
else return INF;
d++;
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for(int i = 0; i < n; ++i) {
for(int j = 0; j < m; ++j) {
cin >> t[i][j];
if(t[i][j] == 'o') src = {i, j};
else if(t[i][j] == 'x') tar = {i, j};
}
}
pair<int, char>ans = {INF, 'A'};
if(src.ST > 0) ans = min(ans, {path(src.ST - 1, src.ND), 'N'});
if(src.ST < n) ans = min(ans, {path(src.ST + 1, src.ND), 'S'});
if(src.ND < m) ans = min(ans, {path(src.ST, src.ND + 1), 'E'});
if(src.ND > 0) ans = min(ans, {path(src.ST, src.ND - 1), 'W'});
if(ans.ND == 'A') cout << ":(";
else cout << ":)\n" << ans.ND;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
332 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
332 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
332 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
332 KB |
Output is correct |
| 11 |
Correct |
1 ms |
204 KB |
Output is correct |
| 12 |
Correct |
1 ms |
332 KB |
Output is correct |
| 13 |
Correct |
1 ms |
316 KB |
Output is correct |
| 14 |
Correct |
1 ms |
204 KB |
Output is correct |
| 15 |
Correct |
1 ms |
204 KB |
Output is correct |
| 16 |
Correct |
1 ms |
204 KB |
Output is correct |
| 17 |
Correct |
0 ms |
204 KB |
Output is correct |
| 18 |
Correct |
1 ms |
204 KB |
Output is correct |
| 19 |
Correct |
0 ms |
204 KB |
Output is correct |
| 20 |
Correct |
1 ms |
204 KB |
Output is correct |
