oj.uz

답안 #775025

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
775025 2023-07-06T06:56:43 Z CyberCow 무지개나라 (APIO17_rainbow) C++17
0 / 100
 3000 ms 28188 KB 
#include "rainbow.h"
#include <queue>
using namespace std;
const int N = 55;
int color[N][N];

void init(int R, int C, int sr, int sc, int M, char *S) {
    color[sr][sc] = 1;
	for (int i = 0; i < M; i++)
	{
		if (S[i] == 'W')
		{
			sc--;
		}
		if (S[i] == 'S')
		{
			sr++;
		}
		if (S[i] == 'E')
		{
			sc++;
		}
		if (S[i] == 'N')
		{
			sr--;
		}
		color[sr][sc] = 1;
	}
}
int st[N][N];

int colour(int ar, int ac, int br, int bc) {
	for (int i = ar; i <= br; i++)
	{
		for (int j = ac; j <= bc; j++)
		{
			st[i][j] = 0;
		}
	}
	int qan = 0;
	for (int i = ar; i <= br; i++)
	{
		for (int j = ac; j <= bc; j++)
		{
			if (st[i][j] == 0 && color[i][j] == 0)
			{
				qan++;
				queue<pair<int, int>> q;
				q.push({ i, j });
				while (!q.empty())
				{
					int x = q.front().first, y = q.front().second;
					q.pop();
					st[x][y] = 1;
					if (x + 1 <= br && color[x + 1][y] == 0 && st[x + 1][y] == 0)
					{
						q.push({ x + 1, y });
					}
					if (x - 1 >= ar && color[x - 1][y] == 0 && st[x - 1][y] == 0)
					{
						q.push({ x - 1, y });
					}
					if (y + 1 <= bc && color[x][y + 1] == 0 && st[x][y + 1] == 0)
					{
						q.push({ x, y + 1 });
					}
					if (y - 1 >= ac && color[x][y - 1] == 0 && st[x][y - 1] == 0)
					{
						q.push({ x, y - 1 });
					}
				}
			}
		}
	}
    return qan;
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 340 KB Output is correct
2 Execution timed out 3081 ms 28188 KB Time limit exceeded
3 Halted 0 ms 0 KB -

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 1 ms 724 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

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

Subtask #4
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 340 KB Output is correct
2 Execution timed out 3081 ms 28188 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 340 KB Output is correct
2 Execution timed out 3081 ms 28188 KB Time limit exceeded
3 Halted 0 ms 0 KB -