oj.uz

답안 #442783

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
442783 2021-07-09T04:12:00 Z Fidisk Dango Maker (JOI18_dango_maker) C++14
100 / 100
 345 ms 150852 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define oo 1e9
#define fi first
#define se second
#define sp(iiii) setprecision(iiii)
#define IO ios_base::sync_with_stdio(false); cin.tie(0)
#define ms(aaaa,xxxx) memset(aaaa,xxxx,sizeof(aaaa))
#define cntbit(xxxx) __builtin_popcount(xxxx)
#define getbit(xxxx,aaaa) (((xxxx)>>(aaaa-1))&1)
 
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int> piii;
typedef pair<pair<int,int>,pair<int,int>> piiii;
typedef pair<long long,long long> pll;
typedef pair<pair<long long,long long>,long long> plll;
typedef pair<pair<long long,long long>,pair<long long,long long>> pllll;
typedef pair<pair<long long,long long>,bool> pllb;
typedef pair<long double,long double> pld;
typedef pair<pair<long double,long double>,long double> plld;
 
const ll base=2e9+4257;
//const ll mod=1e9+7;
const ll mod2=1e9+4233;
const ld eps=1e-12;
const ll maxn=1e16;
const ld pi=acos(-1);
const ll delta=1e5+7;
const int dx[4]={1,-1,0,0};
const int dy[4]={0,0,1,-1};
 
char a[3009][3009];
int f[3009][3009][4],i,j,n,m,ans;
 
bool check(int x,int y) {
    return ((a[x][y]=='G')&&(a[x-1][y]=='R')&&(a[x+1][y]=='W'));
}
 
bool check2(int x,int y) {
    return ((a[x][y]=='G')&&(a[x][y-1]=='R')&&(a[x][y+1]=='W'));
}
 
int main(){
    IO;
    cin>>n>>m;
    for (i=1;i<=n;i++) {
        for (j=1;j<=m;j++) {
            cin>>a[i][j];
        }
    }
    for (i=1;i<=n;i++) {
        for (j=1;j<=m;j++) {
            f[i][j][0]=max(f[i][j][0],f[i-1][j+1][0]);
            f[i][j][0]=max(f[i][j][0],f[i-1][j+1][1]);
            f[i][j][0]=max(f[i][j][0],f[i-1][j+1][2]);
            if (check(i,j)) {
                f[i][j][1]=max(f[i-1][j+1][0],f[i-1][j+1][1])+1;
            }
            if (check2(i,j)) {
                f[i][j][2]=max(f[i-1][j+1][0],f[i-1][j+1][2])+1;
            }
        }
    }
    for (i=1;i<=n;i++) {
        ans+=max({f[i][1][0],f[i][1][1],f[i][1][2]});
    }
    for (i=2;i<=m;i++) {
        ans+=max({f[n][i][0],f[n][i][1],f[n][i][2]});
    }
    cout<<ans<<'\n';
}

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 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 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 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 292 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 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 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 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 292 KB Output is correct
17 Correct 1 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 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 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 0 ms 332 KB Output is correct
41 Correct 0 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 0 ms 332 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 0 ms 332 KB Output is correct
50 Correct 0 ms 332 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 332 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 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 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 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 292 KB Output is correct
17 Correct 1 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 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 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 0 ms 332 KB Output is correct
41 Correct 0 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 0 ms 332 KB Output is correct
48 Correct 0 ms 332 KB Output is correct
49 Correct 0 ms 332 KB Output is correct
50 Correct 0 ms 332 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 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 13 ms 21348 KB Output is correct
56 Correct 1 ms 460 KB Output is correct
57 Correct 9 ms 14540 KB Output is correct
58 Correct 40 ms 22932 KB Output is correct
59 Correct 319 ms 150764 KB Output is correct
60 Correct 317 ms 150836 KB Output is correct
61 Correct 345 ms 150848 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 310 ms 150788 KB Output is correct
64 Correct 269 ms 150744 KB Output is correct
65 Correct 271 ms 150820 KB Output is correct
66 Correct 266 ms 150736 KB Output is correct
67 Correct 295 ms 150852 KB Output is correct
68 Correct 265 ms 150848 KB Output is correct
69 Correct 273 ms 150724 KB Output is correct
70 Correct 35 ms 23152 KB Output is correct
71 Correct 34 ms 23140 KB Output is correct
72 Correct 35 ms 23244 KB Output is correct
73 Correct 34 ms 23108 KB Output is correct
74 Correct 35 ms 23116 KB Output is correct
75 Correct 35 ms 23108 KB Output is correct
76 Correct 34 ms 23152 KB Output is correct
77 Correct 35 ms 23232 KB Output is correct
78 Correct 36 ms 23136 KB Output is correct
79 Correct 37 ms 23116 KB Output is correct
80 Correct 35 ms 23108 KB Output is correct
81 Correct 34 ms 23180 KB Output is correct
82 Correct 35 ms 23168 KB Output is correct
83 Correct 35 ms 23140 KB Output is correct
84 Correct 35 ms 23124 KB Output is correct
85 Correct 34 ms 23096 KB Output is correct
86 Correct 34 ms 23108 KB Output is correct
87 Correct 34 ms 23216 KB Output is correct
88 Correct 35 ms 23224 KB Output is correct
89 Correct 34 ms 23220 KB Output is correct
90 Correct 35 ms 23160 KB Output is correct