oj.uz

답안 #468070

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
468070 2021-08-26T11:37:43 Z jamezzz Dango Maker (JOI18_dango_maker) C++17
100 / 100
 914 ms 115108 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#define dbg(...) printf(__VA_ARGS__);
#else
#define dbg(...)
#endif
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb emplace_back
#define ppb pop_back
#define sz(x) (int)x.size()
#define mnto(x,y) x=min(x,(__typeof__(x))y)
#define mxto(x,y) x=max(x,(__typeof__(x))y)
#define INF 1023456789
#define LINF 1023456789123456789
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vll;
mt19937 rng(time(0));

int n,m,g[3005][3005];
int dp[3005][3005][2];
char c;

int can(int i,int j,int o){
	if(o)return g[i-1][j]==1&&g[i][j]==2&&g[i+1][j]==3;
	else return g[i][j-1]==1&&g[i][j]==2&&g[i][j+1]==3;
}

int main(){
	sf("%d%d",&n,&m);
	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j){
			sf(" %c",&c);
			if(c=='R')g[i][j]=1;
			if(c=='G')g[i][j]=2;
			if(c=='W')g[i][j]=3;
		}
	}
	
	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j){
			dp[i][j][0]=dp[i][j][1]=-INF;
		}
	}
	
	int ans=0;
	for(int i=2;i<=n+m;++i){ //process by diagonal
		int mx=0;
		int X=-1,Y=-1;
		for(int x=max(1,i-m);x<=min(n,i-1);++x){
			int y=i-x;
			for(int a=0;a<2;++a){
				if(can(x,y,a)){
					dp[x][y][a]=max(mx,dp[x-1][y+1][a])+1;
					//put horizontal/vertical, then transition to previous
					//mx is if u dont put
				}
			}
			for(int a=0;a<2;++a){
				mx=max(mx,dp[x-1][y+1][a]);
				//update mx to put horizontal/vertical at previous
			}
			X=x;Y=y;
		}
		for(int a=0;a<2;++a){
			mx=max(mx,dp[X][Y][a]);
		}
		ans+=mx;
	}
	
	printf("%d\n",ans);
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:42:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |  sf("%d%d",&n,&m);
      |    ^
dango_maker.cpp:45:6: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |    sf(" %c",&c);
      |      ^

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 304 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 308 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 0 ms 312 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 304 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 308 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 0 ms 312 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 10 ms 24396 KB Output is correct
56 Correct 2 ms 460 KB Output is correct
57 Correct 8 ms 16576 KB Output is correct
58 Correct 102 ms 21124 KB Output is correct
59 Correct 899 ms 115024 KB Output is correct
60 Correct 898 ms 114980 KB Output is correct
61 Correct 895 ms 114992 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 914 ms 114560 KB Output is correct
64 Correct 873 ms 115108 KB Output is correct
65 Correct 859 ms 114960 KB Output is correct
66 Correct 860 ms 115032 KB Output is correct
67 Correct 790 ms 114904 KB Output is correct
68 Correct 787 ms 114944 KB Output is correct
69 Correct 796 ms 115000 KB Output is correct
70 Correct 95 ms 20932 KB Output is correct
71 Correct 96 ms 20984 KB Output is correct
72 Correct 96 ms 20936 KB Output is correct
73 Correct 95 ms 20932 KB Output is correct
74 Correct 95 ms 20964 KB Output is correct
75 Correct 97 ms 20976 KB Output is correct
76 Correct 95 ms 21020 KB Output is correct
77 Correct 96 ms 20936 KB Output is correct
78 Correct 105 ms 21044 KB Output is correct
79 Correct 96 ms 21028 KB Output is correct
80 Correct 95 ms 20932 KB Output is correct
81 Correct 94 ms 21004 KB Output is correct
82 Correct 96 ms 20956 KB Output is correct
83 Correct 99 ms 20956 KB Output is correct
84 Correct 95 ms 21016 KB Output is correct
85 Correct 99 ms 21068 KB Output is correct
86 Correct 96 ms 20932 KB Output is correct
87 Correct 93 ms 20928 KB Output is correct
88 Correct 96 ms 20956 KB Output is correct
89 Correct 97 ms 21060 KB Output is correct
90 Correct 94 ms 21060 KB Output is correct