oj.uz

답안 #1004921

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1004921 2024-06-22T04:13:15 Z _callmelucian Dango Maker (JOI18_dango_maker) C++14
100 / 100
 163 ms 9104 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pl;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tt;

#define all(a) a.begin(), a.end()
#define filter(a) a.erase(unique(all(a)), a.end())

/*
    - dumplings order: R-G-B
    if   G on the i-th diagonal contributes to a stick
    then R is on the (i-1)-th diagonal
         W is on the (i+1)-th diagonal

    - G's on different diagonals are independent

    - a horizontal and vertical stick on the same
    diagonal can't be placed consecutive.
*/

int dpNot[3003], dpHor[3003], dpVer[3003], n, m;
char a[3003][3003];

bool okHor (int row, int col) {
    if (row - 1 < 1 || row + 1 > n) return 0;
    return a[row - 1][col] == 'R'
        && a[row][col] == 'G'
        && a[row + 1][col] == 'W';
}

bool okVer (int row, int col) {
    if (col - 1 < 1 || col + 1 > m) return 0;
    return a[row][col - 1] == 'R'
        && a[row][col] == 'G'
        && a[row][col + 1] == 'W';
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++) cin >> a[i][j];

    int ans = 0;
    for (int diag = 2; diag <= n + m; diag++) {
        int mn = max(1, diag - m), mx = min(n, diag - 1);
        for (int row = mn - 1; row <= mx; row++)
            dpNot[row] = dpHor[row] = dpVer[row] = 0;

        for (int row = mn; row <= mx; row++) {
            int col = diag - row;
            dpNot[row] = max(dpNot[row - 1], max(dpHor[row - 1], dpVer[row - 1]));
            if (okHor(row, col)) dpHor[row] = max(dpHor[row - 1], dpNot[row - 1]) + 1;
            if (okVer(row, col)) dpVer[row] = max(dpVer[row - 1], dpNot[row - 1]) + 1;
        }

        ans += max(dpNot[mx], max(dpHor[mx], dpVer[mx]));
    }

    cout << ans;

    return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 600 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 348 KB Output is correct
12 Correct 0 ms 348 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 348 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 600 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 348 KB Output is correct
12 Correct 0 ms 348 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 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 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 600 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 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 344 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 0 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 344 KB Output is correct
53 Correct 0 ms 348 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 600 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 348 KB Output is correct
12 Correct 0 ms 348 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 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 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 600 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 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 344 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 0 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 344 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1 ms 9104 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 6744 KB Output is correct
58 Correct 18 ms 4700 KB Output is correct
59 Correct 158 ms 9084 KB Output is correct
60 Correct 160 ms 9040 KB Output is correct
61 Correct 163 ms 9044 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 154 ms 9088 KB Output is correct
64 Correct 106 ms 9100 KB Output is correct
65 Correct 127 ms 9100 KB Output is correct
66 Correct 92 ms 9092 KB Output is correct
67 Correct 98 ms 9092 KB Output is correct
68 Correct 105 ms 9096 KB Output is correct
69 Correct 104 ms 9092 KB Output is correct
70 Correct 13 ms 4700 KB Output is correct
71 Correct 13 ms 4756 KB Output is correct
72 Correct 12 ms 4700 KB Output is correct
73 Correct 15 ms 4752 KB Output is correct
74 Correct 13 ms 4700 KB Output is correct
75 Correct 11 ms 4696 KB Output is correct
76 Correct 11 ms 4700 KB Output is correct
77 Correct 11 ms 4748 KB Output is correct
78 Correct 11 ms 4616 KB Output is correct
79 Correct 12 ms 4752 KB Output is correct
80 Correct 13 ms 4700 KB Output is correct
81 Correct 15 ms 4700 KB Output is correct
82 Correct 11 ms 4700 KB Output is correct
83 Correct 12 ms 4760 KB Output is correct
84 Correct 12 ms 4752 KB Output is correct
85 Correct 11 ms 4700 KB Output is correct
86 Correct 11 ms 4756 KB Output is correct
87 Correct 13 ms 4700 KB Output is correct
88 Correct 12 ms 4700 KB Output is correct
89 Correct 11 ms 4700 KB Output is correct
90 Correct 12 ms 4748 KB Output is correct