Submission #165073

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
165073	2019-11-25T04:13:40 Z	Berted	Dango Maker (JOI18_dango_maker)	C++14	33 / 100	2000 ms	14932 KB

dango_maker

#include <iostream>
#include <queue>
#include <vector>
#define pii pair<int,int>
#define fst first
#define snd second
using namespace std;
int n,m,to=0,dp[3001][4]={};string mp[3001]={};
bool bt[3001][3001][2]={},actv[3001][2]={};
queue<pii> q;
inline 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()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	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])
			{
				for (int i=0;i<=n;i++)
				{
					actv[i][0] = actv[i][1] = 0;
					dp[i][0] = dp[i][1] = dp[i][2] = dp[i][3] = 0;
				}
				int to1 = 0,to2 = 0;
				q.emplace(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;
							actv[dt.fst][0] = 1;
							//cout<<dt.fst<<","<<dt.snd<<" 0 activated\n";
							to1++;
							for (int i=0;i<3;i++)
							{
								if (ck(dt.fst-i,dt.snd+i,1))
								{
									if (!bt[dt.fst-i][dt.snd+i][1])
									{
										to2 ++;
										bt[dt.fst-i][dt.snd+i][1] = 1;
										//cout<<dt.fst-i<<","<<dt.snd+i<<" 1 activated\n";
										actv[dt.fst-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.emplace(dt.fst-i+j,dt.snd+i-j);
											}
										}
									}
									
								}
							}
						}
					}
				}
				for (int i=1;i<=n;i++)
				{
					dp[i][0] = max(dp[i-1][0],dp[i-1][1]);
					dp[i][1] = dp[i-1][2];
					dp[i][2] = dp[i-1][3];
					if (actv[i-1][1])
					{
						dp[i][3] = max(dp[i][0],max(dp[i][2],dp[i][1])) + 1;
					}
					if (actv[i-1][0])
					{
						dp[i][0]++;
					}
					//cout<<i<<" 0 -> "<<dp[i][0]<<"\n";
					//cout<<i<<" 1 -> "<<dp[i][1]<<"\n";
					//cout<<i<<" 2 -> "<<dp[i][2]<<"\n";
					//cout<<i<<" 3 -> "<<dp[i][3]<<"\n";
				}
				to+=max(dp[n][0],max(dp[n][1],max(dp[n][3],dp[n][2])));
			}
		}
	}
	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.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Correct	2 ms	504 KB	Output is correct
8	Correct	2 ms	504 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	504 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	504 KB	Output is correct
15	Correct	2 ms	504 KB	Output is correct
16	Correct	2 ms	504 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Correct	2 ms	504 KB	Output is correct
8	Correct	2 ms	504 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	504 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	504 KB	Output is correct
15	Correct	2 ms	504 KB	Output is correct
16	Correct	2 ms	504 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	504 KB	Output is correct
19	Correct	2 ms	504 KB	Output is correct
20	Correct	2 ms	504 KB	Output is correct
21	Correct	2 ms	504 KB	Output is correct
22	Correct	2 ms	504 KB	Output is correct
23	Correct	2 ms	504 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	504 KB	Output is correct
28	Correct	2 ms	504 KB	Output is correct
29	Correct	2 ms	504 KB	Output is correct
30	Correct	2 ms	508 KB	Output is correct
31	Correct	2 ms	504 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	3 ms	504 KB	Output is correct
34	Correct	2 ms	504 KB	Output is correct
35	Correct	2 ms	504 KB	Output is correct
36	Correct	2 ms	504 KB	Output is correct
37	Correct	2 ms	504 KB	Output is correct
38	Correct	2 ms	504 KB	Output is correct
39	Correct	2 ms	504 KB	Output is correct
40	Correct	2 ms	504 KB	Output is correct
41	Correct	2 ms	504 KB	Output is correct
42	Correct	2 ms	504 KB	Output is correct
43	Correct	2 ms	504 KB	Output is correct
44	Correct	2 ms	504 KB	Output is correct
45	Correct	2 ms	504 KB	Output is correct
46	Correct	2 ms	504 KB	Output is correct
47	Correct	2 ms	504 KB	Output is correct
48	Correct	2 ms	504 KB	Output is correct
49	Correct	2 ms	504 KB	Output is correct
50	Correct	2 ms	504 KB	Output is correct
51	Correct	2 ms	504 KB	Output is correct
52	Correct	2 ms	504 KB	Output is correct
53	Correct	2 ms	504 KB	Output is correct

Subtask #3
0 / 67.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Correct	2 ms	504 KB	Output is correct
8	Correct	2 ms	504 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	504 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	504 KB	Output is correct
15	Correct	2 ms	504 KB	Output is correct
16	Correct	2 ms	504 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	504 KB	Output is correct
19	Correct	2 ms	504 KB	Output is correct
20	Correct	2 ms	504 KB	Output is correct
21	Correct	2 ms	504 KB	Output is correct
22	Correct	2 ms	504 KB	Output is correct
23	Correct	2 ms	504 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	504 KB	Output is correct
28	Correct	2 ms	504 KB	Output is correct
29	Correct	2 ms	504 KB	Output is correct
30	Correct	2 ms	508 KB	Output is correct
31	Correct	2 ms	504 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	3 ms	504 KB	Output is correct
34	Correct	2 ms	504 KB	Output is correct
35	Correct	2 ms	504 KB	Output is correct
36	Correct	2 ms	504 KB	Output is correct
37	Correct	2 ms	504 KB	Output is correct
38	Correct	2 ms	504 KB	Output is correct
39	Correct	2 ms	504 KB	Output is correct
40	Correct	2 ms	504 KB	Output is correct
41	Correct	2 ms	504 KB	Output is correct
42	Correct	2 ms	504 KB	Output is correct
43	Correct	2 ms	504 KB	Output is correct
44	Correct	2 ms	504 KB	Output is correct
45	Correct	2 ms	504 KB	Output is correct
46	Correct	2 ms	504 KB	Output is correct
47	Correct	2 ms	504 KB	Output is correct
48	Correct	2 ms	504 KB	Output is correct
49	Correct	2 ms	504 KB	Output is correct
50	Correct	2 ms	504 KB	Output is correct
51	Correct	2 ms	504 KB	Output is correct
52	Correct	2 ms	504 KB	Output is correct
53	Correct	2 ms	504 KB	Output is correct
54	Correct	2 ms	376 KB	Output is correct
55	Correct	2 ms	504 KB	Output is correct
56	Correct	2 ms	504 KB	Output is correct
57	Correct	30 ms	6236 KB	Output is correct
58	Correct	258 ms	7356 KB	Output is correct
59	Execution timed out	2068 ms	14932 KB	Time limit exceeded
60	Halted	0 ms	0 KB	-

Submission #165073

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 20.0 / 20.0

Subtask #3 0 / 67.0

Subtask #1
13.0 / 13.0

Subtask #2
20.0 / 20.0

Subtask #3
0 / 67.0