제출 #791812

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
791812		Dan4Life	무지개나라 (APIO17_rainbow)	C++17	11 / 100	14 ms	880 KiB

rainbow

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a), end(a)
const int mxN = (int)55;
const int X[] = {1,-1,0,0};
const int Y[] = {0,0,1,-1};
int n, m;
bool a[mxN][mxN], vis[mxN][mxN];

void recur(int x, int y){
	if(x<0 or y<0 or x>=n or y>=m or a[x][y] or vis[x][y]) return;
	vis[x][y]=1; for(int i = 0; i < 4; i++) recur(x+X[i],y+Y[i]);
}

void init(int R, int C, int x, int y, int M, char *s) {
	x--, y--; a[x][y]=1; n = R, m = C;
	for(int i = 0; i < M; i++){
		if(s[i]=='N') x--;
		if(s[i]=='S') x++;
		if(s[i]=='W') y--;
		if(s[i]=='E') y++;
		a[x][y] = 1;
	}
}

int colour(int r1, int c1, int r2, int c2) {
	memset(vis,0,sizeof(vis));
	r1--,c1--,r2--,c2--; int cnt = 0;
	for(int i = 0; i < n; i++)
		for(int j = 0; j < m; j++)
			if(i<r1 or i>r2 or j<c1 or j>c2) vis[i][j]=1;
	for(int i = r1; i <= r2; i++)
		for(int j = c1; j <= c2; j++)
			if(!vis[i][j] and !a[i][j]) 
				recur(i,j),cnt++;
	return cnt;
}

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