oj.uz

답안 #362388

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362388 2021-02-02T21:03:26 Z ritul_kr_singh Dango Maker (JOI18_dango_maker) C++17
0 / 100
 1 ms 640 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m, dp[3001][3001]={};
string g[3000];

bool valid(int i, int j, bool vertical){
    --i; --j;
    if(i<0 || j<0) return false;
    if(vertical){
        if(i<2) return false;
        if(g[i-2][j]=='R' && g[i-1][j]=='G' && g[i][j]=='W') return true;
        if(g[i-2][j]=='W' && g[i-1][j]=='G' && g[i][j]=='R') return true;
    }
    else{
        if(j<2) return false;
        if(g[i][j-2]=='R' && g[i][j-1]=='G' && g[i][j]=='W') return true;
        if(g[i][j-2]=='W' && g[i][j-1]=='G' && g[i][j]=='R') return true;
    }
    return false;
}

signed main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> n >> m;
    for(int i=0; i<n; ++i) cin >> g[i];
    for(int i=1; i<=n; ++i){
        for(int j=1; j<=m; ++j){
            dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
            int sub = (valid(i-2, j, false) && valid(i, j-2, true));
            dp[i][j] = max(dp[i][j], dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1]-sub);
            if(valid(i, j, true)){
                sub = (valid(i-1, j-2, true) && valid(i-3, j, false));
                sub += (valid(i-2, j-2, true) && valid(i-4, j, false));
                dp[i][j] = max(dp[i][j], dp[i-3][j]+dp[i][j-1]-dp[i-3][j-1]+1-sub);
            }
            if(valid(i, j, false)){
                sub = (valid(i-2, j-1, false) && valid(i, j-3, true));
                sub += (valid(i-2, j-2, false) && valid(i, j-4, true));
                dp[i][j] = max(dp[i][j], dp[i][j-3]+dp[i-1][j]-dp[i-1][j-3]+1-sub);
            }
        }
    }
    cout << dp[n][m];
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Incorrect 1 ms 492 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Incorrect 1 ms 492 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Incorrect 1 ms 492 KB Output isn't correct
14 Halted 0 ms 0 KB -