Submission #165065

#	Time	Username	Problem	Language	Result	Execution time	Memory
165065		Berted	Dango Maker (JOI18_dango_maker)	C++14	13 / 100	2 ms	504 KiB

dango_maker

#include <iostream>
#include <queue>
#define pii pair<int,int>
#define fst first
#define snd second
using namespace std;
int n,m,to=0;string mp[3001]={};
bool bt[3001][3001][2]={};
queue<pii> q;
bool ck(int y,int x,int dr)
{
	if (y>=0 && y<n-(dr?2:0) && x>=0 && x<m-((!dr)?2:0))
	{
		return mp[y][x] == 'R' && mp[y+dr][x+(!dr)] == 'G' && mp[y+2*dr][x+2*(!dr)] == 'W';
	} 
	else {return 0;}
}
int main()
{
	cin>>n>>m;
	for (int i=0;i<n;i++) {cin>>mp[i];}
	for (int i=0;i<n;i++)
	{
		for (int j=0;j<m;j++)
		{
			if (ck(i,j,0) && !bt[i][j][0])
			{
				int to1 = 0,to2 = 0;
				q.push({i,j});
				while (!q.empty())
				{
					pii dt = q.front();q.pop();
					for (int i=0;i<3;i++)
					{
						if (!bt[dt.fst][dt.snd][0])
						{
							bt[dt.fst][dt.snd][0] = 1;
							to1++;
							for (int i=0;i<3;i++)
							{
								if (ck(dt.fst-i,dt.snd+i,1))
								{
									to2 += !bt[dt.fst-i][dt.snd+i][1];
									bt[dt.fst-i][dt.snd+i][1] = 1;
									for (int j=0;j<3;j++)
									{
										if (j==i) {continue;}
										if (ck(dt.fst-i+j,dt.snd+i-j,0))
										{
											q.push({dt.fst-i+j,dt.snd+i-j});
										}
									}
								}
							}
						}
					}
				}
				//cout<<i<<" "<<j<<" "<<to1<<" "<<to2<<"\n";
				to+=max(to1,to2);
			}
		}
	}
	for (int i=0;i<n;i++)
	{
		for (int j=0;j<m;j++)
		{
			if (ck(i,j,1) && !bt[i][j][1]) {to++;}
		}
	}
	cout<<to<<"\n";
	return 0;
}

• Subtask 1: 13 / 13
• Subtask 2: 0 / 20
• Subtask 3: 0 / 67