oj.uz

Submission #59559

# Submission time Handle Problem Language Result Execution time Memory
59559 2018-07-22T10:21:22 Z zadrga Dango Maker (JOI18_dango_maker) C++14
100 / 100
 1202 ms 123924 KB 
/*
Idea:
- http://codeforces.com/blog/entry/57637?#comment-413356 (Problem 3)
*/

#include <bits/stdc++.h>
 
using namespace std;
 
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (1 << 30)
#define MOD (1000 * 1000 * 1000 + 7)
#define maxn 3111

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;

char str[maxn][maxn];
int dp[maxn][maxn][3];
int n, m;

bool can(int x, int y, char c){
	if(x < 1 || x > n || y < 1 || y > m)
		return 0;

	return (str[x][y] == c);
}

int fun(int x, int y, int t){ 		// 0 - nothing, 1 - horizontal, 2 - vertical
	if(x < 1 || x > n || y < 1 || y > m)
		return 0;

	int &cur = dp[x][y][t];
	if(cur != -1)
		return cur;

	int add = 0;
	if(t == 1 && can(x, y - 1, 'R') && can(x, y, 'G') && can(x, y + 1, 'W'))
		add = 1;

	if(t == 2 && can(x - 1, y, 'R') && can(x, y, 'G') && can(x + 1, y, 'W'))
		add = 1;

	if(t != 0 && add == 0)
		return 0;
	
	cur = 0;
	for(int i = 0; i < 3; i++){
		if(t + i == 3)
			continue;

		cur = max(cur, fun(x - 1, y + 1, i) + add);
	} 
	return cur;
}

