Submission #884498

#	Time	Username	Problem	Language	Result	Execution time	Memory
884498		ReLice	Dango Maker (JOI18_dango_maker)	C++14	100 / 100	304 ms	111076 KiB

dango_maker

#include <bits/stdc++.h>
#define ll long long
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define bc back()
#define arr array
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <class _T>
bool chmin(_T &x, const _T &y){
    bool flag=false;
    if(x>y){
        x=y;flag|=true;
    }
    return flag;
}
template <class _T>
bool chmax(_T &x, const _T &y){
    bool flag=false;
    if (x<y){
        x=y;flag|=true;
    }
    return flag;
}
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll inf=1e9+7;
const ll mod=1e9+7;
const ll N=3e3+7;
const ld eps=1e-9;
char a[N][N];
bool ver(ll x,ll y){
	return (a[x-1][y]=='R' && a[x][y]=='G' && a[x+1][y]=='W');
}
bool hor(ll x,ll y){
	return (a[x][y-1]=='R' && a[x][y]=='G' && a[x][y+1]=='W');
}
void solve(){
	ll i,j;
	ll n,m;
	cin>>n>>m;
	vector<vector<ll> > dio(n+m+5);
	for(i=1;i<=n;i++){
		for(j=1;j<=m;j++){
			cin>>a[i][j];
			dio[i+j].pb(i);
		}
	}
	ll ans=0;
	for(i=2;i<=n+m;i++){
		ll k=dio[i].sz;
		vector<arr<ll,3> > dp(k+5);
		for(j=1;j<=k;j++){
			ll x=dio[i][j-1],y=i-x;
			dp[j][0]=max({dp[j-1][0],dp[j-1][1],dp[j-1][2]});
			if(ver(x,y)) dp[j][1]=max({dp[j-1][0],dp[j-1][1]})+1;
			if(hor(x,y)) dp[j][2]=max({dp[j-1][0],dp[j-1][2]})+1;
		}
		ans+=max({dp[k][0],dp[k][1],dp[k][2]});
	}
	cout<<ans<<endl;
}
signed main(){
	start();
    ll t=1;
	//cin>>t;
    while(t--) solve();
    return 0;
}
/*








*/

Compilation message (stderr)

dango_maker.cpp: In function 'void fre(std::string)':
dango_maker.cpp:41:27: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 | void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:41:64: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 | void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                                                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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