oj.uz

Submission #1066144

# Submission time Handle Problem Language Result Execution time Memory
1066144 2024-08-19T15:22:59 Z Malix Dango Maker (JOI18_dango_maker) C++14
100 / 100
 1016 ms 18544 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
 
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

int main() {   
    int n,m;cin>>n>>m;
    vector<vector<char>> a(n,vector<char>(m));
    REP(i,0,n)REP(j,0,m)cin>>a[i][j];
    int ans=0;
    REP(j,0,n+m){
        vii dp(n+1,vi(3,0));
        REP(i,0,n){
            int pos=j-i;
            dp[i+1][0]=max({dp[i][0],dp[i][1],dp[i][2]});
            if(pos<0||pos>=m||a[i][pos]!='G')continue;
            if(pos-1>=0&&pos+1<m&&a[i][pos-1]=='R'&&a[i][pos+1]=='W')dp[i+1][1]=max(dp[i][0],dp[i][1])+1;
            if(i-1>=0&&i+1<n&&a[i-1][pos]=='R'&&a[i+1][pos]=='W')dp[i+1][2]=max(dp[i][0],dp[i][2])+1;
        }
        int mx=0;
        REP(i,0,n+1)mx=max(mx,max({dp[i][0],dp[i][1],dp[i][2]}));
        ans+=mx;
    }
    cout<<ans;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 269 ms 604 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 119 ms 644 KB Output is correct
58 Correct 98 ms 2456 KB Output is correct
59 Correct 943 ms 18284 KB Output is correct
60 Correct 949 ms 18280 KB Output is correct
61 Correct 1016 ms 18320 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 930 ms 17692 KB Output is correct
64 Correct 931 ms 18280 KB Output is correct
65 Correct 923 ms 18280 KB Output is correct
66 Correct 937 ms 18544 KB Output is correct
67 Correct 904 ms 18284 KB Output is correct
68 Correct 915 ms 18460 KB Output is correct
69 Correct 897 ms 18524 KB Output is correct
70 Correct 89 ms 2396 KB Output is correct
71 Correct 89 ms 2312 KB Output is correct
72 Correct 88 ms 2384 KB Output is correct
73 Correct 91 ms 2388 KB Output is correct
74 Correct 96 ms 2384 KB Output is correct
75 Correct 95 ms 2384 KB Output is correct
76 Correct 89 ms 2388 KB Output is correct
77 Correct 89 ms 2388 KB Output is correct
78 Correct 88 ms 2392 KB Output is correct
79 Correct 89 ms 2388 KB Output is correct
80 Correct 87 ms 2384 KB Output is correct
81 Correct 89 ms 2388 KB Output is correct
82 Correct 87 ms 2384 KB Output is correct
83 Correct 93 ms 2644 KB Output is correct
84 Correct 87 ms 2388 KB Output is correct
85 Correct 90 ms 2392 KB Output is correct
86 Correct 89 ms 2388 KB Output is correct
87 Correct 88 ms 2396 KB Output is correct
88 Correct 87 ms 2396 KB Output is correct
89 Correct 88 ms 2396 KB Output is correct
90 Correct 101 ms 2396 KB Output is correct