oj.uz

Submission #531756

# Submission time Handle Problem Language Result Execution time Memory
531756 2022-03-01T11:55:47 Z zxcvbnm Dango Maker (JOI18_dango_maker) C++14
13 / 100
 1 ms 332 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

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

/*
    0 - desine
    1 - virsus
*/

bool gali[nax][nax][2];
bool vis[nax][nax][2];

const int dx[] = {-1, +1, 0};
const int dy[] = {+1, -1, 0};

int n, m;

bool in(int x, int y) {
    return x >= 0 && x < n && y >= 0 && y < m;
}

bool check_ok(int i, int j, int p) {
    if (i < 0 || j < 0 || i >= n || j >= m) return false;

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

int sz = 0;
int cnt = 0;

void dfs(int x, int y, int k, int col) {
    if (col == 0) cnt++;
    sz++;

    vis[x][y][k] = true;

    for(int i = 0; i < 3; i++) {
        int X = x + dx[i], Y = y + dy[i], K = k^1;
        if (in(X, Y) && !vis[X][Y][K] && gali[X][Y][K]) {
            dfs(X, Y, K, col^1);
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> m;

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

    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if (mat[i][j] == 'G') {
                if (j-1 >= 0) {
                    gali[i][j][0] = check_ok(i, j-1, 0);
                }
                if (i-1 >= 0) {
                    gali[i][j][1] = check_ok(i-1, j, 1);
                }
            }
        }
    }

//    for(int i = 0; i < n; i++) {
//        for(int j = 0; j < m; j++) {
//            if (mat[i][j] != 'G') continue;
//            for(int k = 0; k < 2; k++) {
//                if (i-1 >= 0 && j+1 < m && gali[i-1][j+1][k^1]) {
//                    adj[i][j][k].push_back({i-1, j+1, k^1});
//                }
//                if (i+1 < n && j-1 >= 0 && gali[i+1][j-1][k^1]) {
//                    adj[i][j][k].push_back({i+1, j-1, k^1});
//                }
//            }
//        }
//    }

//    for(int i = 0; i < n; i++) {
//        for(int j = 0; j < m; j++) {
//            for(int k = 0; k < 2; k++) {
//                if (gali[i][j][k]) {
//                    cout << i << " " << j << " " << k << "\n";
//                }
//            }
//        }
//    }

    int ans = 0;

    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            for(int k = 0; k < 2; k++) {
                if (gali[i][j][k] == false || vis[i][j][k]) continue;
                sz = 0;
                cnt = 0;
                dfs(i, j, k, 0);
                ans += max(cnt, sz-cnt);
            }
        }
    }

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

Subtask #1
13.0 / 13.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 324 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 320 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 324 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 280 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Incorrect 0 ms 332 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 324 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 320 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 324 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 280 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Incorrect 0 ms 332 KB Output isn't correct
35 Halted 0 ms 0 KB -