Submission #57260

#	Time	Username	Problem	Language	Result	Execution time	Memory
57260		fredbr	Land of the Rainbow Gold (APIO17_rainbow)	C++17	11 / 100	22 ms	5308 KiB

rainbow

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

using namespace std;

const int maxn = 110;

int r, c;
char riv[maxn][maxn];
char vis[maxn][maxn];

void init(int rr, int cc, int sr, int sc, int m, char* s)
{
	r = rr, c = cc;

	int x = sr, y = sc;
	riv[x][y] = 1;
	for (int i = 0; i < m; i++) {

		if (s[i] == 'N') x--;
		else if (s[i] == 'E') y++;
		else if (s[i] == 'S') x++;
		else y--;
		riv[x][y] = 1;
	}

	// for (int i = 1; i <= rr; i++) {
	// 	for (int j = 1; j <= cc; j++)
	// 		cout << int(riv[i][j]);
	// 	cout << "\n";
	// }
}

int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

void dfs(int x, int y, int x1, int y1, int x2, int y2)
{
	vis[x][y] = 1;
	for (int i = 0; i < 4; i++) {

		int xx = x+dx[i];
		int yy = y+dy[i];
		if (xx < x1 or xx > x2 or yy < y1 or yy > y2) continue;
		if (riv[xx][yy] or vis[xx][yy]) continue;
		dfs(xx, yy, x1, y1, x2, y2);
	}
}

int colour(int x1, int y1, int x2, int y2)
{
	int ans = 0;
	memset(vis, 0, sizeof(vis));
	for (int i = x1; i <= x2; i++)
		for (int j = y1; j <= y2; j++)
			if (!riv[i][j] and !vis[i][j])
				dfs(i, j, x1, y1, x2, y2), ans++;

	return ans;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 12
• Subtask 3: 0 / 24
• Subtask 4: 0 / 27
• Subtask 5: 0 / 26