oj.uz

Submission #522006

# Submission time Handle Problem Language Result Execution time Memory
522006 2022-02-03T15:16:36 Z Monarchuwu Dango Maker (JOI18_dango_maker) C++17
33 / 100
 134 ms 262148 KB 
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;

const int N = 3333, N2 = N * N, inf = 1e9 + 7;
int m, n;
char c[N][N];
vector<int> vertexX;

int cnt, num[2][N][N];
vector<int> g[N2];
void init_graph() {
    for (int i = 1; i <= m; ++i)
        for (int j = 1; j <= n; ++j) if (c[i][j] == 'G') {

            // check ngang
            if (c[i][j - 1] == 'R' && c[i][j + 1] == 'W') {
                num[0][i][j] = ++cnt;
                vertexX.push_back(num[0][i][j]);

                if (num[1][i - 1][j + 1])
                    g[num[0][i][j]].push_back(num[1][i - 1][j + 1]);
            }

            // check dọc
            if (c[i - 1][j] == 'R' && c[i + 1][j] == 'W') {
                num[1][i][j] = ++cnt;

                if (num[0][i - 1][j + 1])
                    g[num[0][i - 1][j + 1]].push_back(num[1][i][j]);
            }

            if (num[0][i][j] && num[1][i][j])
                g[num[0][i][j]].push_back(num[1][i][j]);
        }
}

int mat[N2], dist[N2];
bool bfs() {
    queue<int> q;
    dist[0] = inf;
    for (int i : vertexX)
        if (mat[i]) dist[i] = inf;
        else {
            dist[i] = 0;
            q.push(i);
        }

    while (!q.empty()) {
        int u = q.front(); q.pop();
        for (int v : g[u]) {
            if (dist[mat[v]] == inf) {
                dist[mat[v]] = dist[u] + 1;
                q.push(mat[v]);
            }
        }
    }
    return dist[0] != inf;
}

bool dfs(int u) {
    for (int v : g[u]) {
        if (!mat[v] || (dist[mat[v]] == dist[u] + 1 && dfs(mat[v]))) {
            mat[v] = u, mat[u] = v;
            dist[u] = inf;
            return true;
        }
    }
    dist[u] = inf;
    return false;
}

int hopcroft_karp() {
    int ans(0);
    while (bfs()) {
        for (int i : vertexX)
            if (!mat[i] && dfs(i)) ++ans;
    }
    return ans;
}

