oj.uz

Submission #895572

# Submission time Handle Problem Language Result Execution time Memory
895572 2023-12-30T09:25:54 Z Alcabel Virus Experiment (JOI19_virus) C++17
100 / 100
 180 ms 14948 KB 
#include <bits/stdc++.h>
using namespace std;

char dir[4] = {'N', 'E', 'S', 'W'};
int dr[4] = {-1, 0, 1, 0}, dc[4] = {0, 1, 0, -1};
vector<vector<pair<int, int>>> par;

pair<int, int> getParent(pair<int, int> v) {
    if (par[v.first][v.second] != v) {
        par[v.first][v.second] = getParent(par[v.first][v.second]);
    }
    return par[v.first][v.second];
}

void solve() {
    int len, n, m;
    cin >> len >> n >> m;
    string s;
    cin >> s;
    vector<vector<int>> a(n, vector<int>(m));
    par.resize(n);
    for (int i = 0; i < n; ++i) {
        par[i].resize(m);
        for (int j = 0; j < m; ++j) {
            cin >> a[i][j];
            a[i][j] = min(a[i][j], len);
            par[i][j] = {i, j};
        }
    }
    s += s;
    vector<int> longestSeg(1 << 4);
    for (int mask = 1; mask < (1 << 4); ++mask) {
        for (int i = 0, last = -1; i < 2 * len; ++i) {
            bool within = false;
            if (s[i] == 'N') {
                within = (mask & 1);
            } else if (s[i] == 'E') {
                within = (mask & 2);
            } else if (s[i] == 'S') {
                within = (mask & 4);
            } else {
                within = (mask & 8);
            }
            if (within) {
                longestSeg[mask] = max(longestSeg[mask], i - last);
            } else {
                last = i;
            }
        }
        longestSeg[mask] = min(longestSeg[mask], len);
        // cerr << "mask: " << mask << ", longest: " << longestSeg[mask] << '\n';
    }
    // cerr << "!\n";
    vector<vector<char>> term(n, vector<char>(m));
    vector<vector<int>> vis(n, vector<int>(m, -1));
    int tt = -1;
    queue<pair<int, int>> q;
    bool action = true;
    pair<int, int> ans = {n * m + 10, 0};
    while (action) {
        action = false;
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                if (a[i][j] > 0 && getParent({i, j}) == make_pair(i, j) && !term[i][j]) {
                    // cerr << "(" << i << ' ' << j << ")\n";
                    action = true;
                    q.emplace(i, j);
                    pair<int, int> nxt = {-1, -1};
                    int cnt = 0;
                    ++tt;
                    while (!q.empty()) {
                        auto [r, c] = q.front();
                        q.pop();
                        if (vis[r][c] == tt) {
                            continue;
                        }
                        // cerr << r << ' ' << c << '\n';
                        vis[r][c] = tt;
                        ++cnt;
                        for (int d = 0; d < 4; ++d) {
                            int newR = r + dr[d], newC = c + dc[d];
                            if (newR >= 0 && newR < n && newC >= 0 && newC < m && a[newR][newC] > 0 && vis[newR][newC] < tt) {
                                // cerr << "newR: " << newR << ", newC
                                int mask = 0;
                                for (int _d = 0; _d < 4; ++_d) {
                                    int coverR = newR + dr[_d], coverC = newC + dc[_d];
                                    if (coverR >= 0 && coverR < n && coverC >= 0 && coverC < m && vis[coverR][coverC] == tt) {
                                        mask |= (1 << _d);
                                    }
                                }
                                // cerr << "newR: " << newR << ", newC: " << newC << ", mask: " << mask << '\n';
                                if (longestSeg[mask] >= a[newR][newC]) {
                                    if (getParent({newR, newC}) == make_pair(i, j)) {
                                        q.emplace(newR, newC);
                                    } else {
                                        nxt = getParent({newR, newC});
                                        break;
                                    }
                                }
                                
                            }
                        }
                        if (nxt.first != -1) {
                            break;
                        }
                    }
                    while (!q.empty()) { q.pop(); }
                    // cerr << "nxt: " << nxt.first << ' ' << nxt.second << '\n';
                    if (nxt.first == -1) {
                        // cerr << "!\n";
                        term[i][j] = true;
                        if (cnt < ans.first) {
                            ans = {cnt, 0};
                        }
                        if (cnt == ans.first) {
                            ans.second += cnt;
                        }
                    } else if (term[nxt.first][nxt.second]) {
                        term[i][j] = true;
                    } else {
                        par[i][j] = nxt;
                    }
                }
            }
        }
    }
    cout << ans.first << ' ' << ans.second << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
        cerr << "-----------\n";
        cout << "-----------\n";
    }
#else
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
#endif

    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 600 KB Output is correct
2 Correct 73 ms 12528 KB Output is correct
3 Correct 81 ms 14948 KB Output is correct
4 Correct 72 ms 12376 KB Output is correct
5 Correct 91 ms 14924 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 109 ms 12560 KB Output is correct
8 Correct 50 ms 6324 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 428 KB Output is correct
2 Correct 3 ms 856 KB Output is correct
3 Correct 19 ms 860 KB Output is correct
4 Correct 5 ms 1112 KB Output is correct
5 Correct 19 ms 860 KB Output is correct
6 Correct 19 ms 860 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 19 ms 860 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Correct 1 ms 476 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 16 ms 860 KB Output is correct
14 Correct 16 ms 860 KB Output is correct
15 Correct 20 ms 840 KB Output is correct
16 Correct 16 ms 860 KB Output is correct
17 Correct 10 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 19 ms 860 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 600 KB Output is correct
2 Correct 73 ms 12528 KB Output is correct
3 Correct 81 ms 14948 KB Output is correct
4 Correct 72 ms 12376 KB Output is correct
5 Correct 91 ms 14924 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 109 ms 12560 KB Output is correct
8 Correct 50 ms 6324 KB Output is correct
9 Correct 0 ms 428 KB Output is correct
10 Correct 3 ms 856 KB Output is correct
11 Correct 19 ms 860 KB Output is correct
12 Correct 5 ms 1112 KB Output is correct
13 Correct 19 ms 860 KB Output is correct
14 Correct 19 ms 860 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 19 ms 860 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 4 ms 860 KB Output is correct
19 Correct 1 ms 476 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 16 ms 860 KB Output is correct
22 Correct 16 ms 860 KB Output is correct
23 Correct 20 ms 840 KB Output is correct
24 Correct 16 ms 860 KB Output is correct
25 Correct 10 ms 604 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 19 ms 860 KB Output is correct
28 Correct 132 ms 12748 KB Output is correct
29 Correct 69 ms 12628 KB Output is correct
30 Correct 84 ms 12832 KB Output is correct
31 Correct 111 ms 12388 KB Output is correct
32 Correct 94 ms 12112 KB Output is correct
33 Correct 74 ms 12628 KB Output is correct
34 Correct 180 ms 12524 KB Output is correct
35 Correct 90 ms 9556 KB Output is correct
36 Correct 132 ms 12860 KB Output is correct
37 Correct 108 ms 12712 KB Output is correct
38 Correct 109 ms 12380 KB Output is correct
39 Correct 99 ms 13536 KB Output is correct
40 Correct 111 ms 13780 KB Output is correct
41 Correct 54 ms 12624 KB Output is correct
42 Correct 111 ms 11860 KB Output is correct
43 Correct 71 ms 12880 KB Output is correct
44 Correct 49 ms 6332 KB Output is correct