oj.uz

답안 #442039

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
442039 2021-07-06T20:14:24 Z aryan12 Dango Maker (JOI18_dango_maker) C++17
33 / 100
 670 ms 42900 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

const int N = 3e3 + 5;
int n, m, diagonals;
char a[N][N];
int dp[N][3];
bool canTake[N][N][3];

/*
1 -> up to down
2 -> left to right
*/

bool up(int i, int j) {
    if(i <= 1 || i >= n) {
        return false;
    }
    if(a[i - 1][j] != 'R' || a[i][j] != 'G' || a[i + 1][j] != 'W') {
        return false;
    }
    return true;
}

bool left(int i, int j) {
    if(j <= 1 || j >= m) {
        return false;
    }
    if(a[i][j - 1] != 'R' || a[i][j] != 'G' || a[i][j + 1] != 'W') {
        return false;
    }
    return true;
}

int Recur(int row, int prev) {
    //cout << "Recur(" << row << ", " << prev << ")\n";
    if(row > n) {
        //cout << "Row already exceeded\n";
        return 0;
    }
    if(dp[row][prev] != -1) {
        //cout << "Dp already initialized = " << dp[row][prev] << "\n";
        return dp[row][prev];
    }
    int col = diagonals - row;
    int ans = Recur(row + 1, 0); //not choosing anything here :sadge:
    if(prev == 0) {
        //can choose both
        if(canTake[row][col][1]) {
            ans = max(ans, Recur(row + 1, 1) + 1);
        }
        if(canTake[row][col][2]) {
            ans = max(ans, Recur(row + 1, 2) + 1);
        }
    }
    else if(prev == 1) {
        //can't choose left to right
        if(canTake[row][col][1]) {
            ans = max(ans, Recur(row + 1, 1) + 1);
        }
    }
    else {
        //can't choose up to down
        if(canTake[row][col][2]) {
            ans = max(ans, Recur(row + 1, 2) + 1);
        }
    }
    return dp[row][prev] = ans;
}

void Solve() {
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            cin >> a[i][j];
        }
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            canTake[i][j][0] = true;
            canTake[i][j][1] = up(i, j);
            canTake[i][j][2] = left(i, j);
        }
    }
    int ans = 0;
    for(diagonals = 2; diagonals <= n + m; diagonals++) {
        for(int i = 0; i < N; i++) {
            for(int j = 0; j < 3; j++) {
                dp[i][j] = -1;
            }
        }
        ans += Recur(1, 0); //row, previous taken...if any
        /*for(int i = 1; i <= n; i++) {
            for(int j = 0; j < 3; j++) {
                cout << dp[i][j] << " ";
            }
            cout << "\n";
        }*/
    }
    cout << ans << "\n";
}

int32_t main() {
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 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 320 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 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 324 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 1 ms 320 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 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 320 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 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 324 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 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 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 452 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 1 ms 444 KB Output is correct
34 Correct 1 ms 460 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 1 ms 460 KB Output is correct
38 Correct 1 ms 460 KB Output is correct
39 Correct 1 ms 460 KB Output is correct
40 Correct 1 ms 460 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 1 ms 460 KB Output is correct
43 Correct 1 ms 460 KB Output is correct
44 Correct 1 ms 460 KB Output is correct
45 Correct 1 ms 460 KB Output is correct
46 Correct 1 ms 460 KB Output is correct
47 Correct 1 ms 460 KB Output is correct
48 Correct 1 ms 460 KB Output is correct
49 Correct 1 ms 448 KB Output is correct
50 Correct 1 ms 460 KB Output is correct
51 Correct 1 ms 452 KB Output is correct
52 Correct 1 ms 460 KB Output is correct
53 Correct 1 ms 460 KB Output is correct

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 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 320 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 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 324 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 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 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 452 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 1 ms 444 KB Output is correct
34 Correct 1 ms 460 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 1 ms 460 KB Output is correct
38 Correct 1 ms 460 KB Output is correct
39 Correct 1 ms 460 KB Output is correct
40 Correct 1 ms 460 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 1 ms 460 KB Output is correct
43 Correct 1 ms 460 KB Output is correct
44 Correct 1 ms 460 KB Output is correct
45 Correct 1 ms 460 KB Output is correct
46 Correct 1 ms 460 KB Output is correct
47 Correct 1 ms 460 KB Output is correct
48 Correct 1 ms 460 KB Output is correct
49 Correct 1 ms 448 KB Output is correct
50 Correct 1 ms 460 KB Output is correct
51 Correct 1 ms 452 KB Output is correct
52 Correct 1 ms 460 KB Output is correct
53 Correct 1 ms 460 KB Output is correct
54 Correct 13 ms 332 KB Output is correct
55 Correct 173 ms 21572 KB Output is correct
56 Correct 15 ms 492 KB Output is correct
57 Correct 81 ms 14412 KB Output is correct
58 Correct 67 ms 11284 KB Output is correct
59 Incorrect 670 ms 42900 KB Output isn't correct
60 Halted 0 ms 0 KB -