제출 #381467

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
381467		Return_0	Dango Maker (JOI18_dango_maker)	C++17	100 / 100	551 ms	141836 KiB

dango_maker

#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 3e3 + 7;
char ch [N][N]; 
bool ver [N][N], hor [N][N]; 
ll dp[N][N][3], n, m, ret = 0;

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin>> n >> m;
	for (ll i = 1; i <= n; i++) {
		cin>> (ch[i] + 1);
		for (ll j = 1; j <= m-2; j++) if (ch[i][j] == 'R' && ch[i][j+1] == 'G' && ch[i][j+2] == 'W') hor[i][j+1] = 1;
	}

	for (ll j = 1; j <= m; j++) for (ll i = 1; i <= n-2; i++) if (ch[i][j] == 'R' && ch[i+1][j] == 'G' && ch[i+2][j] == 'W') 
		ver[i+1][j] = 1;
	
	for (ll v = 2, add = 0; v <= n + m; v++, ret += add, add = 0) for (ll i = 1, j = v - i; i <= n; i++, j = v - i) if (1 <= j && j <= m) {
		dp[i][j][0] = max({dp[i-1][j+1][0],dp[i-1][j+1][1],dp[i-1][j+1][2]});
		if (hor[i][j]) dp[i][j][1] = max(dp[i-1][j+1][0],dp[i-1][j+1][1]) + 1; 
		if (ver[i][j]) dp[i][j][2] = max(dp[i-1][j+1][0],dp[i-1][j+1][2]) + 1;
		add = max({add,dp[i][j][0],dp[i][j][1],dp[i][j][2]});
	}

	cout << ret << '\n';

	// cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
5 5
RGRGW
GRRGW
WGGWR
RWRGW
RGWGW

*/

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