oj.uz

Submission #369126

# Submission time Handle Problem Language Result Execution time Memory
369126 2021-02-20T12:40:40 Z Lam_lai_cuoc_doi Dango Maker (JOI18_dango_maker) C++17
33 / 100
 445 ms 262148 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

const bool typetest = 0;
const int N = 3e3 + 5;
struct HopCroft_Karp
{
    const int NoMatch = -1;
    const int Inf = 1e9 + 7;
    int nx, ny;
    bool found;
    vector<int> match, S, h;
    vector<vector<int>> adj;
    HopCroft_Karp(int nx, int ny)
    {
        this->nx = nx;
        this->ny = ny;
        adj.resize(nx + 1);
        match.resize(ny + 1, NoMatch);
        h.resize(ny + 1, Inf);
        S.reserve(nx);
        for (int i = 1; i <= nx; ++i)
            S.push_back(i);
    }
    void AddEdge(int x, int y)
    {
        adj[x].push_back(y);
    }
    bool BFS()
    {
        queue<int> q;
        fill(h.begin(), h.end(), 0);
        for (auto i : S)
            for (auto j : adj[i])
                if (h[j] == 0)
                {
                    h[j] = 1;
                    q.push(j);
                }
        while (q.size())
        {
            int c = q.front();
            q.pop();
            int x;
            if ((x = match[c]) == NoMatch)
                return true;
            for (auto i : adj[x])
                if (h[i] == 0)
                {
                    h[i] = h[c] + 1;
                    q.push(i);
                }
        }
        return false;
    }
    void dfs(int x, int lv)
    {
        for (auto i : adj[x])
            if (h[i] == lv + 1)
            {
                if (match[i] != -1)
                    dfs(match[i], lv + 1);
                else
                    found = 1;
                if (found)
                {
                    match[i] = x;
                    return;
                }
            }
    }
    int MaxMatch()
    {
        int ans(0);
        while (BFS())
        {
            for (int i = S.size() - 1; ~i; --i)
            {
                found = 0;
                dfs(S[i], 0);
                if (found)
                {
                    S[i] = S.back();
                    S.pop_back();
                    ++ans;
                }
            }
        }
        return ans;
    }
};
const ll Inf = 1e17;
int n, m, nx, ny;
int row[N][N], col[N][N];
string s[N];

void Read()
{
    cin >> m >> n;
    for (int i = 1; i <= m; ++i)
    {
        cin >> s[i];
        s[i] = " " + s[i];
    }
}

