Submission #771770

#	Time	Username	Problem	Language	Result	Execution time	Memory
771770		raysh07	Dango Maker (JOI18_dango_maker)	C++17	33 / 100	230 ms	262144 KiB

dango_maker

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve()
{
	int n, m;
	cin >> n >> m;
	vector<string> g(n);
	for (auto &x : g) cin >> x;

	vector<vector<int>> can(n, vector<int>(m, 0));
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m; j++){
			if (g[i][j] != 'G') continue;

			if (i != 0 && i != n - 1 && g[i - 1][j] == 'R' && g[i + 1][j] == 'W')
				can[i][j]++;
			if (j != 0 && j != m - 1 && g[i][j - 1] == 'R' && g[i][j + 1] == 'W')
				can[i][j] += 2;
		}
	}

	vector<vector<vector<int>>> dp(n, vector<vector<int>>(m, vector<int>(3, 0)));
	int last = 0;

	for (int s = 1; s <= n + m - 2; s++){
		bool first = true;
		for (int i = 0; i < min(s + 1, n); i++){
			int j = s - i;
			if (j >= m) continue;

			if (first){
				first = false;
				dp[i][j][0] = last;
				if (can[i][j] % 2) dp[i][j][1] = last + 1;
				if (can[i][j] >= 2) dp[i][j][2] = last + 1;
			} else {
				for (int l1 = 0; l1 <= 2; l1++){
					for (int l2 = 0; l2 <= 2; l2++){
						if (l1 != 0 && l2 != 0 && l1 != l2) continue;
						if (l2 == 0 || (can[i][j] >> (l2 - 1) & 1))
						dp[i][j][l2] = max(dp[i][j][l2], dp[i - 1][j + 1][l1] + (l2 != 0));
					}
				}
			}

			last = max(dp[i][j][0], max(dp[i][j][1], dp[i][j][2]));
		}
	}

	cout << last << "\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
  //  cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

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