oj.uz

Submission #522025

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

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

int cnt, num[2][2][N];
vector<int> g[N2];
void init_graph() {
    for (int i = 1, tmp; 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][1][j] = ++cnt;
                vertexX.push_back(cnt);

                tmp = num[1][0][j + 1];
                if (tmp)
                    g[cnt].push_back(tmp);
            }

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

                tmp = num[0][0][j + 1];
                if (tmp)
                    g[tmp].push_back(cnt);
            }

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

        copy(num[0][1] + 1, num[0][1] + n + 1, num[0][0] + 1);
        fill(num[0][1] + 1, num[0][1] + n + 1, 0);

        copy(num[1][1] + 1, num[1][1] + n + 1, num[1][0] + 1);
        fill(num[1][1] + 1, num[1][1] + n + 1, 0);
    }
}

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 96 ms 212044 KB Output is correct
2 Correct 107 ms 211996 KB Output is correct
3 Correct 96 ms 212092 KB Output is correct
4 Correct 95 ms 212036 KB Output is correct
5 Correct 97 ms 212020 KB Output is correct
6 Correct 113 ms 212028 KB Output is correct
7 Correct 105 ms 212040 KB Output is correct
8 Correct 94 ms 212000 KB Output is correct
9 Correct 95 ms 212024 KB Output is correct
10 Correct 105 ms 212080 KB Output is correct
11 Correct 103 ms 212116 KB Output is correct
12 Correct 97 ms 212060 KB Output is correct
13 Correct 99 ms 211996 KB Output is correct
14 Correct 97 ms 212100 KB Output is correct
15 Correct 96 ms 212012 KB Output is correct
16 Correct 106 ms 212064 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 212044 KB Output is correct
2 Correct 107 ms 211996 KB Output is correct
3 Correct 96 ms 212092 KB Output is correct
4 Correct 95 ms 212036 KB Output is correct
5 Correct 97 ms 212020 KB Output is correct
6 Correct 113 ms 212028 KB Output is correct
7 Correct 105 ms 212040 KB Output is correct
8 Correct 94 ms 212000 KB Output is correct
9 Correct 95 ms 212024 KB Output is correct
10 Correct 105 ms 212080 KB Output is correct
11 Correct 103 ms 212116 KB Output is correct
12 Correct 97 ms 212060 KB Output is correct
13 Correct 99 ms 211996 KB Output is correct
14 Correct 97 ms 212100 KB Output is correct
15 Correct 96 ms 212012 KB Output is correct
16 Correct 106 ms 212064 KB Output is correct
17 Correct 111 ms 212088 KB Output is correct
18 Correct 94 ms 212016 KB Output is correct
19 Correct 95 ms 212036 KB Output is correct
20 Correct 97 ms 212120 KB Output is correct
21 Correct 112 ms 212012 KB Output is correct
22 Correct 104 ms 212036 KB Output is correct
23 Correct 97 ms 212104 KB Output is correct
24 Correct 95 ms 212036 KB Output is correct
25 Correct 95 ms 212072 KB Output is correct
26 Correct 101 ms 212020 KB Output is correct
27 Correct 112 ms 212072 KB Output is correct
28 Correct 106 ms 212036 KB Output is correct
29 Correct 95 ms 212064 KB Output is correct
30 Correct 102 ms 212084 KB Output is correct
31 Correct 98 ms 212016 KB Output is correct
32 Correct 96 ms 212036 KB Output is correct
33 Correct 99 ms 212088 KB Output is correct
34 Correct 97 ms 212028 KB Output is correct
35 Correct 99 ms 212064 KB Output is correct
36 Correct 105 ms 212204 KB Output is correct
37 Correct 97 ms 212036 KB Output is correct
38 Correct 95 ms 212116 KB Output is correct
39 Correct 97 ms 212108 KB Output is correct
40 Correct 98 ms 212036 KB Output is correct
41 Correct 102 ms 212208 KB Output is correct
42 Correct 95 ms 212136 KB Output is correct
43 Correct 97 ms 212036 KB Output is correct
44 Correct 122 ms 212108 KB Output is correct
45 Correct 100 ms 212036 KB Output is correct
46 Correct 99 ms 212052 KB Output is correct
47 Correct 96 ms 212136 KB Output is correct
48 Correct 99 ms 212080 KB Output is correct
49 Correct 106 ms 212036 KB Output is correct
50 Correct 98 ms 212028 KB Output is correct
51 Correct 105 ms 212228 KB Output is correct
52 Correct 109 ms 212104 KB Output is correct
53 Correct 97 ms 212108 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 212044 KB Output is correct
2 Correct 107 ms 211996 KB Output is correct
3 Correct 96 ms 212092 KB Output is correct
4 Correct 95 ms 212036 KB Output is correct
5 Correct 97 ms 212020 KB Output is correct
6 Correct 113 ms 212028 KB Output is correct
7 Correct 105 ms 212040 KB Output is correct
8 Correct 94 ms 212000 KB Output is correct
9 Correct 95 ms 212024 KB Output is correct
10 Correct 105 ms 212080 KB Output is correct
11 Correct 103 ms 212116 KB Output is correct
12 Correct 97 ms 212060 KB Output is correct
13 Correct 99 ms 211996 KB Output is correct
14 Correct 97 ms 212100 KB Output is correct
15 Correct 96 ms 212012 KB Output is correct
16 Correct 106 ms 212064 KB Output is correct
17 Correct 111 ms 212088 KB Output is correct
18 Correct 94 ms 212016 KB Output is correct
19 Correct 95 ms 212036 KB Output is correct
20 Correct 97 ms 212120 KB Output is correct
21 Correct 112 ms 212012 KB Output is correct
22 Correct 104 ms 212036 KB Output is correct
23 Correct 97 ms 212104 KB Output is correct
24 Correct 95 ms 212036 KB Output is correct
25 Correct 95 ms 212072 KB Output is correct
26 Correct 101 ms 212020 KB Output is correct
27 Correct 112 ms 212072 KB Output is correct
28 Correct 106 ms 212036 KB Output is correct
29 Correct 95 ms 212064 KB Output is correct
30 Correct 102 ms 212084 KB Output is correct
31 Correct 98 ms 212016 KB Output is correct
32 Correct 96 ms 212036 KB Output is correct
33 Correct 99 ms 212088 KB Output is correct
34 Correct 97 ms 212028 KB Output is correct
35 Correct 99 ms 212064 KB Output is correct
36 Correct 105 ms 212204 KB Output is correct
37 Correct 97 ms 212036 KB Output is correct
38 Correct 95 ms 212116 KB Output is correct
39 Correct 97 ms 212108 KB Output is correct
40 Correct 98 ms 212036 KB Output is correct
41 Correct 102 ms 212208 KB Output is correct
42 Correct 95 ms 212136 KB Output is correct
43 Correct 97 ms 212036 KB Output is correct
44 Correct 122 ms 212108 KB Output is correct
45 Correct 100 ms 212036 KB Output is correct
46 Correct 99 ms 212052 KB Output is correct
47 Correct 96 ms 212136 KB Output is correct
48 Correct 99 ms 212080 KB Output is correct
49 Correct 106 ms 212036 KB Output is correct
50 Correct 98 ms 212028 KB Output is correct
51 Correct 105 ms 212228 KB Output is correct
52 Correct 109 ms 212104 KB Output is correct
53 Correct 97 ms 212108 KB Output is correct
54 Correct 95 ms 212112 KB Output is correct
55 Correct 107 ms 220904 KB Output is correct
56 Correct 103 ms 212216 KB Output is correct
57 Correct 119 ms 217928 KB Output is correct
58 Correct 109 ms 216332 KB Output is correct
59 Correct 207 ms 232076 KB Output is correct
60 Correct 209 ms 232168 KB Output is correct
61 Correct 215 ms 232084 KB Output is correct
62 Correct 97 ms 212052 KB Output is correct
63 Correct 203 ms 231696 KB Output is correct
64 Runtime error 224 ms 262148 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -