oj.uz

Submission #521975

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

const int N = 3000 + 3, 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 = 0; i < m; ++i)
        for (int j = 0; j < n; ++j) if (c[i][j] == 'G') {

            // check ngang
            if (j > 0 && j + 1 < n && 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 (i > 0 && i + 1 < m && 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];
int 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 = 0; i < m; ++i) cin >> c[i];
    init_graph();

    cout << cnt - hopcroft_karp() << '\n';
}
/**  /\_/\
 *  (= ._.)
 *  / >0  \>1
**/
/*
==================================================+
INPUT:                                            |
--------------------------------------------------|
4 4
xxxRx
xxRGW
xRGWx
RGWxx
--------------------------------------------------|
==================================================+
OUTPUT:                                           |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
*/

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 211972 KB Output is correct
2 Correct 104 ms 212076 KB Output is correct
3 Correct 102 ms 212160 KB Output is correct
4 Correct 104 ms 212004 KB Output is correct
5 Correct 103 ms 212036 KB Output is correct
6 Correct 102 ms 212124 KB Output is correct
7 Correct 102 ms 212088 KB Output is correct
8 Correct 102 ms 212004 KB Output is correct
9 Correct 103 ms 211988 KB Output is correct
10 Correct 104 ms 212012 KB Output is correct
11 Correct 117 ms 212128 KB Output is correct
12 Correct 101 ms 212016 KB Output is correct
13 Correct 101 ms 212016 KB Output is correct
14 Correct 104 ms 212040 KB Output is correct
15 Correct 109 ms 212028 KB Output is correct
16 Correct 114 ms 212168 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 211972 KB Output is correct
2 Correct 104 ms 212076 KB Output is correct
3 Correct 102 ms 212160 KB Output is correct
4 Correct 104 ms 212004 KB Output is correct
5 Correct 103 ms 212036 KB Output is correct
6 Correct 102 ms 212124 KB Output is correct
7 Correct 102 ms 212088 KB Output is correct
8 Correct 102 ms 212004 KB Output is correct
9 Correct 103 ms 211988 KB Output is correct
10 Correct 104 ms 212012 KB Output is correct
11 Correct 117 ms 212128 KB Output is correct
12 Correct 101 ms 212016 KB Output is correct
13 Correct 101 ms 212016 KB Output is correct
14 Correct 104 ms 212040 KB Output is correct
15 Correct 109 ms 212028 KB Output is correct
16 Correct 114 ms 212168 KB Output is correct
17 Correct 109 ms 212004 KB Output is correct
18 Correct 99 ms 212120 KB Output is correct
19 Correct 106 ms 212056 KB Output is correct
20 Correct 106 ms 212108 KB Output is correct
21 Correct 100 ms 212088 KB Output is correct
22 Correct 102 ms 212164 KB Output is correct
23 Correct 113 ms 212072 KB Output is correct
24 Correct 109 ms 212092 KB Output is correct
25 Correct 104 ms 212088 KB Output is correct
26 Correct 102 ms 212016 KB Output is correct
27 Correct 102 ms 212164 KB Output is correct
28 Correct 101 ms 212172 KB Output is correct
29 Correct 102 ms 212144 KB Output is correct
30 Correct 101 ms 212232 KB Output is correct
31 Correct 107 ms 212096 KB Output is correct
32 Correct 105 ms 212048 KB Output is correct
33 Correct 105 ms 212128 KB Output is correct
34 Correct 107 ms 212072 KB Output is correct
35 Correct 112 ms 212268 KB Output is correct
36 Correct 107 ms 212200 KB Output is correct
37 Correct 109 ms 212164 KB Output is correct
38 Correct 106 ms 212136 KB Output is correct
39 Correct 107 ms 212164 KB Output is correct
40 Correct 111 ms 212184 KB Output is correct
41 Correct 109 ms 212168 KB Output is correct
42 Correct 112 ms 212120 KB Output is correct
43 Correct 105 ms 212164 KB Output is correct
44 Correct 108 ms 212184 KB Output is correct
45 Correct 106 ms 212264 KB Output is correct
46 Correct 107 ms 212136 KB Output is correct
47 Correct 107 ms 212164 KB Output is correct
48 Correct 106 ms 212172 KB Output is correct
49 Correct 107 ms 212136 KB Output is correct
50 Correct 109 ms 212188 KB Output is correct
51 Correct 109 ms 212152 KB Output is correct
52 Correct 106 ms 212164 KB Output is correct
53 Correct 107 ms 212140 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 211972 KB Output is correct
2 Correct 104 ms 212076 KB Output is correct
3 Correct 102 ms 212160 KB Output is correct
4 Correct 104 ms 212004 KB Output is correct
5 Correct 103 ms 212036 KB Output is correct
6 Correct 102 ms 212124 KB Output is correct
7 Correct 102 ms 212088 KB Output is correct
8 Correct 102 ms 212004 KB Output is correct
9 Correct 103 ms 211988 KB Output is correct
10 Correct 104 ms 212012 KB Output is correct
11 Correct 117 ms 212128 KB Output is correct
12 Correct 101 ms 212016 KB Output is correct
13 Correct 101 ms 212016 KB Output is correct
14 Correct 104 ms 212040 KB Output is correct
15 Correct 109 ms 212028 KB Output is correct
16 Correct 114 ms 212168 KB Output is correct
17 Correct 109 ms 212004 KB Output is correct
18 Correct 99 ms 212120 KB Output is correct
19 Correct 106 ms 212056 KB Output is correct
20 Correct 106 ms 212108 KB Output is correct
21 Correct 100 ms 212088 KB Output is correct
22 Correct 102 ms 212164 KB Output is correct
23 Correct 113 ms 212072 KB Output is correct
24 Correct 109 ms 212092 KB Output is correct
25 Correct 104 ms 212088 KB Output is correct
26 Correct 102 ms 212016 KB Output is correct
27 Correct 102 ms 212164 KB Output is correct
28 Correct 101 ms 212172 KB Output is correct
29 Correct 102 ms 212144 KB Output is correct
30 Correct 101 ms 212232 KB Output is correct
31 Correct 107 ms 212096 KB Output is correct
32 Correct 105 ms 212048 KB Output is correct
33 Correct 105 ms 212128 KB Output is correct
34 Correct 107 ms 212072 KB Output is correct
35 Correct 112 ms 212268 KB Output is correct
36 Correct 107 ms 212200 KB Output is correct
37 Correct 109 ms 212164 KB Output is correct
38 Correct 106 ms 212136 KB Output is correct
39 Correct 107 ms 212164 KB Output is correct
40 Correct 111 ms 212184 KB Output is correct
41 Correct 109 ms 212168 KB Output is correct
42 Correct 112 ms 212120 KB Output is correct
43 Correct 105 ms 212164 KB Output is correct
44 Correct 108 ms 212184 KB Output is correct
45 Correct 106 ms 212264 KB Output is correct
46 Correct 107 ms 212136 KB Output is correct
47 Correct 107 ms 212164 KB Output is correct
48 Correct 106 ms 212172 KB Output is correct
49 Correct 107 ms 212136 KB Output is correct
50 Correct 109 ms 212188 KB Output is correct
51 Correct 109 ms 212152 KB Output is correct
52 Correct 106 ms 212164 KB Output is correct
53 Correct 107 ms 212140 KB Output is correct
54 Correct 107 ms 212008 KB Output is correct
55 Correct 111 ms 221384 KB Output is correct
56 Correct 107 ms 212160 KB Output is correct
57 Correct 128 ms 227940 KB Output is correct
58 Correct 127 ms 232708 KB Output is correct
59 Runtime error 163 ms 262148 KB Execution killed with signal 9
60 Halted 0 ms 0 KB -