oj.uz

Submission #400446

# Submission time Handle Problem Language Result Execution time Memory
400446 2021-05-08T04:34:13 Z timmyfeng Virus Experiment (JOI19_virus) C++17
100 / 100
 890 ms 173056 KB 
#include <bits/stdc++.h>
using namespace std;

const int I[] = {1, 0, -1, 0}, J[] = {0, 1, 0, -1};
const string D = "SENW";

const int N = 800;

int resist[N][N], wind[1 << 4], r, c;

int visited[N * N], in_path[N * N], color[N * N];
vector<int> scc[N * N], adj[N * N], path;

bool check(int i, int j, int k) {
    int mask = 0;
    for (int d = 0; d < 4; ++d) {
        int i_new = i + I[d], j_new = j + J[d];
        if (0 <= i_new && i_new < r && 0 <= j_new && j_new < c) {
            if (color[i_new * c + j_new] == k) {
                mask |= 1 << d;
            }
        }
    }
    return resist[i][j] > 0 && resist[i][j] <= wind[mask];
}

void process(vector<int> &nodes, vector<int> &out) {
    for (auto u : nodes) {
        int i = u / c, j = u % c;
        for (int d = 0; d < 4; ++d) {
            int i_new = i + I[d], j_new = j + J[d];
            if (0 <= i_new && i_new < r && 0 <= j_new && j_new < c) {
                if (check(i_new, j_new, color[u])) {
                    out.push_back(i_new * c + j_new);
                }
            }
        }
    }
}

