Submission #646742

#	Time	Username	Problem	Language	Result	Execution time	Memory
646742		ttamx	Dango Maker (JOI18_dango_maker)	C++14	100 / 100	236 ms	123856 KiB

dango_maker

#include<bits/stdc++.h>

using namespace std;

const int N=3005;

int n,m;
int dp[N][N][3];
char c[N][N];

int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	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({dp[i-1][j+1][0],dp[i-1][j+1][1],dp[i-1][j+1][2]});
			if(c[i][j]=='G'){
				if(c[i][j-1]=='R'&&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+1][j]=='W')dp[i][j][2]=max(dp[i-1][j+1][0],dp[i-1][j+1][2])+1;
			}
		}
	}
	int ans=0;
	for(int i=1;i<=n;++i)ans+=max({dp[i][1][0],dp[i][1][1],dp[i][1][2]});
	for(int i=2;i<=m;++i)ans+=max({dp[n][i][0],dp[n][i][1],dp[n][i][2]});
	cout << ans;
	return 0;
}

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