void Solve()
{
    memset(row, -1, sizeof row);
    memset(col, -1, sizeof col);
    for (int i = 1; i <= m; ++i)
        for (int j = 1; j <= n - 2; ++j)
            if (s[i][j] == 'R' && s[i][j + 1] == 'G' && s[i][j + 2] == 'W')
                row[i][j] = ++nx;
    for (int i = 1; i <= m - 2; ++i)
        for (int j = 1; j <= n; ++j)
            if (s[i][j] == 'R' && s[i + 1][j] == 'G' && s[i + 2][j] == 'W')
                col[i][j] = ++ny;
    HopCroft_Karp match(nx, ny);
    for (int i = 1; i <= m; ++i)
        for (int j = 1; j <= n; ++j)
            if (row[i][j] != -1)
            {
                if (col[i][j] != -1)
                    match.AddEdge(row[i][j], col[i][j]);
                if (i > 1 && col[i - 1][j + 1] != -1)
                    match.AddEdge(row[i][j], col[i - 1][j + 1]);
                if (i > 2 && col[i - 2][j + 2] != -1)
                    match.AddEdge(row[i][j], col[i - 2][j + 2]);
            }
    cout << (nx + ny - match.MaxMatch());
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t(1);
    if (typetest)
        cin >> t;
    for (int _ = 1; _ <= t; ++_)
    {
        Read();
        Solve();
    }
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 71096 KB Output is correct
2 Correct 37 ms 71148 KB Output is correct
3 Correct 37 ms 71148 KB Output is correct
4 Correct 36 ms 71148 KB Output is correct
5 Correct 35 ms 71148 KB Output is correct
6 Correct 35 ms 71148 KB Output is correct
7 Correct 38 ms 71168 KB Output is correct
8 Correct 37 ms 71148 KB Output is correct
9 Correct 35 ms 71148 KB Output is correct
10 Correct 37 ms 71148 KB Output is correct
11 Correct 36 ms 71148 KB Output is correct
12 Correct 35 ms 71148 KB Output is correct
13 Correct 35 ms 71148 KB Output is correct
14 Correct 37 ms 71148 KB Output is correct
15 Correct 36 ms 71148 KB Output is correct
16 Correct 36 ms 71148 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 71096 KB Output is correct
2 Correct 37 ms 71148 KB Output is correct
3 Correct 37 ms 71148 KB Output is correct
4 Correct 36 ms 71148 KB Output is correct
5 Correct 35 ms 71148 KB Output is correct
6 Correct 35 ms 71148 KB Output is correct
7 Correct 38 ms 71168 KB Output is correct
8 Correct 37 ms 71148 KB Output is correct
9 Correct 35 ms 71148 KB Output is correct
10 Correct 37 ms 71148 KB Output is correct
11 Correct 36 ms 71148 KB Output is correct
12 Correct 35 ms 71148 KB Output is correct
13 Correct 35 ms 71148 KB Output is correct
14 Correct 37 ms 71148 KB Output is correct
15 Correct 36 ms 71148 KB Output is correct
16 Correct 36 ms 71148 KB Output is correct
17 Correct 37 ms 71148 KB Output is correct
18 Correct 36 ms 71148 KB Output is correct
19 Correct 38 ms 71148 KB Output is correct
20 Correct 36 ms 71148 KB Output is correct
21 Correct 37 ms 71148 KB Output is correct
22 Correct 36 ms 71148 KB Output is correct
23 Correct 36 ms 71148 KB Output is correct
24 Correct 35 ms 71148 KB Output is correct
25 Correct 37 ms 71148 KB Output is correct
26 Correct 35 ms 71148 KB Output is correct
27 Correct 37 ms 71148 KB Output is correct
28 Correct 36 ms 71148 KB Output is correct
29 Correct 36 ms 71148 KB Output is correct
30 Correct 35 ms 71148 KB Output is correct
31 Correct 35 ms 71148 KB Output is correct
32 Correct 36 ms 71148 KB Output is correct
33 Correct 36 ms 71148 KB Output is correct
34 Correct 35 ms 71148 KB Output is correct
35 Correct 35 ms 71148 KB Output is correct
36 Correct 35 ms 71148 KB Output is correct
37 Correct 36 ms 71148 KB Output is correct
38 Correct 43 ms 71148 KB Output is correct
39 Correct 35 ms 71148 KB Output is correct
40 Correct 44 ms 71148 KB Output is correct
41 Correct 39 ms 71148 KB Output is correct
42 Correct 41 ms 71148 KB Output is correct
43 Correct 37 ms 71148 KB Output is correct
44 Correct 36 ms 71148 KB Output is correct
45 Correct 36 ms 71148 KB Output is correct
46 Correct 35 ms 71148 KB Output is correct
47 Correct 36 ms 71148 KB Output is correct
48 Correct 36 ms 71148 KB Output is correct
49 Correct 36 ms 71148 KB Output is correct
50 Correct 35 ms 71148 KB Output is correct
51 Correct 37 ms 71148 KB Output is correct
52 Correct 35 ms 71148 KB Output is correct
53 Correct 36 ms 71148 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 71096 KB Output is correct
2 Correct 37 ms 71148 KB Output is correct
3 Correct 37 ms 71148 KB Output is correct
4 Correct 36 ms 71148 KB Output is correct
5 Correct 35 ms 71148 KB Output is correct
6 Correct 35 ms 71148 KB Output is correct
7 Correct 38 ms 71168 KB Output is correct
8 Correct 37 ms 71148 KB Output is correct
9 Correct 35 ms 71148 KB Output is correct
10 Correct 37 ms 71148 KB Output is correct
11 Correct 36 ms 71148 KB Output is correct
12 Correct 35 ms 71148 KB Output is correct
13 Correct 35 ms 71148 KB Output is correct
14 Correct 37 ms 71148 KB Output is correct
15 Correct 36 ms 71148 KB Output is correct
16 Correct 36 ms 71148 KB Output is correct
17 Correct 37 ms 71148 KB Output is correct
18 Correct 36 ms 71148 KB Output is correct
19 Correct 38 ms 71148 KB Output is correct
20 Correct 36 ms 71148 KB Output is correct
21 Correct 37 ms 71148 KB Output is correct
22 Correct 36 ms 71148 KB Output is correct
23 Correct 36 ms 71148 KB Output is correct
24 Correct 35 ms 71148 KB Output is correct
25 Correct 37 ms 71148 KB Output is correct
26 Correct 35 ms 71148 KB Output is correct
27 Correct 37 ms 71148 KB Output is correct
28 Correct 36 ms 71148 KB Output is correct
29 Correct 36 ms 71148 KB Output is correct
30 Correct 35 ms 71148 KB Output is correct
31 Correct 35 ms 71148 KB Output is correct
32 Correct 36 ms 71148 KB Output is correct
33 Correct 36 ms 71148 KB Output is correct
34 Correct 35 ms 71148 KB Output is correct
35 Correct 35 ms 71148 KB Output is correct
36 Correct 35 ms 71148 KB Output is correct
37 Correct 36 ms 71148 KB Output is correct
38 Correct 43 ms 71148 KB Output is correct
39 Correct 35 ms 71148 KB Output is correct
40 Correct 44 ms 71148 KB Output is correct
41 Correct 39 ms 71148 KB Output is correct
42 Correct 41 ms 71148 KB Output is correct
43 Correct 37 ms 71148 KB Output is correct
44 Correct 36 ms 71148 KB Output is correct
45 Correct 36 ms 71148 KB Output is correct
46 Correct 35 ms 71148 KB Output is correct
47 Correct 36 ms 71148 KB Output is correct
48 Correct 36 ms 71148 KB Output is correct
49 Correct 36 ms 71148 KB Output is correct
50 Correct 35 ms 71148 KB Output is correct
51 Correct 37 ms 71148 KB Output is correct
52 Correct 35 ms 71148 KB Output is correct
53 Correct 36 ms 71148 KB Output is correct
54 Correct 35 ms 71148 KB Output is correct
55 Correct 37 ms 71148 KB Output is correct
56 Correct 36 ms 71276 KB Output is correct
57 Correct 38 ms 71148 KB Output is correct
58 Correct 57 ms 74988 KB Output is correct
59 Correct 220 ms 104300 KB Output is correct
60 Correct 209 ms 104428 KB Output is correct
61 Correct 210 ms 104300 KB Output is correct
62 Correct 37 ms 71148 KB Output is correct
63 Correct 203 ms 103148 KB Output is correct
64 Runtime error 445 ms 262148 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -