oj.uz

Submission #939710

# Submission time Handle Problem Language Result Execution time Memory
939710 2024-03-06T16:52:38 Z mansur Dango Maker (JOI18_dango_maker) C++17
100 / 100
 218 ms 87948 KB 
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#include<bits/stdc++.h>	

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()                 
#define sz(a) (int)a.size()
#define s second
#define f first
 
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
     
vector<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
vector<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
 
const int N = 1e6 + 1, mod = 1e9 + 7;

const ll inf = 1e18;
 
double eps = 1e-15;
                                                
bool flg = 0;

void slv() {
	int n, m;
	cin >> n >> m;
	char c[n + 1][m + 1];
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> c[i][j];
		}
	}
	int dp[n + 1][m + 1][2], mx[n + m + 1];
	memset(dp, 0, sizeof(dp));
	memset(mx, 0, sizeof(mx));
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			int v = max(dp[i][j][0], dp[i][j][1]);
			mx[i + j] = max(mx[i + j], v);
			if (i < n && j > 1) {
				dp[i + 1][j - 1][0] = max(dp[i + 1][j - 1][0], dp[i][j][0]);
				dp[i + 1][j - 1][1] = max(dp[i + 1][j - 1][1], dp[i][j][1]);
			}
			if (j + 2 <= m && c[i][j] == 'R' && c[i][j + 1] == 'G' && c[i][j + 2] == 'W') {
				if (i < n && j > 1) {
					dp[i + 1][j - 1][0] = max(dp[i + 1][j - 1][0], dp[i][j][0] + 1);
					dp[i + 1][j - 1][1] = max(dp[i + 1][j - 1][1], dp[i][j][0] + 1);
				}
				mx[i + j] = max(mx[i + j], dp[i][j][0] + 1);
			}
			if (i + 2 <= n && c[i][j] == 'R' && c[i + 1][j] == 'G' && c[i + 2][j] == 'W') {
				if (j > 3 && i + 3 <= n) 
					dp[i + 3][j - 3][0] = max(dp[i + 3][j - 3][0], dp[i][j][1] + 1);
				if (i < n && j > 1)
					dp[i + 1][j - 1][1] = max(dp[i + 1][j - 1][1], dp[i][j][1] + 1);
				mx[i + j] = max(mx[i + j], dp[i][j][1] + 1);
			}
		}
	}
	int ans = 0;
	for (int i = 1; i <= n + m; i++) {
	    //cout << mx[i] << ' ';
		ans += mx[i];
	}
	cout << ans;
}                                                                           
 
main() {
	//freopen("rsq.in", "r", stdin);                                                                                     
	//freopen("rsq.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(0);	                                                                                       
	cin.tie(0);
	int tp = 1;
	if (flg) cin >> tp;
	while (tp--) {
		//cout << "Case #" << cur++ << ": ";
		slv();
	}
}
//wenomechainsama

Compilation message

dango_maker.cpp:75:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   75 | main() {
      | ^~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 416 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 464 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 456 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 600 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 544 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 1 ms 604 KB Output is correct
55 Correct 0 ms 464 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 21 ms 10076 KB Output is correct
59 Correct 195 ms 87904 KB Output is correct
60 Correct 218 ms 87948 KB Output is correct
61 Correct 196 ms 87836 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 186 ms 84980 KB Output is correct
64 Correct 154 ms 87892 KB Output is correct
65 Correct 157 ms 87888 KB Output is correct
66 Correct 152 ms 87708 KB Output is correct
67 Correct 149 ms 87908 KB Output is correct
68 Correct 152 ms 87780 KB Output is correct
69 Correct 158 ms 87776 KB Output is correct
70 Correct 17 ms 10000 KB Output is correct
71 Correct 17 ms 10068 KB Output is correct
72 Correct 17 ms 10068 KB Output is correct
73 Correct 18 ms 10072 KB Output is correct
74 Correct 17 ms 10076 KB Output is correct
75 Correct 19 ms 10076 KB Output is correct
76 Correct 18 ms 10076 KB Output is correct
77 Correct 17 ms 10264 KB Output is correct
78 Correct 17 ms 10076 KB Output is correct
79 Correct 17 ms 10076 KB Output is correct
80 Correct 17 ms 10248 KB Output is correct
81 Correct 17 ms 10188 KB Output is correct
82 Correct 17 ms 10120 KB Output is correct
83 Correct 17 ms 10076 KB Output is correct
84 Correct 17 ms 10076 KB Output is correct
85 Correct 23 ms 10256 KB Output is correct
86 Correct 17 ms 10076 KB Output is correct
87 Correct 17 ms 10072 KB Output is correct
88 Correct 17 ms 10252 KB Output is correct
89 Correct 17 ms 10076 KB Output is correct
90 Correct 17 ms 10120 KB Output is correct