int main() {
    cin.tie(NULL)->sync_with_stdio(false);
    cin >> m >> n;
    for (int i = 1; i <= m; ++i) cin >> (c[i] + 1);
    init_graph();

    cout << cnt - hopcroft_karp() << '\n';
}
/**  /\_/\
 *  (= ._.)
 *  / >0  \>1
**/

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 261252 KB Output is correct
2 Correct 119 ms 261184 KB Output is correct
3 Correct 119 ms 261188 KB Output is correct
4 Correct 119 ms 261120 KB Output is correct
5 Correct 123 ms 261280 KB Output is correct
6 Correct 120 ms 261128 KB Output is correct
7 Correct 120 ms 261200 KB Output is correct
8 Correct 120 ms 261204 KB Output is correct
9 Correct 123 ms 261224 KB Output is correct
10 Correct 134 ms 261208 KB Output is correct
11 Correct 123 ms 261240 KB Output is correct
12 Correct 121 ms 261200 KB Output is correct
13 Correct 123 ms 261228 KB Output is correct
14 Correct 127 ms 261280 KB Output is correct
15 Correct 122 ms 261144 KB Output is correct
16 Correct 122 ms 261124 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 261252 KB Output is correct
2 Correct 119 ms 261184 KB Output is correct
3 Correct 119 ms 261188 KB Output is correct
4 Correct 119 ms 261120 KB Output is correct
5 Correct 123 ms 261280 KB Output is correct
6 Correct 120 ms 261128 KB Output is correct
7 Correct 120 ms 261200 KB Output is correct
8 Correct 120 ms 261204 KB Output is correct
9 Correct 123 ms 261224 KB Output is correct
10 Correct 134 ms 261208 KB Output is correct
11 Correct 123 ms 261240 KB Output is correct
12 Correct 121 ms 261200 KB Output is correct
13 Correct 123 ms 261228 KB Output is correct
14 Correct 127 ms 261280 KB Output is correct
15 Correct 122 ms 261144 KB Output is correct
16 Correct 122 ms 261124 KB Output is correct
17 Correct 120 ms 261120 KB Output is correct
18 Correct 123 ms 261260 KB Output is correct
19 Correct 124 ms 261232 KB Output is correct
20 Correct 122 ms 261168 KB Output is correct
21 Correct 124 ms 261172 KB Output is correct
22 Correct 120 ms 261188 KB Output is correct
23 Correct 124 ms 261268 KB Output is correct
24 Correct 122 ms 261184 KB Output is correct
25 Correct 122 ms 261224 KB Output is correct
26 Correct 121 ms 261136 KB Output is correct
27 Correct 119 ms 261308 KB Output is correct
28 Correct 121 ms 261308 KB Output is correct
29 Correct 122 ms 261220 KB Output is correct
30 Correct 130 ms 261272 KB Output is correct
31 Correct 121 ms 261240 KB Output is correct
32 Correct 128 ms 261188 KB Output is correct
33 Correct 120 ms 261188 KB Output is correct
34 Correct 124 ms 261284 KB Output is correct
35 Correct 121 ms 261184 KB Output is correct
36 Correct 121 ms 261300 KB Output is correct
37 Correct 125 ms 261312 KB Output is correct
38 Correct 122 ms 261188 KB Output is correct
39 Correct 121 ms 261260 KB Output is correct
40 Correct 121 ms 261192 KB Output is correct
41 Correct 125 ms 261396 KB Output is correct
42 Correct 123 ms 261228 KB Output is correct
43 Correct 124 ms 261304 KB Output is correct
44 Correct 120 ms 261188 KB Output is correct
45 Correct 125 ms 261260 KB Output is correct
46 Correct 126 ms 261312 KB Output is correct
47 Correct 123 ms 261272 KB Output is correct
48 Correct 122 ms 261248 KB Output is correct
49 Correct 127 ms 261252 KB Output is correct
50 Correct 130 ms 261232 KB Output is correct
51 Correct 125 ms 261228 KB Output is correct
52 Correct 124 ms 261280 KB Output is correct
53 Correct 123 ms 261304 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 261252 KB Output is correct
2 Correct 119 ms 261184 KB Output is correct
3 Correct 119 ms 261188 KB Output is correct
4 Correct 119 ms 261120 KB Output is correct
5 Correct 123 ms 261280 KB Output is correct
6 Correct 120 ms 261128 KB Output is correct
7 Correct 120 ms 261200 KB Output is correct
8 Correct 120 ms 261204 KB Output is correct
9 Correct 123 ms 261224 KB Output is correct
10 Correct 134 ms 261208 KB Output is correct
11 Correct 123 ms 261240 KB Output is correct
12 Correct 121 ms 261200 KB Output is correct
13 Correct 123 ms 261228 KB Output is correct
14 Correct 127 ms 261280 KB Output is correct
15 Correct 122 ms 261144 KB Output is correct
16 Correct 122 ms 261124 KB Output is correct
17 Correct 120 ms 261120 KB Output is correct
18 Correct 123 ms 261260 KB Output is correct
19 Correct 124 ms 261232 KB Output is correct
20 Correct 122 ms 261168 KB Output is correct
21 Correct 124 ms 261172 KB Output is correct
22 Correct 120 ms 261188 KB Output is correct
23 Correct 124 ms 261268 KB Output is correct
24 Correct 122 ms 261184 KB Output is correct
25 Correct 122 ms 261224 KB Output is correct
26 Correct 121 ms 261136 KB Output is correct
27 Correct 119 ms 261308 KB Output is correct
28 Correct 121 ms 261308 KB Output is correct
29 Correct 122 ms 261220 KB Output is correct
30 Correct 130 ms 261272 KB Output is correct
31 Correct 121 ms 261240 KB Output is correct
32 Correct 128 ms 261188 KB Output is correct
33 Correct 120 ms 261188 KB Output is correct
34 Correct 124 ms 261284 KB Output is correct
35 Correct 121 ms 261184 KB Output is correct
36 Correct 121 ms 261300 KB Output is correct
37 Correct 125 ms 261312 KB Output is correct
38 Correct 122 ms 261188 KB Output is correct
39 Correct 121 ms 261260 KB Output is correct
40 Correct 121 ms 261192 KB Output is correct
41 Correct 125 ms 261396 KB Output is correct
42 Correct 123 ms 261228 KB Output is correct
43 Correct 124 ms 261304 KB Output is correct
44 Correct 120 ms 261188 KB Output is correct
45 Correct 125 ms 261260 KB Output is correct
46 Correct 126 ms 261312 KB Output is correct
47 Correct 123 ms 261272 KB Output is correct
48 Correct 122 ms 261248 KB Output is correct
49 Correct 127 ms 261252 KB Output is correct
50 Correct 130 ms 261232 KB Output is correct
51 Correct 125 ms 261228 KB Output is correct
52 Correct 124 ms 261280 KB Output is correct
53 Correct 123 ms 261304 KB Output is correct
54 Correct 125 ms 261240 KB Output is correct
55 Runtime error 106 ms 262148 KB Execution killed with signal 9
56 Halted 0 ms 0 KB -