oj.uz

Submission #679442

# Submission time Handle Problem Language Result Execution time Memory
679442 2023-01-08T09:43:58 Z anhduc2701 Dango Maker (JOI18_dango_maker) C++17
33 / 100
 17 ms 39316 KB 
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
*/
#include<bits/stdc++.h>
#define int long long
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define eb emplace_back
#define PI 3.14159265359
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define BIT(x,i) (1&((x)>>(i)))
#define MASK(x) (1LL<<(x))
#define task "tnc"  
using namespace std;
typedef long long ll;
const ll INF=1e18;
const int maxn=1e6+5;
const int mod=1e9+7;
const int mo=998244353;
using pi=pair<ll,ll>;
using vi=vector<ll>;
using pii=pair<pair<ll,ll>,ll>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n,m;
char a[3005][3005];
int dp[2][3005][3005];
bool check[2][3005][2005];
int check1(int i,int j){
	return a[i][j-2]=='R' && a[i][j-1]=='G' && a[i][j]=='W';
}
int check2(int i,int j){
	return a[i-2][j]=='R' && a[i-1][j]=='G' && a[i][j]=='W';
}
signed main()
{
	cin.tie(0),cout.tie(0)->sync_with_stdio(0);
    //freopen(task".inp" , "r" , stdin);
    //freopen(task".out" , "w" , stdout);
   	cin>>n>>m;
   	for(int i=1;i<=n;i++){
   		for(int j=1;j<=m;j++){
   			cin>>a[i][j];
   		}
   	} 
   	for(int i=1;i<=n;i++){
   		for(int j=3;j<=m;j++){
   			check[0][i][j]=check1(i,j);
   		}
   	}
   	for(int i=3;i<=n;i++){
   		for(int j=1;j<=m;j++){
   			check[1][i][j]=check2(i,j);
   		}
   	}
   	for(int i=1;i<=n;i++){
   		for(int j=1;j<=m;j++){
   			dp[1][i][j]=dp[1][i-1][j+1]+check[1][i][j];
   			if(i>3)dp[1][i][j]=max(dp[1][i][j],dp[0][i-3][j+3]+check[1][i][j]);
   			dp[0][i][j]=max(dp[1][i][j],dp[0][i-1][j+1]+check[0][i][j]);
   		}
   	}
   	int ans=0;
   	for(int i=1;i<=n;i++){
   		for(int j=1;j<=m;j++){
   			if((j==1|| i==n)){
   				ans+=dp[0][i][j];
   			}
   		}
   	}
   	cout<<ans<<" ";
    return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 0 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 0 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 0 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 0 ms 468 KB Output is correct
37 Correct 0 ms 468 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 0 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 0 ms 468 KB Output is correct
42 Correct 0 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 0 ms 468 KB Output is correct
45 Correct 0 ms 468 KB Output is correct
46 Correct 0 ms 468 KB Output is correct
47 Correct 0 ms 468 KB Output is correct
48 Correct 1 ms 420 KB Output is correct
49 Correct 0 ms 468 KB Output is correct
50 Correct 0 ms 468 KB Output is correct
51 Correct 0 ms 468 KB Output is correct
52 Correct 0 ms 468 KB Output is correct
53 Correct 0 ms 468 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 17 ms 39316 KB Output is correct
56 Incorrect 1 ms 596 KB Output isn't correct
57 Halted 0 ms 0 KB -