Submission #678537

#	Time	Username	Problem	Language	Result	Execution time	Memory
678537		SanguineChameleon	Dango Maker (JOI18_dango_maker)	C++17	100 / 100	790 ms	168740 KiB

dango_maker

// BEGIN BOILERPLATE CODE

#include <bits/stdc++.h>
using namespace std;

#ifdef KAMIRULEZ
	const bool kami_loc = true;
	const long long kami_seed = 69420;
#else
	const bool kami_loc = false;
	const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count();
#endif

const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamirulez.out";
mt19937_64 kami_gen(kami_seed);

long long rand_range(long long rmin, long long rmax) {
	uniform_int_distribution<long long> rdist(rmin, rmax);
	return rdist(kami_gen);
}

long double rand_real(long double rmin, long double rmax) {
	uniform_real_distribution<long double> rdist(rmin, rmax);
	return rdist(kami_gen);
}

void file_io(string fi, string fo) {
	if (fi != "" && (!kami_loc || fi == kami_fi)) {
		freopen(fi.c_str(), "r", stdin);
	}
	if (fo != "" && (!kami_loc || fo == kami_fo)) {
		freopen(fo.c_str(), "w", stdout);
	}
}

void set_up() {
	if (kami_loc) {
		file_io(kami_fi, kami_fo);
	}
	ios_base::sync_with_stdio(0);
	cin.tie(0);
}

void just_do_it();

void just_exec_it() {
	if (kami_loc) {
		auto pstart = chrono::steady_clock::now();
		just_do_it();
		auto pend = chrono::steady_clock::now();
		long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count();
		string bar(50, '=');
		cout << '\n' << bar << '\n';
		cout << "Time: " << ptime << " ms" << '\n';
	}
	else {
		just_do_it();
	}
}

int main() {
	set_up();
	just_exec_it();
	return 0;
}

// END BOILERPLATE CODE

// BEGIN MAIN CODE

const int ms = 3e3 + 20;
char a[ms][ms];
short dp[ms][ms][3][3];
int n, m;

int check1(int i, int j) {
	return j + 2 <= m && a[i][j] == 'R' && a[i][j + 1] == 'G' && a[i][j + 2] == 'W';
}

int check2(int i, int j) {
	return i + 2 <= n && a[i][j] == 'R' && a[i + 1][j] == 'G' && a[i + 2][j] == 'W';
}

void just_do_it() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> a[i][j];
		}
	}
	for (int j = 1; j <= m; j++) {
		dp[1][j][0][1] = check1(1, j);
		dp[1][j][0][2] = check2(1, j);
	}
	for (int i = 1; i <= n; i++) {
		dp[i][m][0][1] = check1(i, m);
		dp[i][m][0][2] = check2(i, m);
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m - 1; j++) {
			for (int x = 0; x < 3; x++) {
				for (int y = 0; y < 3; y++) {
					dp[i][j][y][0] = max((int)dp[i][j][y][0], (int)dp[i - 1][j + 1][x][y]);
					if (check1(i, j) && y != 2 && x != 2) {
						dp[i][j][y][1] = max((int)dp[i][j][y][1], (int)dp[i - 1][j + 1][x][y] + 1);
					}
					if (check2(i, j)) {
						dp[i][j][y][2] = max((int)dp[i][j][y][2], (int)dp[i - 1][j + 1][x][y] + 1);
					}
				}
			}
		}
	}
	int res = 0;
	for (int j = 1; j <= m; j++) {
		int cur = 0;
		for (int x = 0; x < 3; x++) {
			for (int y = 0; y < 3; y++) {
				cur = max(cur, (int)dp[n][j][x][y]);
			}
		}
		res += cur;
	}
	for (int i = 1; i < n; i++) {
		int cur = 0;
		for (int x = 0; x < 3; x++) {
			for (int y = 0; y < 3; y++) {
				cur = max(cur, (int)dp[i][1][x][y]);
			}
		}
		res += cur;
	}
	cout << res;
}

// END MAIN CODE

Compilation message (stderr)

dango_maker.cpp: In function 'void file_io(std::string, std::string)':
dango_maker.cpp:30:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |   freopen(fi.c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:33:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   freopen(fo.c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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