Submission #57261

# Submission time Handle Problem Language Result Execution time Memory
57261 2018-07-14T12:21:46 Z fredbr Land of the Rainbow Gold (APIO17_rainbow) C++17
0 / 100
3000 ms 44036 KB
#include <bits/stdc++.h>
#include "rainbow.h"

using namespace std;

const int maxn = 110;
const int maxm = 202020;
int r, c;
char riv[maxn][maxm];
char vis[maxn][maxm];

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;
}
# Verdict Execution time Memory Grader output
1 Execution timed out 3049 ms 22192 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 72 ms 22244 KB Output is correct
2 Correct 74 ms 22244 KB Output is correct
3 Execution timed out 3104 ms 44036 KB Time limit exceeded
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 23 ms 44036 KB Output is correct
2 Runtime error 5 ms 44036 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 3049 ms 22192 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 3049 ms 22192 KB Time limit exceeded
2 Halted 0 ms 0 KB -