Submission #1273874

#	Time	Username	Problem	Language	Result	Execution time	Memory
1273874		trvhung	Dango Maker (JOI18_dango_maker)	C++20	33 / 100	187 ms	9304 KiB

dango_maker

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

// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
using namespace std;

// #define   ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define            ll long long
#define           ull unsigned long long
#define            ld long double
#define            pb push_back
#define  bit(mask, i) ((mask >> i) & 1)
#define            el '\n'
#define             F first
#define             S second

template <class X, class Y> bool maximize(X &x, const Y &y) { return (x < y ? x = y, 1 : 0); }
template <class X, class Y> bool minimize(X &x, const Y &y) { return (x > y ? x = y, 1 : 0); }

const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
const int MULTI = 0;
const ld eps = 1e-9;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; // R D L U
const int ddx[4] = {-1, 1, 1, -1}, ddy[4] = {1, 1, -1, -1}; // UR DR DL UL
const char cx[4] = {'R', 'D', 'L', 'U'};
const ll base = 31;
const int nMOD = 2;
const ll mods[] = {(ll)1e9 + 10777, (ll)1e9 + 19777, (ll)1e9 + 3, (ll)1e9 + 3777};

const int N = 3e3 + 5;
int n, m, dp[N][2][2];
char c[N][N];

bool check_stick(int i, int j, int t) {
    if (t == 0) return (j > 1 && j < m && c[i][j - 1] == 'R' && c[i][j] == 'G' && c[i][j + 1] == 'W');
    else return (i > 1 && i < n && c[i - 1][j] == 'R' && c[i][j] == 'G' && c[i + 1][j] == 'W');
}

void solve() {
	cin >> n >> m;
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= m; ++j)
			cin >> c[i][j];

	int res = 0;
	for (int d = 2; d <= n + m; ++d) {
		memset(dp, 0, sizeof(dp));
		dp[1][1][0] = check_stick(1, d - 1, 0);

		int lim = min(d - 1, n);
		for (int i = 2; i <= lim; ++i) {
			int j = d - i;
			dp[i][0][0] = max({dp[i - 1][0][0], dp[i - 1][0][1], dp[i - 1][1][0], dp[i - 1][1][1]});

			if (c[i][j] != 'G') continue;

			if (check_stick(i, j, 0)) {
				maximize(dp[i][1][0], max(dp[i - 1][0][0], dp[i - 1][1][0]) + 1);
			} 
			if (check_stick(i, j, 1)) {
				maximize(dp[i][0][1], max(dp[i - 1][0][0], dp[i - 1][0][1]) + 1);
			}
		}

		res += max({dp[lim][0][0], dp[lim][0][1], dp[lim][1][0], dp[lim][1][1]});
	}

	cout << res;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    if (!MULTI) solve();
    else {
        int test; cin >> test;
        while (test--) solve();
    }
    
    return 0;
}

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