oj.uz

Submission #119732

# Submission time Handle Problem Language Result Execution time Memory
119732 2019-06-22T05:11:14 Z abacaba Dango Maker (JOI18_dango_maker) C++14
100 / 100
 343 ms 150936 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma")

#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define uset unordered_set
#define umap unordered_map
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>

typedef tree <pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const int inf = 2e9;
const int N = 3e3 + 15;
int n, m, a[N][N], dp[N][N][3];
int ans[N * N];

inline int check(int a, int b, int c) {
	return a == 1 && b == 2 && c == 3;
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for(int i = 1; i <= n; ++i) {
		for(int j = 1; j <= m; ++j) {
			char c;
			cin >> c;
			if(c == 'R')
				a[i][j] = 1;
			else if(c == 'G')
				a[i][j] = 2;
			else
				a[i][j] = 3;
		}
	}
	for(int i = 1; i <= n; ++i) {
		for(int j = m; j; --j) {

			for(int k = 0; k < 3; ++k)
				dp[i][j][0] = max(dp[i][j][0], dp[i-1][j+1][k]);

			dp[i][j][1] = check(a[i-1][j], a[i][j], a[i+1][j]) + max(dp[i-1][j+1][0], dp[i-1][j+1][1]);
			dp[i][j][2] = check(a[i][j-1], a[i][j], a[i][j+1]) + max(dp[i-1][j+1][0], dp[i-1][j+1][2]);

			for(int k = 0; k < 3; ++k)
				ans[i+j] = max(ans[i+j], dp[i][j][k]);
		}
	}
	int x = 0;
	for(int i = 0; i <= n + m; ++i)
		x += ans[i];
	cout << x;
	return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 356 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 3 ms 504 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 2 ms 512 KB Output is correct
34 Correct 2 ms 512 KB Output is correct
35 Correct 3 ms 512 KB Output is correct
36 Correct 2 ms 512 KB Output is correct
37 Correct 2 ms 512 KB Output is correct
38 Correct 2 ms 512 KB Output is correct
39 Correct 2 ms 512 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 2 ms 512 KB Output is correct
42 Correct 2 ms 512 KB Output is correct
43 Correct 2 ms 512 KB Output is correct
44 Correct 3 ms 512 KB Output is correct
45 Correct 2 ms 512 KB Output is correct
46 Correct 3 ms 512 KB Output is correct
47 Correct 2 ms 384 KB Output is correct
48 Correct 2 ms 512 KB Output is correct
49 Correct 2 ms 384 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 2 ms 512 KB Output is correct
52 Correct 3 ms 512 KB Output is correct
53 Correct 2 ms 384 KB Output is correct
54 Correct 2 ms 384 KB Output is correct
55 Correct 22 ms 24668 KB Output is correct
56 Correct 3 ms 656 KB Output is correct
57 Correct 17 ms 16820 KB Output is correct
58 Correct 47 ms 25128 KB Output is correct
59 Correct 335 ms 150924 KB Output is correct
60 Correct 328 ms 150872 KB Output is correct
61 Correct 343 ms 150852 KB Output is correct
62 Correct 2 ms 512 KB Output is correct
63 Correct 323 ms 150520 KB Output is correct
64 Correct 271 ms 150928 KB Output is correct
65 Correct 282 ms 150936 KB Output is correct
66 Correct 273 ms 150840 KB Output is correct
67 Correct 279 ms 150904 KB Output is correct
68 Correct 281 ms 150908 KB Output is correct
69 Correct 292 ms 150796 KB Output is correct
70 Correct 40 ms 25084 KB Output is correct
71 Correct 41 ms 25080 KB Output is correct
72 Correct 42 ms 25160 KB Output is correct
73 Correct 41 ms 25096 KB Output is correct
74 Correct 44 ms 25080 KB Output is correct
75 Correct 41 ms 25080 KB Output is correct
76 Correct 42 ms 25080 KB Output is correct
77 Correct 42 ms 25208 KB Output is correct
78 Correct 40 ms 25084 KB Output is correct
79 Correct 40 ms 25080 KB Output is correct
80 Correct 41 ms 25080 KB Output is correct
81 Correct 45 ms 25080 KB Output is correct
82 Correct 39 ms 25096 KB Output is correct
83 Correct 39 ms 25080 KB Output is correct
84 Correct 39 ms 25080 KB Output is correct
85 Correct 42 ms 25080 KB Output is correct
86 Correct 40 ms 25080 KB Output is correct
87 Correct 38 ms 25080 KB Output is correct
88 Correct 40 ms 25044 KB Output is correct
89 Correct 39 ms 25080 KB Output is correct
90 Correct 38 ms 25132 KB Output is correct