oj.uz

Submission #678536

# Submission time Handle Problem Language Result Execution time Memory
678536 2023-01-06T06:59:12 Z vjudge1 Dango Maker (JOI18_dango_maker) C++17
100 / 100
 851 ms 169152 KB 
// 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

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.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 1 ms 328 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 1 ms 328 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 1 ms 328 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 1 ms 328 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 7 ms 21460 KB Output is correct
56 Correct 2 ms 596 KB Output is correct
57 Correct 7 ms 14664 KB Output is correct
58 Correct 113 ms 25116 KB Output is correct
59 Correct 851 ms 168996 KB Output is correct
60 Correct 776 ms 168952 KB Output is correct
61 Correct 783 ms 168932 KB Output is correct
62 Correct 1 ms 468 KB Output is correct
63 Correct 743 ms 168892 KB Output is correct
64 Correct 738 ms 169004 KB Output is correct
65 Correct 739 ms 168988 KB Output is correct
66 Correct 767 ms 169152 KB Output is correct
67 Correct 708 ms 168976 KB Output is correct
68 Correct 701 ms 168996 KB Output is correct
69 Correct 705 ms 169016 KB Output is correct
70 Correct 92 ms 25164 KB Output is correct
71 Correct 103 ms 25204 KB Output is correct
72 Correct 86 ms 25164 KB Output is correct
73 Correct 99 ms 25164 KB Output is correct
74 Correct 88 ms 25084 KB Output is correct
75 Correct 89 ms 25320 KB Output is correct
76 Correct 98 ms 25120 KB Output is correct
77 Correct 88 ms 25184 KB Output is correct
78 Correct 90 ms 25096 KB Output is correct
79 Correct 90 ms 25160 KB Output is correct
80 Correct 89 ms 25204 KB Output is correct
81 Correct 85 ms 25080 KB Output is correct
82 Correct 88 ms 25192 KB Output is correct
83 Correct 87 ms 25168 KB Output is correct
84 Correct 89 ms 25156 KB Output is correct
85 Correct 91 ms 25088 KB Output is correct
86 Correct 89 ms 25140 KB Output is correct
87 Correct 85 ms 25216 KB Output is correct
88 Correct 87 ms 25076 KB Output is correct
89 Correct 86 ms 25224 KB Output is correct
90 Correct 89 ms 25320 KB Output is correct