oj.uz

Submission #679971

# Submission time Handle Problem Language Result Execution time Memory
679971 2023-01-09T17:22:03 Z vjudge1 Dango Maker (JOI18_dango_maker) C++14
33 / 100
 120 ms 152320 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair <ll, ll>
#define st first
#define nd second
#define rep(i, n, m) for (ll i = (n); i <= (m); i ++)
#define rrep(i, n, m) for (ll i = (n); i >= (m); i --)
using namespace std;
const long long INF = 1e18;
const long long N = 3000 + 5;

char a[N][N];
ll n, m;

bool cut(pii ver, pii hor) {
    rep(i, -2, 0) rep(j, -2, 0)
        if (make_pair(ver.st + i, ver.nd) == make_pair(hor.st, hor.nd + j))
            return true;
    return false;
}

vector <pii> ver, hor;

bool check(char a, char b, char c) {
    return a == 'R' && b == 'G' && c == 'W';
}

int id(int i, int j) {
    return (i - 1) * m + j;
}

ll cap[N + 2000][N + 2000];
//map <int, map<int, ll>> cap;
ll vis[N * 1000], mx, par[N * 1000];
vector <int> d[N * 1000];

ll bfs(ll s, ll t) {
    queue <pii> q;
    rep(i, 0, mx + 1) vis[i] = false, par[i] = -1;
    par[s] = -2;
    vis[s] = 1;

    q.push({s, INF});
    while (q.size()) {
        int u = q.front().st;
        ll flow = q.front().nd;
        q.pop();

        for (int v: d[u]) if (par[v] == -1 && cap[u][v]) {
            par[v] = u;
            ll newflow = min(flow, cap[u][v]);
            if (v == t) return newflow;
            q.push({v, newflow});
        }
    }

    return 0;
}

ll maxFlow() {
    ll flow = 0, tmp;
    while (tmp = bfs(0, mx + 1)) {
        flow += tmp;
        int u = mx + 1;
        while (u != 0) {
            int cur = u, pre = par[u];
            cap[pre][cur] -= tmp;
            cap[cur][pre] += tmp;
            u = pre;
        }
    }

    return flow;
}

int main() {

    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> n >> m;

    rep(i, 1, n) rep(j, 1, m) cin >> a[i][j];
    rep(i, 1, n)
        rep(j, 1, m) {
            if (j >= 3 && check(a[i][j - 2], a[i][j - 1], a[i][j]))
                hor.push_back({i, j});
            if (i >= 3 && check(a[i - 2][j], a[i - 1][j], a[i][j]))
                ver.push_back({i, j});
        }

    int buff = hor.size();
    int u = buff, v;
    for (pii x: ver) {
        u ++;
        v = 0;
        for (pii y: hor) {
            v ++;
            if (cut(x, y)) {
                d[u].push_back(v);
                d[v].push_back(u);
                cap[u][v] = cap[v][u] = 1;
            }
        }
    }

    mx = hor.size() + ver.size();

    rep(i, 1, buff) {
        d[0].push_back(i);
        d[1].push_back(0);
        cap[0][i] = 1;
    }

    int t = mx + 1;
    rep(i, buff + 1, mx) {
        d[t].push_back(i);
        d[i].push_back(t);
        cap[i][t] = 1;
    }

    ll tmp = maxFlow();
    cout << mx - tmp << '\n';

    return 0;
}

Compilation message

