oj.uz

답안 #931434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931434 2024-02-21T19:26:20 Z rainboy 여왕벌 (KOI15_queen) C
24 / 100
 2816 ms 34836 KB 
#include <stdio.h>

#define N	700

int max(int a, int b) { return a > b ? a : b; }

int main() {
	static char cc[3][3][3][N][N];
	static int ans[N][N + 1];
	int n, k, i, j, j1, j2, a, b, c;

	scanf("%d%d", &n, &k);
	for (i = 1; i < n; i++)
		for (j = 1; j < n; j++) {
			static char s[28];

			scanf("%s", s);
			for (a = 0; a < 3; a++)
				for (b = 0; b < 3; b++)
					for (c = 0; c < 3; c++)
						cc[a][b][c][i][j] = s[(a * 3 + b) * 3 + c];
		}
	while (k--) {
		int x, y;

		scanf("%d%d%*d", &x, &y), y += x;
		j1 = max(x - (n - 1), 0), j2 = max(y - (n - 1), 0);
		ans[0][j1]++, ans[0][j2]++;
		for (i = 1; i < n; i++) {
			if (n - i <= x) {
				if (j1 == j2) {
					if (j2 == 0 || j2 < n && cc[0][0][2][i][j2] != 'U') {
						j2++;
						while (j2 < n && cc[0][0][2][i][j2] == 'L')
							j2++;
						j1 = j2;
					}
				} else if (j1 == 0 || cc[0][0][1][i][j1] != 'U') {
					j1++;
					while (j1 < j2 && cc[0][1][1][i][j1] == 'L')
						j1++;
					if (j1 < j2) {
						if (j2 < n && cc[1][1][2][i][j2] != 'U') {
							j2++;
							while (j2 < n && cc[1][2][2][i][j2] == 'L')
								j2++;
						}
					} else {
						if (j2 < n && cc[0][1][2][i][j2] != 'U') {
							j2++;
							while (j2 < n && cc[0][2][2][i][j2] == 'L')
								j2++;
						}
					}
				}
			} else if (n - i <= y) {
				if (j2 == 0 || j2 < n && cc[1][1][2][i][j2] != 'U') {
					j2++;
					while (j2 < n && cc[1][2][2][i][j2] == 'L')
						j2++;
				}
			}
			ans[i][j1]++, ans[i][j2]++;
		}
	}
	for (i = 0; i < n; i++)
		for (j = 1; j < n; j++)
			ans[i][j] += ans[i][j - 1];
	for (i = 0; i < n; i++)
		for (j = 0; j < n; j++)
			ans[i][j]++;
	for (i = 0; i < n; i++) {
		for (j = 0; j < n; j++)
			printf("%d ", ans[i][j]);
		printf("\n");
	}
	return 0;
}

Compilation message

queen.c: In function 'main':
queen.c:32:28: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   32 |      if (j2 == 0 || j2 < n && cc[0][0][2][i][j2] != 'U') {
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
queen.c:57:27: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   57 |     if (j2 == 0 || j2 < n && cc[1][1][2][i][j2] != 'U') {
      |                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
queen.c:12:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |  scanf("%d%d", &n, &k);
      |  ^~~~~~~~~~~~~~~~~~~~~
queen.c:17:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |    scanf("%s", s);
      |    ^~~~~~~~~~~~~~
queen.c:26:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |   scanf("%d%d%*d", &x, &y), y += x;
      |   ^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12632 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Incorrect 4 ms 13404 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12636 KB Output is correct
2 Correct 31 ms 17080 KB Output is correct
3 Correct 48 ms 19836 KB Output is correct
4 Correct 136 ms 31048 KB Output is correct
5 Correct 119 ms 31204 KB Output is correct
6 Correct 137 ms 31056 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 12636 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2816 ms 34836 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 12632 KB Output isn't correct
2 Halted 0 ms 0 KB -