Submission #1189677

#	Time	Username	Problem	Language	Result	Execution time	Memory
1189677		thelegendary08	Dango Maker (JOI18_dango_maker)	C++17	100 / 100	1450 ms	15480 KiB

dango_maker

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
const int mxn = 5005;
char grid[mxn][mxn];
int n,m;
bool hor(int x, int y){
	if(x - 1 < 0 || x + 1 >= n)return 0;
	if(grid[x-1][y] == 'R' && grid[x][y] == 'G' && grid[x+1][y] == 'W')return 1;
	return 0;
}

bool ver(int x, int y){
	if(y - 1 < 0 || y + 1 >= m)return 0;
	if(grid[x][y-1] == 'R' && grid[x][y] == 'G' && grid[x][y+1] == 'W')return 1;
	return 0;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	cin>>n>>m;
	f0r(i,n)f0r(j,m)cin>>grid[i][j];
	int ans = 0;
	
	f0r(i,m){
		int x = i;
		int y = 0;
		vvi dp(n+m, vi(3));
		int cnt = 0;
		while(x >= 0 && y < n){
			if(cnt != 0){
				dp[cnt][0] = max(dp[cnt-1][0], max(dp[cnt-1][1], dp[cnt-1][2]));
				dp[cnt][1] = max(dp[cnt-1][0], dp[cnt-1][1]) + hor(y,x);
				dp[cnt][2] = max(dp[cnt-1][0], dp[cnt-1][2]) + ver(y,x);
			}
			else{
				dp[cnt][0] = 0;
				dp[cnt][1] = hor(y,x);
				dp[cnt][2] = ver(y,x);
			}
			x--; y++; cnt++;
		}
		int cur = 0;
		f0r(i,n+m){
			f0r(j, 3){
				cur = max(cur, dp[i][j]);
			}
		}
		// dout(cur);
		ans += cur;
	}
	
	for(int i = 1; i<n; i++){
		int x = m-1;
		int y = i;
		vvi dp(n+m, vi(3));
		int cnt = 0;
		while(x >= 0 && y < n){
			if(cnt != 0){
				dp[cnt][0] = max(dp[cnt-1][0], max(dp[cnt-1][1], dp[cnt-1][2]));
				dp[cnt][1] = max(dp[cnt-1][0], dp[cnt-1][1]) + hor(y,x);
				dp[cnt][2] = max(dp[cnt-1][0], dp[cnt-1][2]) + ver(y,x);
			}
			else{
				dp[cnt][0] = 0;
				dp[cnt][1] = hor(y,x);
				dp[cnt][2] = ver(y,x);
			}
			x--; y++; cnt++;
		}
		int cur = 0;
		f0r(i,n+m){
			f0r(j, 3){
				cur = max(cur, dp[i][j]);
			}
		}
		// dout(cur);
		ans += cur;
	}
	
	out(ans);
}

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