답안 #544978

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
544978	2022-04-03T09:21:24 Z	valerikk	무지개나라 (APIO17_rainbow)	C++17	11 / 100	4 ms	864 KB

rainbow

#include "rainbow.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 55;

int n, m;
int a[N][N];
int cnt;

void init(int R, int C, int sr, int sc, int M, char *S) {
	n = R;
	m = C;
	
	for (int i = 0; i < n; ++i) {
		fill_n(a[i], m, 0);
	}
	
	int x = sr - 1, y = sc - 1;
	a[x][y] = 1;
	cnt = 1;
	for (int i = 0; i < M; ++i) {
		if (S[i] == 'N') {
			--x;
		}
		if (S[i] == 'S') {
			++x;
		}
		if (S[i] == 'E') {
			++y;
		}
		if (S[i] == 'W') {
			--y;
		}

		cnt += !a[x][y];
	
		a[x][y] = 1;
	}
}

int colour(int ar, int ac, int br, int bc) {
	int x1 = ar - 1, y1 = ac - 1, x2 = br - 1, y2 = bc - 1;
	
	int e = 0, v = 0, f = 0;
	for (int x = x1; x <= x2; ++x) {
		for (int y = y1; y <= y2; ++y) {
			e += x < x2 && !a[x][y] && !a[x + 1][y];
			e += y < y2 && !a[x][y] && !a[x][y + 1];
			v += !a[x][y];
			f += x < x2 && y < y2 && !a[x][y] && !a[x + 1][y] && !a[x][y + 1] && !a[x + 1][y + 1];
		}
	}

	{
		int cn = 0;
		for (int x = x1 + 1; x <= x2 - 1; ++x) {
			for (int y = y1 + 1; y <= y2 - 1; ++y) {
				cn += a[x][y];
			}
		}	
		f += cn == cnt;
	}

	if (v == 0) {
		return 0;
	}

	int c = f - e + v;

	return c;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	3 ms	320 KB	Output is correct
3	Correct	4 ms	340 KB	Output is correct
4	Correct	4 ms	340 KB	Output is correct
5	Correct	3 ms	356 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	312 KB	Output is correct
11	Correct	4 ms	340 KB	Output is correct
12	Correct	3 ms	340 KB	Output is correct
13	Correct	3 ms	340 KB	Output is correct
14	Correct	2 ms	340 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct

Subtask #2

0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Runtime error	2 ms	688 KB	Execution killed with signal 11
4	Halted	0 ms	0 KB	-

Subtask #3

0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Runtime error	1 ms	596 KB	Execution killed with signal 11
3	Halted	0 ms	0 KB	-

Subtask #4

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	3 ms	320 KB	Output is correct
3	Correct	4 ms	340 KB	Output is correct
4	Correct	4 ms	340 KB	Output is correct
5	Correct	3 ms	356 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	312 KB	Output is correct
11	Correct	4 ms	340 KB	Output is correct
12	Correct	3 ms	340 KB	Output is correct
13	Correct	3 ms	340 KB	Output is correct
14	Correct	2 ms	340 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Runtime error	1 ms	864 KB	Execution killed with signal 11
19	Halted	0 ms	0 KB	-

Subtask #5

0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	3 ms	320 KB	Output is correct
3	Correct	4 ms	340 KB	Output is correct
4	Correct	4 ms	340 KB	Output is correct
5	Correct	3 ms	356 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	312 KB	Output is correct
11	Correct	4 ms	340 KB	Output is correct
12	Correct	3 ms	340 KB	Output is correct
13	Correct	3 ms	340 KB	Output is correct
14	Correct	2 ms	340 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Runtime error	1 ms	864 KB	Execution killed with signal 11
19	Halted	0 ms	0 KB	-