oj.uz

Submission #57263

# Submission time Handle Problem Language Result Execution time Memory
57263 2018-07-14T12:22:55 Z fredbr Land of the Rainbow Gold (APIO17_rainbow) C++17
11 / 100
 3000 ms 22920 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;

	for (int i = x1; i <= x2; i++)
		for (int j = y1; j <= y2; j++)
			vis[i][j] = 0;
	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.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 10 ms 996 KB Output is correct
3 Correct 24 ms 1192 KB Output is correct
4 Correct 28 ms 1412 KB Output is correct
5 Correct 10 ms 1412 KB Output is correct
6 Correct 4 ms 1412 KB Output is correct
7 Correct 2 ms 1412 KB Output is correct
8 Correct 2 ms 1412 KB Output is correct
9 Correct 3 ms 1412 KB Output is correct
10 Correct 2 ms 1412 KB Output is correct
11 Correct 28 ms 1412 KB Output is correct
12 Correct 20 ms 1412 KB Output is correct
13 Correct 15 ms 1412 KB Output is correct
14 Correct 12 ms 1412 KB Output is correct
15 Correct 3 ms 1412 KB Output is correct
16 Correct 2 ms 1412 KB Output is correct
17 Correct 2 ms 1412 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1412 KB Output is correct
2 Correct 2 ms 1412 KB Output is correct
3 Execution timed out 3028 ms 22920 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1412 KB Output is correct
2 Runtime error 4 ms 22920 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 10 ms 996 KB Output is correct
3 Correct 24 ms 1192 KB Output is correct
4 Correct 28 ms 1412 KB Output is correct
5 Correct 10 ms 1412 KB Output is correct
6 Correct 4 ms 1412 KB Output is correct
7 Correct 2 ms 1412 KB Output is correct
8 Correct 2 ms 1412 KB Output is correct
9 Correct 3 ms 1412 KB Output is correct
10 Correct 2 ms 1412 KB Output is correct
11 Correct 28 ms 1412 KB Output is correct
12 Correct 20 ms 1412 KB Output is correct
13 Correct 15 ms 1412 KB Output is correct
14 Correct 12 ms 1412 KB Output is correct
15 Correct 3 ms 1412 KB Output is correct
16 Correct 2 ms 1412 KB Output is correct
17 Correct 2 ms 1412 KB Output is correct
18 Runtime error 6 ms 22920 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 10 ms 996 KB Output is correct
3 Correct 24 ms 1192 KB Output is correct
4 Correct 28 ms 1412 KB Output is correct
5 Correct 10 ms 1412 KB Output is correct
6 Correct 4 ms 1412 KB Output is correct
7 Correct 2 ms 1412 KB Output is correct
8 Correct 2 ms 1412 KB Output is correct
9 Correct 3 ms 1412 KB Output is correct
10 Correct 2 ms 1412 KB Output is correct
11 Correct 28 ms 1412 KB Output is correct
12 Correct 20 ms 1412 KB Output is correct
13 Correct 15 ms 1412 KB Output is correct
14 Correct 12 ms 1412 KB Output is correct
15 Correct 3 ms 1412 KB Output is correct
16 Correct 2 ms 1412 KB Output is correct
17 Correct 2 ms 1412 KB Output is correct
18 Runtime error 6 ms 22920 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 Halted 0 ms 0 KB -