Submission #347690

# Submission time Handle Problem Language Result Execution time Memory
347690 2021-01-13T10:23:22 Z nicholask Land of the Rainbow Gold (APIO17_rainbow) C++14
0 / 100
5 ms 748 KB
#include "rainbow.h"
#include <bits/stdc++.h>
using namespace std;
int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
bool a[51][200001];
int dp[4][200001];
bool rr;
void init(int R, int C, int sr, int sc, int M, char *S) {
	a[sr][sc]=1;
	for (int i=0; i<M; i++){
		if (S[i]=='N') sr--;
		else if (S[i]=='E') sc++;
		else if (S[i]=='S') sr++;
		else if (S[i]=='W') sc--;
		a[sr][sc]=1;
	}
	if (R==2){
		rr=1;
		int cur[4]={};
		for (int i=1; i<=C; i++){
			if (i==1){
				if (!a[1][i]) dp[1][i]=cur[1]=1;
				if (!a[2][i]) dp[2][i]=cur[2]=1;
				if (!a[1][i]||!a[2][i]) dp[3][i]=cur[3]=1;
			} else {
				if (a[1][i-1]&&!a[1][i]){
					cur[1]++;
					dp[1][i]=cur[1];
				} else dp[1][i]=dp[1][i-1];
				if (a[2][i-1]&&!a[2][i]){
					cur[2]++;
					dp[2][i]=cur[2];
				} else dp[2][i]=dp[2][i-1];
				if (a[1][i-1]&&a[2][i-1]&&(!a[1][i]||!a[2][i])){
					cur[3]++;
					dp[3][i]=cur[3];
				} else dp[3][i]=dp[3][i-1];
			}
		}
	}
}
int colour(int ar, int ac, int br, int bc) {
    if (rr){
    	if (ar==br) return dp[ar][bc]-dp[ar][ac]+(!a[ar][ac]);
    	else return dp[3][bc]-dp[3][ac]+(!a[3][ac]||!a[3][bc]);
	} else {
		int ans=0;
		bool visited[51][51];
		for (int i=1; i<51; i++){
			for (int j=1; j<51; j++) visited[i][j]=0;
		}
		for (int i=ar; i<=br; i++){
			for (int j=ac; j<=bc; j++){
				if (visited[i][j]||a[i][j]) continue;
				visited[i][j]=1;
				ans++;
				queue <pair <int,int> > q;
				q.push({i,j});
				while (!q.empty()){
					pair <int,int> t=q.front();
					q.pop();
					for (int d=0; d<4; d++){
						i+=dx[d];
						j+=dx[d];
						if (i>=ar&&i<=br&&j>=ac&&j<=bc&&!visited[i][j]&&!a[i][j]){
							visited[i][j]=1;
							q.push({i,j});
						}
						i-=dx[d];
						j-=dx[d];
					}
				}
			}
		}
		return ans;
	}
}

Compilation message

rainbow.cpp: In function 'int colour(int, int, int, int)':
rainbow.cpp:60:21: warning: variable 't' set but not used [-Wunused-but-set-variable]
   60 |      pair <int,int> t=q.front();
      |                     ^
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 492 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Runtime error 2 ms 748 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 Incorrect 5 ms 492 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 492 KB Output isn't correct
2 Halted 0 ms 0 KB -