oj.uz

Submission #707480

# Submission time Handle Problem Language Result Execution time Memory
707480 2023-03-09T05:11:24 Z GudStonks Patkice (COCI20_patkice) C++17
30 / 50
 1 ms 212 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ft first
#define sd second
int n, m;
char ch[105][105];
pair<int, int>s;
const int dirx[4] = {0, 1, 0, -1};
const int diry[4] = {1, 0, -1, 0};

int dfs(int x, int y){
	if(ch[x][y] == '.' || ch[x][y] == 'o')return 2e9;
	if(ch[x][y] == 'x')return 1;
	if(ch[x][y] == '^')return dfs(x - 1, y) + 1;
	if(ch[x][y] == 'v')return dfs(x + 1, y) + 1;
	if(ch[x][y] == '>')return dfs(x, y + 1) + 1;
	if(ch[x][y] == '<')return dfs(x, y - 1) + 1;
	return 2e9;
}

void fun(){
	cin>>n>>m;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			cin>>ch[i][j];
			if(ch[i][j] == 'o')
				s = {i, j};
		}
	}
	int cur, mn = 2e9;
	char ans = '!';
	for(int i = 0; i < 4; i++){
		cur = dfs(s.ft + dirx[i], s.sd + diry[i]);
		if(cur < mn){
			mn = cur;
			if(i == 0)
				ans = 'E';
			else if(i == 1)
				ans = 'S';
			else if(i == 2)
				ans = 'W';
			else
				ans = 'N';
		}
	}
	if(ans == '!')
		cout<<":(\n";
	else
		cout<<":)\n"<<ans;
}

signed  main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int ttt = 1;
	//cin>>ttt;
	while(ttt--)fun();
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Incorrect 0 ms 212 KB Output isn't correct
19 Halted 0 ms 0 KB -