oj.uz

Submission #305260

# Submission time Handle Problem Language Result Execution time Memory
305260 2020-09-22T19:49:10 Z shivensinha4 Dango Maker (JOI18_dango_maker) C++17
100 / 100
 464 ms 71288 KB 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h> 
using namespace std; 
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
//#define endl '\n'


int main() {
	#ifdef shiven
	freopen("test.in", "r", stdin);
	#endif
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n, m; cin >> n >> m;
	vector<vi> mat(n, vi(m));
	for_(i, 0, n) for_(j, 0, m) {
		char c; cin >> c;
		if (c == 'R') mat[i][j] = 0;
		else if (c == 'G') mat[i][j] = 1;
		else mat[i][j] = 2;
	}
	
	//cout << "done" << endl;
	
	vector<vi> dir(n, vi(m)); // 0 -> nothing, 1 -> vertical possible, 2 -> horizontal possible
	for_(i, 0, n) for_(j, 0, m) if (mat[i][j] == 0) {
		if (i < n-2 and mat[i+1][j] == 1 and mat[i+2][j] == 2) dir[i][j] += 1;
		if (j < m-2 and mat[i][j+1] == 1 and mat[i][j+2] == 2) dir[i][j] += 2;
	}
	
	ll ans = 0;
	for_(i, 0, n) for_(j, 0, m) {
		if (i > 0 and j != m-1) {
			j = m-2;
			continue;
		}
		vi prev(3), curr(3);
		for (int r = min(i+j, n-1); r >= i; r--) {
			int c = i+j-r;
			int hor = !!(dir[r][c]&2), ver = dir[r][c]&1;
			assert(c >= 0);
			
			curr[0] = prev[0] + hor;
			if (ver) curr[0] = max(curr[0], prev[1] + 1);
			
			curr[1] = prev[2];
			if (ver) curr[1] = max(curr[1], prev[1] + 1);
			
			curr[2] = prev[0];
			if (ver) curr[2] = max(curr[2], prev[1] + 1);
			
			//for_(k, 0, 3) curr[i] += prev[i];
			//for (int k: curr) cout << k << " ";
			//cout << endl;
			swap(curr, prev);
		}
		
		ans += prev[0];
		//cout << "got value " << prev[0] << " for the diagonal ending on " << i << " " << j << endl;
		//assert(curr[0] == *max_element(curr.begin(), curr.end()));
	}
	
	cout << ans << endl;

	return 0;
}

Compilation message

dango_maker.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
dango_maker.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 0 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 0 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 0 ms 384 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 1 ms 384 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 0 ms 384 KB Output is correct
52 Correct 0 ms 384 KB Output is correct
53 Correct 1 ms 384 KB Output is correct
54 Correct 1 ms 384 KB Output is correct
55 Correct 1 ms 640 KB Output is correct
56 Correct 1 ms 512 KB Output is correct
57 Correct 2 ms 640 KB Output is correct
58 Correct 40 ms 8192 KB Output is correct
59 Correct 410 ms 71032 KB Output is correct
60 Correct 411 ms 71032 KB Output is correct
61 Correct 422 ms 71288 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 464 ms 68740 KB Output is correct
64 Correct 351 ms 71032 KB Output is correct
65 Correct 367 ms 71032 KB Output is correct
66 Correct 324 ms 71032 KB Output is correct
67 Correct 315 ms 71036 KB Output is correct
68 Correct 316 ms 71032 KB Output is correct
69 Correct 326 ms 71032 KB Output is correct
70 Correct 30 ms 8192 KB Output is correct
71 Correct 30 ms 8184 KB Output is correct
72 Correct 32 ms 8320 KB Output is correct
73 Correct 30 ms 8192 KB Output is correct
74 Correct 30 ms 8192 KB Output is correct
75 Correct 30 ms 8192 KB Output is correct
76 Correct 30 ms 8320 KB Output is correct
77 Correct 31 ms 8184 KB Output is correct
78 Correct 30 ms 8184 KB Output is correct
79 Correct 30 ms 8184 KB Output is correct
80 Correct 29 ms 8184 KB Output is correct
81 Correct 31 ms 8184 KB Output is correct
82 Correct 30 ms 8184 KB Output is correct
83 Correct 31 ms 8184 KB Output is correct
84 Correct 32 ms 8184 KB Output is correct
85 Correct 30 ms 8192 KB Output is correct
86 Correct 30 ms 8184 KB Output is correct
87 Correct 31 ms 8192 KB Output is correct
88 Correct 30 ms 8312 KB Output is correct
89 Correct 30 ms 8192 KB Output is correct
90 Correct 32 ms 8188 KB Output is correct