oj.uz

답안 #482400

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
482400 2021-10-24T12:19:10 Z rainboy Patkice (COCI20_patkice) C
50 / 50
 1 ms 280 KB 
#include <stdio.h>

#define N	100
#define M	100
#define INF	0x3f3f3f3f

int di[] = { 0, -1, 1, 0 };
int dj[] = { 1, 0, 0, -1 };
char dir[] = "ENSW";

int main() {
	static char cc[N][M + 1];
	int n, m, h, i, j;

	scanf("%d%d", &n, &m);
	for (i = 0; i < n; i++)
		scanf("%s", cc[i]);
	for (i = 0; i < n; i++)
		for (j = 0; j < m; j++)
			if (cc[i][j] == 'o') {
				int h_ = -1, d_ = INF;

				for (h = 0; h < 4; h++) {
					int i_ = i + di[h], j_ = j + dj[h], d = 0;

					while (cc[i_][j_] != '.' && cc[i_][j_] != 'o' && cc[i_][j_] != 'x') {
						if (cc[i_][j_] == '>')
							j_++;
						else if (cc[i_][j_] == '^')
							i_--;
						else if (cc[i_][j_] == 'v')
							i_++;
						else
							j_--;
						d++;
					}
					if (cc[i_][j_] == 'x' && d_ > d)
						h_ = h, d_ = d;
				}
				if (h_ == -1)
					printf(":(\n");
				else {
					printf(":)\n");
					printf("%c\n", dir[h_]);
				}
				return 0;
			}
	return 0;
}

Compilation message

patkice.c: In function 'main':
patkice.c:15:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |  scanf("%d%d", &n, &m);
      |  ^~~~~~~~~~~~~~~~~~~~~
patkice.c:17:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |   scanf("%s", cc[i]);
      |   ^~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 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 0 ms 276 KB Output is correct
8 Correct 1 ms 280 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 268 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 280 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 280 KB Output is correct
17 Correct 1 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 0 ms 204 KB Output is correct