void dfs(int u) {
    visited[u] = in_path[u] = true;
    path.push_back(color[u]);

    for (int i = 0; i < (int) adj[u].size(); ++i) {
        int c = adj[u][i];

        if (!visited[c]) {
            dfs(c);

            if (color[u] != path.back()) {
                for (auto v : scc[path.back()]) {
                    in_path[v] = false;
                }
                path.pop_back();
            }
        } else if (in_path[c]) {
            int x = path.back();
            path.pop_back();

            while (color[c] != x) {
                int y = path.back();
                path.pop_back();

                if (scc[x].size() < scc[y].size()) {
                    swap(x, y);
                }

                for (auto v : scc[y]) {
                    color[v] = x;
                }

                scc[x].insert(scc[x].end(), scc[y].begin(), scc[y].end());
                process(scc[y], adj[u]);
                scc[y].clear();
            }

            path.push_back(x);
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int m;
    string d;
    cin >> m >> r >> c >> d;

    for (int i = 0; i < r; ++i) {
        for (int j = 0; j < c; ++j) {
            cin >> resist[i][j];
        }
    }

    for (int i = 0; i < (1 << 4); ++i) {
        int len = 0;
        for (int j = 0; j < 2 * m; ++j) {
            int dir = find(D.begin(), D.end(), d[j % m]) - D.begin();
            if ((i & (1 << dir)) > 0) {
                wind[i] = max(wind[i], ++len);
            } else {
                len = 0;
            }
        }

        if (len == 2 * m) {
            wind[i] = INT_MAX;
        }
    }

    iota(color, color + r * c, 0);
    for (int i = 0; i < r * c; ++i) {
        scc[i] = {i};
        process(scc[i], adj[i]);
    }

    for (int i = 0; i < r * c; ++i) {
        if (visited[i] == 0) {
            dfs(i);
            for (auto j : scc[path.back()]) {
                in_path[j] = false;
            }
            path.pop_back();
        }
    }

    map<int, char> ids;
    set<pair<char, char>> edges;
    for (int i = 0; i < r; ++i) {
        for (int j = 0; j < c; ++j) {
            if (ids.count(color[i * c + j]) == 0) {
                ids[color[i * c + j]] = 'a' + (int) ids.size();
            }
        }
    }

    int mini = INT_MAX, ways = 0;
    for (int i = 0; i < r * c; ++i) {
        bool leaf = !scc[i].empty();
        for (auto j : scc[i]) {
            for (auto k : adj[j]) {
                leaf &= color[k] == i;

                if (i != color[k]) {
                    edges.insert({ids[i], ids[color[k]]});
                }
            }
        }

        if (leaf && resist[i / c][i % c] > 0) {
            if ((int) scc[i].size() < mini) {
                mini = scc[i].size();
                ways = 0;
            }

            if ((int) scc[i].size() == mini) {
                ways += mini;
            }
        }
    }

    cout << mini << "\n";
    cout << ways << "\n";
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 30532 KB Output is correct
2 Correct 583 ms 101708 KB Output is correct
3 Correct 594 ms 110636 KB Output is correct
4 Correct 576 ms 110560 KB Output is correct
5 Correct 409 ms 90380 KB Output is correct
6 Correct 18 ms 32968 KB Output is correct
7 Correct 359 ms 90328 KB Output is correct
8 Correct 195 ms 54544 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 30432 KB Output is correct
2 Correct 34 ms 30672 KB Output is correct
3 Correct 62 ms 30616 KB Output is correct
4 Correct 35 ms 30620 KB Output is correct
5 Correct 61 ms 30600 KB Output is correct
6 Correct 63 ms 31172 KB Output is correct
7 Correct 17 ms 30412 KB Output is correct
8 Correct 61 ms 30748 KB Output is correct
9 Correct 19 ms 30796 KB Output is correct
10 Correct 34 ms 30628 KB Output is correct
11 Correct 19 ms 30796 KB Output is correct
12 Correct 20 ms 30940 KB Output is correct
13 Correct 61 ms 31028 KB Output is correct
14 Correct 61 ms 31032 KB Output is correct
15 Correct 60 ms 30988 KB Output is correct
16 Correct 61 ms 31032 KB Output is correct
17 Correct 42 ms 30916 KB Output is correct
18 Correct 21 ms 30772 KB Output is correct
19 Correct 64 ms 30860 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 30532 KB Output is correct
2 Correct 583 ms 101708 KB Output is correct
3 Correct 594 ms 110636 KB Output is correct
4 Correct 576 ms 110560 KB Output is correct
5 Correct 409 ms 90380 KB Output is correct
6 Correct 18 ms 32968 KB Output is correct
7 Correct 359 ms 90328 KB Output is correct
8 Correct 195 ms 54544 KB Output is correct
9 Correct 17 ms 30432 KB Output is correct
10 Correct 34 ms 30672 KB Output is correct
11 Correct 62 ms 30616 KB Output is correct
12 Correct 35 ms 30620 KB Output is correct
13 Correct 61 ms 30600 KB Output is correct
14 Correct 63 ms 31172 KB Output is correct
15 Correct 17 ms 30412 KB Output is correct
16 Correct 61 ms 30748 KB Output is correct
17 Correct 19 ms 30796 KB Output is correct
18 Correct 34 ms 30628 KB Output is correct
19 Correct 19 ms 30796 KB Output is correct
20 Correct 20 ms 30940 KB Output is correct
21 Correct 61 ms 31028 KB Output is correct
22 Correct 61 ms 31032 KB Output is correct
23 Correct 60 ms 30988 KB Output is correct
24 Correct 61 ms 31032 KB Output is correct
25 Correct 42 ms 30916 KB Output is correct
26 Correct 21 ms 30772 KB Output is correct
27 Correct 64 ms 30860 KB Output is correct
28 Correct 654 ms 173056 KB Output is correct
29 Correct 683 ms 156776 KB Output is correct
30 Correct 441 ms 98240 KB Output is correct
31 Correct 760 ms 118992 KB Output is correct
32 Correct 732 ms 119588 KB Output is correct
33 Correct 623 ms 107588 KB Output is correct
34 Correct 755 ms 156160 KB Output is correct
35 Correct 509 ms 119828 KB Output is correct
36 Correct 725 ms 117212 KB Output is correct
37 Correct 709 ms 130476 KB Output is correct
38 Correct 675 ms 172448 KB Output is correct
39 Correct 730 ms 107716 KB Output is correct
40 Correct 777 ms 106960 KB Output is correct
41 Correct 625 ms 110192 KB Output is correct
42 Correct 704 ms 133520 KB Output is correct
43 Correct 890 ms 110176 KB Output is correct
44 Correct 203 ms 56004 KB Output is correct