int main(){
	scanf("%d%d", &n, &m);
	memset(dp, -1, sizeof(dp));

	for(int i = 1; i <= n; i++)
		scanf("%s", str[i] + 1);

	int ans = 0;
	for(int i = 1; i <= n; i++)
		ans += max(fun(i, 1, 0), max(fun(i, 1, 1), fun(i, 1, 2)));

	for(int i = 2; i <= m; i++)
		ans += max(fun(n, i, 0), max(fun(n, i, 1), fun(n, i, 2)));

	printf("%d\n", ans);
	return 0;
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:62:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
dango_maker.cpp:66:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", str[i] + 1);
   ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 113912 KB Output is correct
2 Correct 85 ms 114020 KB Output is correct
3 Correct 88 ms 114224 KB Output is correct
4 Correct 89 ms 114224 KB Output is correct
5 Correct 86 ms 114224 KB Output is correct
6 Correct 90 ms 114224 KB Output is correct
7 Correct 87 ms 114224 KB Output is correct
8 Correct 83 ms 114224 KB Output is correct
9 Correct 85 ms 114224 KB Output is correct
10 Correct 89 ms 114264 KB Output is correct
11 Correct 85 ms 114264 KB Output is correct
12 Correct 96 ms 114268 KB Output is correct
13 Correct 98 ms 114268 KB Output is correct
14 Correct 96 ms 114268 KB Output is correct
15 Correct 93 ms 114428 KB Output is correct
16 Correct 97 ms 114428 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 113912 KB Output is correct
2 Correct 85 ms 114020 KB Output is correct
3 Correct 88 ms 114224 KB Output is correct
4 Correct 89 ms 114224 KB Output is correct
5 Correct 86 ms 114224 KB Output is correct
6 Correct 90 ms 114224 KB Output is correct
7 Correct 87 ms 114224 KB Output is correct
8 Correct 83 ms 114224 KB Output is correct
9 Correct 85 ms 114224 KB Output is correct
10 Correct 89 ms 114264 KB Output is correct
11 Correct 85 ms 114264 KB Output is correct
12 Correct 96 ms 114268 KB Output is correct
13 Correct 98 ms 114268 KB Output is correct
14 Correct 96 ms 114268 KB Output is correct
15 Correct 93 ms 114428 KB Output is correct
16 Correct 97 ms 114428 KB Output is correct
17 Correct 90 ms 114428 KB Output is correct
18 Correct 101 ms 114428 KB Output is correct
19 Correct 89 ms 114428 KB Output is correct
20 Correct 87 ms 114428 KB Output is correct
21 Correct 89 ms 114428 KB Output is correct
22 Correct 105 ms 114428 KB Output is correct
23 Correct 104 ms 114428 KB Output is correct
24 Correct 96 ms 114428 KB Output is correct
25 Correct 96 ms 114428 KB Output is correct
26 Correct 104 ms 114428 KB Output is correct
27 Correct 99 ms 114428 KB Output is correct
28 Correct 97 ms 114428 KB Output is correct
29 Correct 102 ms 114428 KB Output is correct
30 Correct 109 ms 114428 KB Output is correct
31 Correct 101 ms 114428 KB Output is correct
32 Correct 97 ms 114428 KB Output is correct
33 Correct 87 ms 114428 KB Output is correct
34 Correct 87 ms 114428 KB Output is correct
35 Correct 96 ms 114428 KB Output is correct
36 Correct 95 ms 114428 KB Output is correct
37 Correct 102 ms 114428 KB Output is correct
38 Correct 98 ms 114428 KB Output is correct
39 Correct 102 ms 114428 KB Output is correct
40 Correct 97 ms 114428 KB Output is correct
41 Correct 97 ms 114428 KB Output is correct
42 Correct 98 ms 114428 KB Output is correct
43 Correct 99 ms 114428 KB Output is correct
44 Correct 95 ms 114428 KB Output is correct
45 Correct 87 ms 114428 KB Output is correct
46 Correct 86 ms 114428 KB Output is correct
47 Correct 87 ms 114428 KB Output is correct
48 Correct 95 ms 114428 KB Output is correct
49 Correct 98 ms 114428 KB Output is correct
50 Correct 86 ms 114428 KB Output is correct
51 Correct 94 ms 114428 KB Output is correct
52 Correct 90 ms 114428 KB Output is correct
53 Correct 100 ms 114428 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 113912 KB Output is correct
2 Correct 85 ms 114020 KB Output is correct
3 Correct 88 ms 114224 KB Output is correct
4 Correct 89 ms 114224 KB Output is correct
5 Correct 86 ms 114224 KB Output is correct
6 Correct 90 ms 114224 KB Output is correct
7 Correct 87 ms 114224 KB Output is correct
8 Correct 83 ms 114224 KB Output is correct
9 Correct 85 ms 114224 KB Output is correct
10 Correct 89 ms 114264 KB Output is correct
11 Correct 85 ms 114264 KB Output is correct
12 Correct 96 ms 114268 KB Output is correct
13 Correct 98 ms 114268 KB Output is correct
14 Correct 96 ms 114268 KB Output is correct
15 Correct 93 ms 114428 KB Output is correct
16 Correct 97 ms 114428 KB Output is correct
17 Correct 90 ms 114428 KB Output is correct
18 Correct 101 ms 114428 KB Output is correct
19 Correct 89 ms 114428 KB Output is correct
20 Correct 87 ms 114428 KB Output is correct
21 Correct 89 ms 114428 KB Output is correct
22 Correct 105 ms 114428 KB Output is correct
23 Correct 104 ms 114428 KB Output is correct
24 Correct 96 ms 114428 KB Output is correct
25 Correct 96 ms 114428 KB Output is correct
26 Correct 104 ms 114428 KB Output is correct
27 Correct 99 ms 114428 KB Output is correct
28 Correct 97 ms 114428 KB Output is correct
29 Correct 102 ms 114428 KB Output is correct
30 Correct 109 ms 114428 KB Output is correct
31 Correct 101 ms 114428 KB Output is correct
32 Correct 97 ms 114428 KB Output is correct
33 Correct 87 ms 114428 KB Output is correct
34 Correct 87 ms 114428 KB Output is correct
35 Correct 96 ms 114428 KB Output is correct
36 Correct 95 ms 114428 KB Output is correct
37 Correct 102 ms 114428 KB Output is correct
38 Correct 98 ms 114428 KB Output is correct
39 Correct 102 ms 114428 KB Output is correct
40 Correct 97 ms 114428 KB Output is correct
41 Correct 97 ms 114428 KB Output is correct
42 Correct 98 ms 114428 KB Output is correct
43 Correct 99 ms 114428 KB Output is correct
44 Correct 95 ms 114428 KB Output is correct
45 Correct 87 ms 114428 KB Output is correct
46 Correct 86 ms 114428 KB Output is correct
47 Correct 87 ms 114428 KB Output is correct
48 Correct 95 ms 114428 KB Output is correct
49 Correct 98 ms 114428 KB Output is correct
50 Correct 86 ms 114428 KB Output is correct
51 Correct 94 ms 114428 KB Output is correct
52 Correct 90 ms 114428 KB Output is correct
53 Correct 100 ms 114428 KB Output is correct
54 Correct 100 ms 114428 KB Output is correct
55 Correct 112 ms 123444 KB Output is correct
56 Correct 106 ms 123444 KB Output is correct
57 Correct 105 ms 123444 KB Output is correct
58 Correct 191 ms 123444 KB Output is correct
59 Correct 1186 ms 123760 KB Output is correct
60 Correct 1080 ms 123760 KB Output is correct
61 Correct 987 ms 123764 KB Output is correct
62 Correct 91 ms 123764 KB Output is correct
63 Correct 1002 ms 123780 KB Output is correct
64 Correct 1196 ms 123924 KB Output is correct
65 Correct 997 ms 123924 KB Output is correct
66 Correct 1202 ms 123924 KB Output is correct
67 Correct 1097 ms 123924 KB Output is correct
68 Correct 1156 ms 123924 KB Output is correct
69 Correct 1053 ms 123924 KB Output is correct
70 Correct 171 ms 123924 KB Output is correct
71 Correct 185 ms 123924 KB Output is correct
72 Correct 175 ms 123924 KB Output is correct
73 Correct 193 ms 123924 KB Output is correct
74 Correct 208 ms 123924 KB Output is correct
75 Correct 204 ms 123924 KB Output is correct
76 Correct 165 ms 123924 KB Output is correct
77 Correct 165 ms 123924 KB Output is correct
78 Correct 161 ms 123924 KB Output is correct
79 Correct 159 ms 123924 KB Output is correct
80 Correct 178 ms 123924 KB Output is correct
81 Correct 219 ms 123924 KB Output is correct
82 Correct 161 ms 123924 KB Output is correct
83 Correct 165 ms 123924 KB Output is correct
84 Correct 193 ms 123924 KB Output is correct
85 Correct 188 ms 123924 KB Output is correct
86 Correct 179 ms 123924 KB Output is correct
87 Correct 158 ms 123924 KB Output is correct
88 Correct 213 ms 123924 KB Output is correct
89 Correct 168 ms 123924 KB Output is correct
90 Correct 176 ms 123924 KB Output is correct