Submission #1054020

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1054020	2024-08-12T04:46:36 Z	김은성(#11056)	Land of the Rainbow Gold (APIO17_rainbow)	C++14	11 / 100	3000 ms	9812 KB

rainbow

#include "rainbow.h"
int dr[4] = {-1, 0, 1, 0}, dc[4] = {0, 1, 0, -1};
char dir[4] = {'N', 'E', 'S', 'W'};
bool ch[1009][1009];
bool done[1009][1009];
int n, m;
int r1, r2, c1, c2;
bool exist(int tr, int tc){
	return tr>=r1 && tr<=r2 && tc>=c1 && tc<=c2;
}
void dfs(int r, int c){
	done[r][c] = 1;
	for(int k=0; k<4; k++){
		int tr = r + dr[k];
		int tc = c + dc[k];
		if(exist(tr, tc) && !ch[tr][tc] && !done[tr][tc]){
			dfs(tr, tc);
		}
	}
}
void init(int R, int C, int sr, int sc, int M, char *S) {
	n = R;
	m = C;
	ch[sr][sc] = 1;
	for(int i=0; i<M; i++){
		int k;
		for(k=0; k<4; k++){
			if(S[i] == dir[k])
				break;
		}
		sr += dr[k];
		sc += dc[k];
		ch[sr][sc] = 1;
	}
}
int colour(int ar, int ac, int br, int bc) {
	int i, j;
	for(i=1; i<=n; i++){
		for(j=1; j<=m; j++){
			done[i][j] = 0;
		}
	}
	int ans = 0;
	r1=ar, r2=br, c1=ac, c2=bc;
	for(i=ar; i<=br; i++){
		for(j=ac; j<=bc; j++){
			if(!done[i][j] && !ch[i][j]){
				ans++;
				dfs(i, j);
			}
		}
	}
	return ans;
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	3 ms	588 KB	Output is correct
3	Correct	7 ms	676 KB	Output is correct
4	Correct	8 ms	604 KB	Output is correct
5	Correct	3 ms	604 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	6 ms	448 KB	Output is correct
12	Correct	5 ms	444 KB	Output is correct
13	Correct	4 ms	604 KB	Output is correct
14	Correct	2 ms	604 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct

Subtask #2

0 / 12.0

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

Subtask #3

0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Runtime error	1 ms	600 KB	Execution killed with signal 11
3	Halted	0 ms	0 KB	-

Subtask #4

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	3 ms	588 KB	Output is correct
3	Correct	7 ms	676 KB	Output is correct
4	Correct	8 ms	604 KB	Output is correct
5	Correct	3 ms	604 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	6 ms	448 KB	Output is correct
12	Correct	5 ms	444 KB	Output is correct
13	Correct	4 ms	604 KB	Output is correct
14	Correct	2 ms	604 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Execution timed out	3071 ms	9632 KB	Time limit exceeded
19	Halted	0 ms	0 KB	-

Subtask #5

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	3 ms	588 KB	Output is correct
3	Correct	7 ms	676 KB	Output is correct
4	Correct	8 ms	604 KB	Output is correct
5	Correct	3 ms	604 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	6 ms	448 KB	Output is correct
12	Correct	5 ms	444 KB	Output is correct
13	Correct	4 ms	604 KB	Output is correct
14	Correct	2 ms	604 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Execution timed out	3071 ms	9632 KB	Time limit exceeded
19	Halted	0 ms	0 KB	-