oj.uz

Submission #332104

# Submission time Handle Problem Language Result Execution time Memory
332104 2020-12-01T13:18:54 Z soroush Dango Maker (JOI18_dango_maker) C++14
100 / 100
 231 ms 19200 KB 
///*
//#pragma GCC optimize("O2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx,avx2,sse,sse2,fma")
//*/
#include <bits/stdc++.h>

using namespace std;

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

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn  = 3020;
const ll mod =1e9+7;
const ld PI = acos((ld)-1);

#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define migmig ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int n , m;
string s[maxn];

int dp[maxn][3];

inline int solve(int i , int j){
	dp[j][0] = dp[j][1] = dp[j][2] = 0;
	int ans = 0;
	while(i > -1 and j < m){
		dp[j+1][0] = dp[j + 1][1] = dp[j+1][2] = 0;
		if(s[i][j] == 'G' and j > 0 and s[i][j - 1] == 'R' and j + 1 < m and s[i][j+1]=='W')
			dp[j][1]++;
		if(s[i][j] == 'G' and i > 0 and s[i-1][j] == 'R' and i + 1 < n and s[i+1][j]=='W')
			dp[j][2]++;
		ans = max({ans , dp[j][0] , dp[j][1] , dp[j][2]});
		dp[j+1][0] = max({dp[j][0] , dp[j][1] , dp[j][2]});
		dp[j+1][1] = max({dp[j][0] , dp[j][1]});
		dp[j+1][2] = max({dp[j][0] , dp[j][2]});
		i-- , j++;
	}
	return(ans);
}

int32_t main(){
    migmig;
	cin >> n >> m;
	for(int i = 0 ; i < n ; i ++)
		cin >> s[i];
	int ans = 0;
	for(int i = 0 ; i < m ; i ++)
		ans += solve(n-1 , i);
	for(int i = 0 ; i < n-1 ; i ++)
		ans += solve(i , 0);
	cout << ans;
    return(0);
}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 620 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 620 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 1 ms 492 KB Output is correct
37 Correct 1 ms 492 KB Output is correct
38 Correct 1 ms 492 KB Output is correct
39 Correct 1 ms 492 KB Output is correct
40 Correct 1 ms 492 KB Output is correct
41 Correct 1 ms 492 KB Output is correct
42 Correct 1 ms 492 KB Output is correct
43 Correct 1 ms 492 KB Output is correct
44 Correct 1 ms 492 KB Output is correct
45 Correct 1 ms 492 KB Output is correct
46 Correct 1 ms 492 KB Output is correct
47 Correct 1 ms 492 KB Output is correct
48 Correct 1 ms 492 KB Output is correct
49 Correct 1 ms 492 KB Output is correct
50 Correct 1 ms 512 KB Output is correct
51 Correct 1 ms 492 KB Output is correct
52 Correct 1 ms 492 KB Output is correct
53 Correct 1 ms 492 KB Output is correct
54 Correct 1 ms 492 KB Output is correct
55 Correct 1 ms 492 KB Output is correct
56 Correct 1 ms 492 KB Output is correct
57 Correct 1 ms 492 KB Output is correct
58 Correct 19 ms 2540 KB Output is correct
59 Correct 212 ms 19052 KB Output is correct
60 Correct 208 ms 19052 KB Output is correct
61 Correct 231 ms 19200 KB Output is correct
62 Correct 1 ms 492 KB Output is correct
63 Correct 193 ms 18284 KB Output is correct
64 Correct 140 ms 18924 KB Output is correct
65 Correct 140 ms 18924 KB Output is correct
66 Correct 130 ms 18924 KB Output is correct
67 Correct 138 ms 19052 KB Output is correct
68 Correct 152 ms 18924 KB Output is correct
69 Correct 154 ms 19052 KB Output is correct
70 Correct 10 ms 2540 KB Output is correct
71 Correct 11 ms 2668 KB Output is correct
72 Correct 11 ms 2540 KB Output is correct
73 Correct 11 ms 2540 KB Output is correct
74 Correct 13 ms 2540 KB Output is correct
75 Correct 15 ms 2668 KB Output is correct
76 Correct 10 ms 2540 KB Output is correct
77 Correct 11 ms 2540 KB Output is correct
78 Correct 11 ms 2540 KB Output is correct
79 Correct 11 ms 2540 KB Output is correct
80 Correct 11 ms 2540 KB Output is correct
81 Correct 11 ms 2668 KB Output is correct
82 Correct 10 ms 2540 KB Output is correct
83 Correct 11 ms 2540 KB Output is correct
84 Correct 11 ms 2540 KB Output is correct
85 Correct 10 ms 2540 KB Output is correct
86 Correct 11 ms 2540 KB Output is correct
87 Correct 10 ms 2560 KB Output is correct
88 Correct 11 ms 2540 KB Output is correct
89 Correct 10 ms 2540 KB Output is correct
90 Correct 10 ms 2540 KB Output is correct