oj.uz

답안 #714175

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
714175 2023-03-24T05:38:46 Z 089487 Dango Maker (JOI18_dango_maker) C++14
100 / 100
 270 ms 18144 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include<bits/stdc++.h>
#define int long long
#define quick ios::sync_with_stdio(0);cin.tie(0);
#define rep(x,a,b) for(int x=a;x<=b;x++)
#define repd(x,a,b) for(int x=a;x>=b;x--)
#define lowbit(x) (x&-x)
#define sz(x) (int)(x.size())
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define mp make_pair
#define eb emplace_back
using namespace std;
typedef pair<int,int> pii;
void debug(){
    cout<<"\n";
}
template <class T,class ... U >
void debug(T a, U ... b){
    cout<<a<<" ",debug(b...);
}
const int N=3e3+7;
const int INF=1e18;
char c[N][N];
int dp[N][3];
signed main(){
	quick

	int n,m;
	cin>>n>>m;
	rep(i,1,n){
		rep(j,1,m) cin>>c[i][j];
	}
	int ans=0;
	rep(l,2,n+m){
		fill(dp[0],dp[N-1]+3,0);
		int ret=0;
		rep(i,1,n){
			rep(x,0,2){
				dp[i][0]=max(dp[i][0],dp[i-1][x]);
			}
			int j=l-i;
			if(j<=0||j>m) continue;
			if(i+1<=n&&i-1>=1&&c[i-1][j]=='R'&&c[i][j]=='G'&&c[i+1][j]=='W'){
				dp[i][1]=max(dp[i-1][0],dp[i-1][1])+1;
			}
			if(j+1<=m&&j-1>=1&&c[i][j-1]=='R'&&c[i][j]=='G'&&c[i][j+1]=='W'){
				dp[i][2]=max(dp[i-1][0],dp[i-1][2])+1;
			}
			ret=max({dp[i][0],dp[i][1],dp[i][2],ret});
		}
		ans+=ret;
	}
	cout<<ans<<"\n";
	return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 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 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 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 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 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 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 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 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 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 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 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 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 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 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 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 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 5 ms 340 KB Output is correct
55 Correct 59 ms 9200 KB Output is correct
56 Correct 7 ms 340 KB Output is correct
57 Correct 29 ms 6228 KB Output is correct
58 Correct 32 ms 3324 KB Output is correct
59 Correct 250 ms 9192 KB Output is correct
60 Correct 264 ms 18144 KB Output is correct
61 Correct 270 ms 18024 KB Output is correct
62 Correct 5 ms 340 KB Output is correct
63 Correct 259 ms 17724 KB Output is correct
64 Correct 225 ms 17916 KB Output is correct
65 Correct 218 ms 18032 KB Output is correct
66 Correct 215 ms 18124 KB Output is correct
67 Correct 218 ms 18028 KB Output is correct
68 Correct 210 ms 17960 KB Output is correct
69 Correct 218 ms 17956 KB Output is correct
70 Correct 27 ms 4236 KB Output is correct
71 Correct 28 ms 4216 KB Output is correct
72 Correct 27 ms 4304 KB Output is correct
73 Correct 27 ms 4188 KB Output is correct
74 Correct 29 ms 4228 KB Output is correct
75 Correct 27 ms 4308 KB Output is correct
76 Correct 29 ms 4300 KB Output is correct
77 Correct 27 ms 4308 KB Output is correct
78 Correct 27 ms 4216 KB Output is correct
79 Correct 27 ms 4308 KB Output is correct
80 Correct 27 ms 4300 KB Output is correct
81 Correct 28 ms 4308 KB Output is correct
82 Correct 28 ms 4316 KB Output is correct
83 Correct 26 ms 4208 KB Output is correct
84 Correct 26 ms 4200 KB Output is correct
85 Correct 28 ms 4300 KB Output is correct
86 Correct 28 ms 4268 KB Output is correct
87 Correct 27 ms 4312 KB Output is correct
88 Correct 30 ms 4184 KB Output is correct
89 Correct 26 ms 4308 KB Output is correct
90 Correct 26 ms 4300 KB Output is correct