oj.uz

Submission #678558

# Submission time Handle Problem Language Result Execution time Memory
678558 2023-01-06T07:28:28 Z vjudge1 Dango Maker (JOI18_dango_maker) C++17
100 / 100
 888 ms 168980 KB 
/*
	Unknown's C++ Template (v3.2)
*/

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

// #define int long long

using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using vi = vector<int>;
using vii = vector<ii>;
using vvi = vector<vi>;
using vvii = vector<vii>;
template <class T> using maxpq = priority_queue<T>;
template <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;

#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mid ((l+r)>>1)
#define fi first
#define se second

#ifdef LOCAL
	#define debug(x) cout << #x << " = " << x << "\n";
#else
	#define debug(x) ;
#endif

template <class A, class B>
ostream& operator << (ostream& out, pair<A, B> x)
{ out << "(" << x.first << ", " << x.second << ")"; return out; }

template <class T>
ostream& operator << (ostream& out, vector<T> x){
	out << "[";
	for (int i=0; i<sz(x); i++) { out << (i ? ", " : "") << x[i]; }
	out << "]"; return out;
}

template <class T>
istream& operator >> (istream& in, vector<T> &x){
	for (auto &i: x) in >> i;
	return in;
}

const ld PI = acos(-1.0);
const int allmod[3] = {(int)1e9+7, 998244353, (int)1e9+9};
const int mod = allmod[0];
const int maxn = 2e5 + 64;
const ll inf = 1e18;
const ld eps = 1e-6;
const int multitest = 0;

using i16 = int16_t;

i16 dp[3005][3005][3][3];
// 0 -> none, 1 -> down, 2 -> right

void main_program(){
	int n, m; cin >> n >> m;
	vector<string> vs(n); for (auto &i: vs) cin >> i;

	int res = 0;
	for (int sum = 0; sum < n + m - 1; sum++){
		i16 diagonal_max = 0;
		for (int i = 0; i <= sum; i++){
			int j = sum - i;

			if ((i < 0) || (i >= n) || (j < 0) || (j >= m)) continue;

			int pi = i - 1, pj = j + 1;
			bool valid = ((pi >= 0) && (pi < n) && (pj >= 0) && (pj < m));

			for (int m1 = 0; m1 < 3; m1++){
				for (int m2 = 0; m2 < 3; m2++){
					int val = (valid ? dp[pi][pj][m1][m2] : 0);
					// none
					dp[i][j][0][m1] = max(dp[i][j][0][m1], i16(val));
					// down
					bool valid_down = (i+2 >= n) ? false :
						(vs[i][j] == 'R' && vs[i+1][j] == 'G' && vs[i+2][j] == 'W');
					dp[i][j][1][m1] = max(dp[i][j][1][m1], i16(val + valid_down));
					// right
					bool valid_right = (j+2 >= m) ? false :
						(vs[i][j] == 'R' && vs[i][j+1] == 'G' && vs[i][j+2] == 'W');
					if (m1 == 1 || m2 == 1) valid_right = false;
					dp[i][j][2][m1] = max(dp[i][j][2][m1], i16(val + valid_right));

					diagonal_max = max({diagonal_max, dp[i][j][0][m1], dp[i][j][1][m1], dp[i][j][2][m1]});
				}
			}

			// // DEBUG
			// for (int m1 = 0; m1 < 3; m1++){
			// 	for (int m2 = 0; m2 < 3; m2++){
			// 		cout << "dp[" << i << "][" << j << "][" << m1 << "][" << m2 << "] = " << dp[i][j][m1][m2] << "\n";
			// 	}
			// }
		}
		res += diagonal_max;
	}

	cout << res << "\n";
}

void pre_main(){

}

signed main(){
	#ifdef LOCAL
		auto stime = chrono::high_resolution_clock::now();
	#endif
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	#ifndef ONLINE_JUDGE
		if (fopen(".inp", "r")){
			freopen(".inp", "r", stdin);
			freopen(".out", "w", stdout);
		}
	#endif
	int t = 1; if (multitest) cin >> t;
	pre_main();
	while (t--) main_program();
	#ifdef LOCAL
		auto etime = chrono::high_resolution_clock::now();
		auto duration = chrono::duration_cast<chrono::milliseconds>(etime-stime).count();
		cout << "\n[" << duration << "ms]\n";
	#endif
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:121:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  121 |    freopen(".inp", "r", stdin);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:122:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  122 |    freopen(".out", "w", stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 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 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 304 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 0 ms 340 KB Output is correct
54 Correct 11 ms 340 KB Output is correct
55 Correct 18 ms 12756 KB Output is correct
56 Correct 12 ms 716 KB Output is correct
57 Correct 11 ms 8788 KB Output is correct
58 Correct 80 ms 22988 KB Output is correct
59 Correct 888 ms 168980 KB Output is correct
60 Correct 850 ms 168840 KB Output is correct
61 Correct 860 ms 168796 KB Output is correct
62 Correct 11 ms 340 KB Output is correct
63 Correct 816 ms 168516 KB Output is correct
64 Correct 865 ms 168968 KB Output is correct
65 Correct 809 ms 168828 KB Output is correct
66 Correct 831 ms 168800 KB Output is correct
67 Correct 838 ms 168900 KB Output is correct
68 Correct 858 ms 168948 KB Output is correct
69 Correct 884 ms 168816 KB Output is correct
70 Correct 77 ms 22956 KB Output is correct
71 Correct 79 ms 23008 KB Output is correct
72 Correct 79 ms 22988 KB Output is correct
73 Correct 80 ms 23040 KB Output is correct
74 Correct 77 ms 22952 KB Output is correct
75 Correct 76 ms 23028 KB Output is correct
76 Correct 79 ms 23032 KB Output is correct
77 Correct 88 ms 23056 KB Output is correct
78 Correct 80 ms 23012 KB Output is correct
79 Correct 76 ms 22964 KB Output is correct
80 Correct 76 ms 23024 KB Output is correct
81 Correct 83 ms 22964 KB Output is correct
82 Correct 80 ms 22952 KB Output is correct
83 Correct 86 ms 23016 KB Output is correct
84 Correct 76 ms 23012 KB Output is correct
85 Correct 76 ms 23032 KB Output is correct
86 Correct 76 ms 23072 KB Output is correct
87 Correct 84 ms 22964 KB Output is correct
88 Correct 81 ms 23024 KB Output is correct
89 Correct 80 ms 23012 KB Output is correct
90 Correct 76 ms 23072 KB Output is correct