Submission #64257

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
64257	2018-08-03 17:46:04	keko37	Dango Maker (JOI18_dango_maker)	C++14	100 / 100	1746 ms	254756 KiB

dango_maker

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<iostream>
#include<cstring>
using namespace std;
const int MAXN = 3005;
int n, m, a, b, sol;
char l[MAXN] [MAXN];
int dp[MAXN] [MAXN] [4];
bool ok (int x, int y, int d) {
  if (d == 0) {
    return l[x] [y] == 'R' && l[x+1] [y] == 'G' && l[x+2] [y] == 'W';
  } else {
    return l[x] [y] == 'R' && l[x] [y+1] == 'G' && l[x] [y+2] == 'W';
  }
}
int f (int x, int y, int mask) {
  if (l[x] [y] != 'R' || x < 0) return 0;
  if (dp[x] [y] [mask] != -1) return dp[x] [y] [mask];
  int res = 0;
  res = max(res, f(x-1, y+1, (2*mask)%4));
  res = max(res, f(x-2, y+2, 0));
  if (ok(x, y, 0) && mask == 0) {
    res = max(res, 1+f(x-1, y+1, 0));
    res = max(res, 1+f(x-2, y+2, 0));
  }
  if (ok(x, y, 1)) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 13 / 13
• Subtask 2: 20 / 20
• Subtask 3: 67 / 67