oj.uz

답안 #529718

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
529718 2022-02-23T14:14:44 Z zxcvbnm Dango Maker (JOI18_dango_maker) C++14
13 / 100
 1 ms 312 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const string str = "RGW";

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    char mat[n][m];
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cin >> mat[i][j];
        }
    }

    bool ok[n][m][2];
    memset(ok, false, sizeof ok);

    int thru[n][m][2];
    memset(thru, -1, sizeof thru);

    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m-2; j++) {
            string curr;
            for(int k = 0; k < 3; k++) {
                curr += mat[i][j+k];
            }

            if (curr == str) {
                ok[i][j][0] = true;
            }
        }
    }

    for(int j = 0; j < m; j++) {
        for(int i = 0; i < n-2; i++) {
            string curr;
            for(int k = 0; k < 3; k++) {
                curr += mat[i+k][j];
            }

            if (curr == str) {
                ok[i][j][1] = true;
            }
        }
    }

    priority_queue<array<int, 4>, vector<array<int, 4>>, greater<array<int, 4>>> q;

    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if (ok[i][j][0]) {
                int cnt = 0;
                cnt += ok[i][j][1];
                if (i-1 >= 0) {
                    cnt += ok[i-1][j+1][1];
                }
                if (i-2 >= 0) {
                    cnt += ok[i-2][j+2][1];
                }
                q.push({cnt, i, j, 0});
//                cout << i << " " << j << " " << 0 << " " << cnt << "\n";
            }
            if (ok[i][j][1]) {
                int cnt = 0;
                cnt += ok[i][j][0];
                if (j-1 >= 0) {
                    cnt += ok[i+1][j-1][0];
                }
                if (j-2 >= 0) {
                    cnt += ok[i+2][j-2][0];
                }
                q.push({cnt, i, j, 1});
//                cout << i << " " << j << " " << 1 << " " << cnt << "\n";
            }
        }
    }

    int ans = 0;
    while(!q.empty()) {
        auto v = q.top();
        q.pop();

        if (v[3] == 0) {
            string curr;
            for(int k = 0; k < 3; k++) {
                curr += mat[v[1]][v[2]+k];
            }
            if (curr != str) continue;
            ans++;
            for(int k = 0; k < 3; k++) {
                mat[v[1]][v[2]+k] = 'X';
            }
        }
        else {
            string curr;
            for(int k = 0; k < 3; k++) {
                curr += mat[v[1]+k][v[2]];
            }
            if (curr != str) continue;
            ans++;
            for(int k = 0; k < 3; k++) {
                mat[v[1]+k][v[2]] = 'X';
            }
        }
//        cout << v[0] << "\n";
    }

    cout << ans << "\n";
    return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 308 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 312 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 312 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 308 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Incorrect 0 ms 204 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 308 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 312 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 312 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 308 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Incorrect 0 ms 204 KB Output isn't correct
28 Halted 0 ms 0 KB -