oj.uz

Submission #703400

# Submission time Handle Problem Language Result Execution time Memory
703400 2023-02-27T09:02:07 Z 1075508020060209tc Dango Maker (JOI18_dango_maker) C++14
13 / 100
 1 ms 324 KB 
#include<bits/stdc++.h>
using namespace std;
 
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n,m;cin>>n>>m;
    vector<string> v(n+2);
    for(int i=1;i<=n;i++){
        cin>>v[i];
        v[i]=" "+v[i]+" ";
    }
    v[0]=string(m+2,' ');
    v[n+1]=string(m+2,' ');
    vector<vector<int>> dp1(n+2,vector<int>(m+2)),dp2(n+2,vector<int>(m+2));
    vector<int> dp(n+m+10);
    for(int i=n;i>=1;i--){
        for(int j=m;j>=1;j--){
            dp1[i][j]=max(dp1[i+1][j-1],dp2[i+1][j-1]);
            dp2[i][j]=dp1[i][j];
            if(v[i][j]=='G'){
                if(v[i-1][j]=='R'&&v[i+1][j]=='W'){
                    dp1[i][j]=max(dp1[i][j],dp1[i+1][j-1]+1);
                }
                if(v[i][j-1]=='R'&&v[i][j+1]=='W'){
                    dp2[i][j]=max(dp2[i][j],dp2[i+1][j]+1);
                }
            }
            dp[i+j]=max({dp[i+j],dp1[i][j],dp2[i][j]});
        }
    }
    int ans=0;
    for(int j:dp){
        ans+=j;
    }
    cout<<ans<<endl;
 
    return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Incorrect 1 ms 212 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Incorrect 1 ms 212 KB Output isn't correct
18 Halted 0 ms 0 KB -