oj.uz

답안 #503219

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
503219 2022-01-07T14:24:51 Z Kirill_Maglysh Dango Maker (JOI18_dango_maker) C++17
33 / 100
 249 ms 262148 KB 
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>

#define printLn(n) cout << n << '\n'

using namespace std;

typedef long long ll;

const ll EMPTY = 0;
const ll HORIZONTAL = 1;
const ll VERTICAL = 2;

ll readLL();

string readStr();

void resolve();

bool check(const vector<vector<char>> &field, ll i, ll j, ll dir);

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    resolve();

    return 0;
}

void resolve() {
    ll height = readLL();
    ll width = readLL();
    vector<vector<char>> field(height + 2, vector<char>(width + 2, '#'));
    for (ll i = 1; i <= height; ++i) {
        string str = readStr();
        for (ll j = 1; j <= width; ++j) {
            field[i][j] = str[j-1];
        }
    }

    vector<vector<vector<ll>>> dp(height + 2, vector<vector<ll>>(width + 2, vector<ll>(3, 0)));
    ll res = 0;
    for (ll i = 1; i <= height; ++i) {
        for (ll j = 1; j <= width; ++j) {
            ll prevHor = dp[i - 1][j + 1][HORIZONTAL];
            ll prevVer = dp[i - 1][j + 1][VERTICAL];
            ll prevEmp = dp[i - 1][j + 1][EMPTY];

            dp[i][j][EMPTY] = max(prevEmp, max(prevHor, prevVer));

            if (check(field, i, j, VERTICAL)) {
                dp[i][j][VERTICAL] = 1 + max(prevVer, prevEmp);
            }

            if (check(field, i, j, HORIZONTAL)) {
                dp[i][j][HORIZONTAL] = 1 + max(prevHor, prevEmp);
            }

            if (i == height || j == 1) {
                res += max(dp[i][j][EMPTY], max(dp[i][j][HORIZONTAL], dp[i][j][VERTICAL]));
            }
        }
    }

//    for (int i = 1; i <= height; ++i) {
//        for (int j = 1; j <= width; ++j) {
//            cout << "{" << dp[i][j][0] << dp[i][j][1] << dp[i][j][2] << "}" << " ";
//        }
//
//        printLn("");
//    }

    printLn(res);
}

bool check(const vector<vector<char>> &field, ll i, ll j, ll dir) {
    if (dir == HORIZONTAL) {
        return (field[i][j - 1] == 'R' && field[i][j] == 'G' && field[i][j + 1] == 'W');
    } else if (dir == VERTICAL) {
        return (field[i - 1][j] == 'R' && field[i][j] == 'G' && field[i + 1][j] == 'W');
    }

    return false;
}

ll readLL() {
    ll num;
    cin >> num;
    return num;
}

string readStr() {
    string num;
    cin >> num;
    return num;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 1 ms 244 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 316 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 1 ms 244 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 316 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 316 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 312 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 308 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 316 KB Output is correct
32 Correct 1 ms 248 KB Output is correct
33 Correct 0 ms 320 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 1 ms 208 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 320 KB Output is correct
39 Correct 0 ms 312 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 312 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 0 ms 312 KB Output is correct
45 Correct 0 ms 312 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 0 ms 204 KB Output is correct
53 Correct 0 ms 204 KB Output is correct

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 1 ms 244 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 316 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 316 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 312 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 308 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 316 KB Output is correct
32 Correct 1 ms 248 KB Output is correct
33 Correct 0 ms 320 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 1 ms 208 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 320 KB Output is correct
39 Correct 0 ms 312 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 312 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 0 ms 312 KB Output is correct
45 Correct 0 ms 312 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 0 ms 204 KB Output is correct
53 Correct 0 ms 204 KB Output is correct
54 Correct 1 ms 976 KB Output is correct
55 Correct 2 ms 972 KB Output is correct
56 Correct 2 ms 1612 KB Output is correct
57 Correct 2 ms 1576 KB Output is correct
58 Correct 78 ms 57404 KB Output is correct
59 Runtime error 249 ms 262148 KB Execution killed with signal 9
60 Halted 0 ms 0 KB -