Submission #236419

#	Time	Username	Problem	Language	Result	Execution time	Memory
236419		GioChkhaidze	Dango Maker (JOI18_dango_maker)	C++14	100 / 100	876 ms	124624 KiB

dango_maker

#include <bits/stdc++.h>
using namespace std;
const int N=3020;
char c[N][N];
int n,m,dp[N][N][3],ans;
main () {
	cin>>n>>m;
	for (int i=1; i<=n; i++) 
		for (int j=1; j<=m; j++)
			cin>>c[i][j];

	for (int i=1; i<=n; i++)
		for (int j=1; j<=m; j++) {
			dp[i][j][0]=max(max(dp[i-1][j+1][0],dp[i-1][j+1][1]),dp[i-1][j+1][2]);
			
			if (c[i][j-1]=='R' && c[i][j]=='G' && c[i][j+1]=='W') 
				dp[i][j][1]=max(dp[i-1][j+1][0],dp[i-1][j+1][1])+1;		
			
			if (c[i-1][j]=='R' && c[i][j]=='G' && c[i+1][j]=='W')
				dp[i][j][2]=max(dp[i-1][j+1][0],dp[i-1][j+1][2])+1;	
		}
		
	for (int i=1; i<=n; i++)
		ans+=max(dp[i][1][0],dp[i][1][2]);

	for (int j=2; j<=m; j++)
		ans+=max(dp[n][j][0],dp[n][j][1]);

	cout<<ans<<"\n";	
}

Compilation message (stderr)

dango_maker.cpp:6:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

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