dango_maker.cpp: In function 'long long int maxFlow()':
dango_maker.cpp:62:16: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   62 |     while (tmp = bfs(0, mx + 1)) {
      |            ~~~~^~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 70824 KB Output is correct
2 Correct 33 ms 70828 KB Output is correct
3 Correct 33 ms 70892 KB Output is correct
4 Correct 33 ms 70888 KB Output is correct
5 Correct 32 ms 70900 KB Output is correct
6 Correct 33 ms 70824 KB Output is correct
7 Correct 33 ms 70940 KB Output is correct
8 Correct 33 ms 70812 KB Output is correct
9 Correct 34 ms 70912 KB Output is correct
10 Correct 35 ms 70840 KB Output is correct
11 Correct 36 ms 70848 KB Output is correct
12 Correct 33 ms 70868 KB Output is correct
13 Correct 34 ms 70820 KB Output is correct
14 Correct 40 ms 70864 KB Output is correct
15 Correct 34 ms 70868 KB Output is correct
16 Correct 33 ms 70908 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 70824 KB Output is correct
2 Correct 33 ms 70828 KB Output is correct
3 Correct 33 ms 70892 KB Output is correct
4 Correct 33 ms 70888 KB Output is correct
5 Correct 32 ms 70900 KB Output is correct
6 Correct 33 ms 70824 KB Output is correct
7 Correct 33 ms 70940 KB Output is correct
8 Correct 33 ms 70812 KB Output is correct
9 Correct 34 ms 70912 KB Output is correct
10 Correct 35 ms 70840 KB Output is correct
11 Correct 36 ms 70848 KB Output is correct
12 Correct 33 ms 70868 KB Output is correct
13 Correct 34 ms 70820 KB Output is correct
14 Correct 40 ms 70864 KB Output is correct
15 Correct 34 ms 70868 KB Output is correct
16 Correct 33 ms 70908 KB Output is correct
17 Correct 33 ms 70884 KB Output is correct
18 Correct 33 ms 70892 KB Output is correct
19 Correct 38 ms 70956 KB Output is correct
20 Correct 37 ms 70880 KB Output is correct
21 Correct 32 ms 70996 KB Output is correct
22 Correct 33 ms 70996 KB Output is correct
23 Correct 32 ms 70888 KB Output is correct
24 Correct 33 ms 70836 KB Output is correct
25 Correct 33 ms 70892 KB Output is correct
26 Correct 38 ms 70832 KB Output is correct
27 Correct 46 ms 71172 KB Output is correct
28 Correct 33 ms 71024 KB Output is correct
29 Correct 34 ms 71016 KB Output is correct
30 Correct 32 ms 71040 KB Output is correct
31 Correct 33 ms 71028 KB Output is correct
32 Correct 32 ms 70992 KB Output is correct
33 Correct 32 ms 71084 KB Output is correct
34 Correct 33 ms 71100 KB Output is correct
35 Correct 35 ms 71248 KB Output is correct
36 Correct 33 ms 71116 KB Output is correct
37 Correct 34 ms 71044 KB Output is correct
38 Correct 35 ms 71148 KB Output is correct
39 Correct 42 ms 71064 KB Output is correct
40 Correct 33 ms 71072 KB Output is correct
41 Correct 32 ms 71120 KB Output is correct
42 Correct 34 ms 71020 KB Output is correct
43 Correct 47 ms 71040 KB Output is correct
44 Correct 41 ms 71100 KB Output is correct
45 Correct 49 ms 71020 KB Output is correct
46 Correct 34 ms 71136 KB Output is correct
47 Correct 32 ms 70992 KB Output is correct
48 Correct 44 ms 71048 KB Output is correct
49 Correct 39 ms 71012 KB Output is correct
50 Correct 35 ms 71100 KB Output is correct
51 Correct 37 ms 70996 KB Output is correct
52 Correct 34 ms 71120 KB Output is correct
53 Correct 41 ms 71028 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 70824 KB Output is correct
2 Correct 33 ms 70828 KB Output is correct
3 Correct 33 ms 70892 KB Output is correct
4 Correct 33 ms 70888 KB Output is correct
5 Correct 32 ms 70900 KB Output is correct
6 Correct 33 ms 70824 KB Output is correct
7 Correct 33 ms 70940 KB Output is correct
8 Correct 33 ms 70812 KB Output is correct
9 Correct 34 ms 70912 KB Output is correct
10 Correct 35 ms 70840 KB Output is correct
11 Correct 36 ms 70848 KB Output is correct
12 Correct 33 ms 70868 KB Output is correct
13 Correct 34 ms 70820 KB Output is correct
14 Correct 40 ms 70864 KB Output is correct
15 Correct 34 ms 70868 KB Output is correct
16 Correct 33 ms 70908 KB Output is correct
17 Correct 33 ms 70884 KB Output is correct
18 Correct 33 ms 70892 KB Output is correct
19 Correct 38 ms 70956 KB Output is correct
20 Correct 37 ms 70880 KB Output is correct
21 Correct 32 ms 70996 KB Output is correct
22 Correct 33 ms 70996 KB Output is correct
23 Correct 32 ms 70888 KB Output is correct
24 Correct 33 ms 70836 KB Output is correct
25 Correct 33 ms 70892 KB Output is correct
26 Correct 38 ms 70832 KB Output is correct
27 Correct 46 ms 71172 KB Output is correct
28 Correct 33 ms 71024 KB Output is correct
29 Correct 34 ms 71016 KB Output is correct
30 Correct 32 ms 71040 KB Output is correct
31 Correct 33 ms 71028 KB Output is correct
32 Correct 32 ms 70992 KB Output is correct
33 Correct 32 ms 71084 KB Output is correct
34 Correct 33 ms 71100 KB Output is correct
35 Correct 35 ms 71248 KB Output is correct
36 Correct 33 ms 71116 KB Output is correct
37 Correct 34 ms 71044 KB Output is correct
38 Correct 35 ms 71148 KB Output is correct
39 Correct 42 ms 71064 KB Output is correct
40 Correct 33 ms 71072 KB Output is correct
41 Correct 32 ms 71120 KB Output is correct
42 Correct 34 ms 71020 KB Output is correct
43 Correct 47 ms 71040 KB Output is correct
44 Correct 41 ms 71100 KB Output is correct
45 Correct 49 ms 71020 KB Output is correct
46 Correct 34 ms 71136 KB Output is correct
47 Correct 32 ms 70992 KB Output is correct
48 Correct 44 ms 71048 KB Output is correct
49 Correct 39 ms 71012 KB Output is correct
50 Correct 35 ms 71100 KB Output is correct
51 Correct 37 ms 70996 KB Output is correct
52 Correct 34 ms 71120 KB Output is correct
53 Correct 41 ms 71028 KB Output is correct
54 Correct 32 ms 70864 KB Output is correct
55 Correct 38 ms 80144 KB Output is correct
56 Correct 95 ms 83152 KB Output is correct
57 Correct 120 ms 92184 KB Output is correct
58 Runtime error 116 ms 152320 KB Execution killed with signal 11
59 Halted 0 ms 0 KB -