oj.uz

Submission #531186

# Submission time Handle Problem Language Result Execution time Memory
531186 2022-02-28T04:01:34 Z zxcvbnm Dango Maker (JOI18_dango_maker) C++14
33 / 100
 449 ms 460 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

constexpr int nax = 105;
char mat[nax][nax];
const string str = "RGW";

bool check_ok(int i, int j, int p) {
    string curr;
    if (p == 0) {
        for(int k = 0; k < 3 && j+k < nax; k++) {
            curr += mat[i][j+k];
        }
    }
    else {
        for(int k = 0; k < 3 && i+k < nax; k++) {
            curr += mat[i+k][j];
        }
    }
    return (curr == str);
}

void rem(int i, int j, int p) {
    if (p == 0) {
        for(int k = 0; k < 3; k++) {
            mat[i][j+k] = 'X';
        }
    }
    else {
        for(int k = 0; k < 3; k++) {
            mat[i+k][j] = 'X';
        }
    }
}

int cnt(int i, int j, int p) {
    if (p == 0) {
        for(int k = 0; k < 3; k++) {
            mat[i][j+k] = 'X';
        }
    }
    else {
        for(int k = 0; k < 3; k++) {
            mat[i+k][j] = 'X';
        }
    }

    int cnt = 0;
    for(int x = 0; x < nax; x++) {
        for(int y = 0; y < nax; y++)  {
            cnt += check_ok(x, y, 0);
            cnt += check_ok(x, y, 1);
        }
    }

    if (p == 0) {
        for(int k = 0; k < 3; k++) {
            mat[i][j+k] = str[k];
        }
    }
    else {
        for(int k = 0; k < 3; k++) {
            mat[i+k][j] = str[k];
        }
    }


    return cnt;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    assert(n < nax && m < nax);

    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cin >> mat[i][j];
        }
    }

    int ans = 0;

    while(1) {
        bool ok = false;
        int best = -1, x = -1, y = -1, p = -1;

        for(int i = 0; i < nax; i++) {
            for(int j = 0; j < nax; j++) {
                if (check_ok(i, j, 0)) {
                    ok = true;
                    int curr = cnt(i, j, 0);
                    if (curr > best) {
                        best = curr;
                        x = i, y = j, p = 0;
                    }
                }
                if (check_ok(i, j, 1)) {
                    ok = true;
                    int curr = cnt(i, j, 1);
                    if (curr > best) {
                        best = curr;
                        x = i, y = j, p = 1;
                    }
                }

            }
        }

        if (!ok) break;
        rem(x, y, p);
//        cout << x << " " << y << " " << p << "\n";
        ans++;
    }

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

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 7 ms 204 KB Output is correct
7 Correct 10 ms 316 KB Output is correct
8 Correct 3 ms 204 KB Output is correct
9 Correct 3 ms 204 KB Output is correct
10 Correct 3 ms 204 KB Output is correct
11 Correct 10 ms 312 KB Output is correct
12 Correct 8 ms 312 KB Output is correct
13 Correct 5 ms 312 KB Output is correct
14 Correct 9 ms 316 KB Output is correct
15 Correct 6 ms 316 KB Output is correct
16 Correct 9 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 7 ms 204 KB Output is correct
7 Correct 10 ms 316 KB Output is correct
8 Correct 3 ms 204 KB Output is correct
9 Correct 3 ms 204 KB Output is correct
10 Correct 3 ms 204 KB Output is correct
11 Correct 10 ms 312 KB Output is correct
12 Correct 8 ms 312 KB Output is correct
13 Correct 5 ms 312 KB Output is correct
14 Correct 9 ms 316 KB Output is correct
15 Correct 6 ms 316 KB Output is correct
16 Correct 9 ms 204 KB Output is correct
17 Correct 9 ms 312 KB Output is correct
18 Correct 22 ms 308 KB Output is correct
19 Correct 88 ms 204 KB Output is correct
20 Correct 137 ms 296 KB Output is correct
21 Correct 120 ms 296 KB Output is correct
22 Correct 162 ms 292 KB Output is correct
23 Correct 27 ms 204 KB Output is correct
24 Correct 4 ms 204 KB Output is correct
25 Correct 2 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 443 ms 328 KB Output is correct
28 Correct 403 ms 296 KB Output is correct
29 Correct 251 ms 300 KB Output is correct
30 Correct 269 ms 300 KB Output is correct
31 Correct 189 ms 296 KB Output is correct
32 Correct 138 ms 296 KB Output is correct
33 Correct 439 ms 292 KB Output is correct
34 Correct 449 ms 296 KB Output is correct
35 Correct 436 ms 204 KB Output is correct
36 Correct 435 ms 296 KB Output is correct
37 Correct 394 ms 296 KB Output is correct
38 Correct 408 ms 296 KB Output is correct
39 Correct 360 ms 300 KB Output is correct
40 Correct 388 ms 292 KB Output is correct
41 Correct 357 ms 204 KB Output is correct
42 Correct 325 ms 296 KB Output is correct
43 Correct 383 ms 292 KB Output is correct
44 Correct 341 ms 292 KB Output is correct
45 Correct 365 ms 296 KB Output is correct
46 Correct 338 ms 296 KB Output is correct
47 Correct 285 ms 292 KB Output is correct
48 Correct 234 ms 296 KB Output is correct
49 Correct 278 ms 296 KB Output is correct
50 Correct 289 ms 296 KB Output is correct
51 Correct 254 ms 204 KB Output is correct
52 Correct 339 ms 308 KB Output is correct
53 Correct 267 ms 300 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 7 ms 204 KB Output is correct
7 Correct 10 ms 316 KB Output is correct
8 Correct 3 ms 204 KB Output is correct
9 Correct 3 ms 204 KB Output is correct
10 Correct 3 ms 204 KB Output is correct
11 Correct 10 ms 312 KB Output is correct
12 Correct 8 ms 312 KB Output is correct
13 Correct 5 ms 312 KB Output is correct
14 Correct 9 ms 316 KB Output is correct
15 Correct 6 ms 316 KB Output is correct
16 Correct 9 ms 204 KB Output is correct
17 Correct 9 ms 312 KB Output is correct
18 Correct 22 ms 308 KB Output is correct
19 Correct 88 ms 204 KB Output is correct
20 Correct 137 ms 296 KB Output is correct
21 Correct 120 ms 296 KB Output is correct
22 Correct 162 ms 292 KB Output is correct
23 Correct 27 ms 204 KB Output is correct
24 Correct 4 ms 204 KB Output is correct
25 Correct 2 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 443 ms 328 KB Output is correct
28 Correct 403 ms 296 KB Output is correct
29 Correct 251 ms 300 KB Output is correct
30 Correct 269 ms 300 KB Output is correct
31 Correct 189 ms 296 KB Output is correct
32 Correct 138 ms 296 KB Output is correct
33 Correct 439 ms 292 KB Output is correct
34 Correct 449 ms 296 KB Output is correct
35 Correct 436 ms 204 KB Output is correct
36 Correct 435 ms 296 KB Output is correct
37 Correct 394 ms 296 KB Output is correct
38 Correct 408 ms 296 KB Output is correct
39 Correct 360 ms 300 KB Output is correct
40 Correct 388 ms 292 KB Output is correct
41 Correct 357 ms 204 KB Output is correct
42 Correct 325 ms 296 KB Output is correct
43 Correct 383 ms 292 KB Output is correct
44 Correct 341 ms 292 KB Output is correct
45 Correct 365 ms 296 KB Output is correct
46 Correct 338 ms 296 KB Output is correct
47 Correct 285 ms 292 KB Output is correct
48 Correct 234 ms 296 KB Output is correct
49 Correct 278 ms 296 KB Output is correct
50 Correct 289 ms 296 KB Output is correct
51 Correct 254 ms 204 KB Output is correct
52 Correct 339 ms 308 KB Output is correct
53 Correct 267 ms 300 KB Output is correct
54 Runtime error 1 ms 460 KB Execution killed with signal 6
55 Halted 0 ms 0 KB -