oj.uz

답안 #139232

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
139232 2019-07-31T12:41:01 Z Minnakhmetov 바이러스 (JOI19_virus) C++14
100 / 100
 334 ms 35032 KB 
#include<bits/stdc++.h>
using namespace std;
 
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()

const int N = 805, M = 2e5 + 5, C = N * N, INF = 1e9;
const char dir[5] = "WESN";
const int dx[4] = { 0, 0, -1, 1 }, dy[4] = { 1, -1, 0, 0 };
int u[N][N], mx_seq[1 << 4], a[M], used[N][N], q[C], mask[N][N], last_us[N][N], comp[N][N], ans[N][N];
bool isSpec[N][N], isDead[C];
pair<int, int> comp_spec[C];

int st_cnt = 0, m, r, c;

int findSet(int v) {
    return q[v] < 0 ? v : q[v] = findSet(q[v]);
}

int toNum(int x, int y) {
    return x * c + y;
}

void connect(int a, int b) {
    a = findSet(a);
    b = findSet(b);

    isSpec[comp_spec[a].first][comp_spec[a].second] = false;

    auto spec = comp_spec[b];

    if (q[a] > q[b])
        swap(a, b);

    isDead[a] = isDead[a] || isDead[b];
    q[a] += q[b];
    q[b] = a;
    comp_spec[a] = spec;
    comp[spec.first][spec.second] = a;
}

bool bfs(int sx, int sy) {
    queue<pair<int, int>> q;
    q.push({sx, sy});
    used[sx][sy] = ++st_cnt;

    int cur_comp = findSet(toNum(sx, sy)),
        infected_count = 1;

    vector<pair<int, int>> visited;

    while (!q.empty()) {
        pair<int, int> node = q.front();
        q.pop();

        visited.push_back(node);

        for (int i = 0; i < 4; i++) {
            int x = node.first + dx[i],
                y = node.second + dy[i];


            if (x >= 0 && x < r && y >= 0 && y < c && 
                used[x][y] != st_cnt) {

                if (last_us[x][y] != st_cnt) {
                    mask[x][y] = 0;
                    last_us[x][y] = st_cnt;
                }

                mask[x][y] |= 1 << i;

                // cout << node.first << " " << node.second << " " << x << " " << y << "\n";

                if (mx_seq[mask[x][y]] >= u[x][y]) {
                    int oth_comp = findSet(toNum(x, y));

                    if (oth_comp != cur_comp) {
                        connect(cur_comp, oth_comp);
                        return false;
                    }

                    infected_count++;
                    used[x][y] = st_cnt;
                    q.push({x, y});
                }
            }
        }
    }

    for (auto p : visited) {
        ans[p.first][p.second] = infected_count;
    }

    return true;
}

signed main() { 
#ifdef HOME
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    string s;
    

    cin >> m >> r >> c >> s;

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

            isSpec[i][j] = 1;
            comp[i][j] = toNum(i, j);
            comp_spec[comp[i][j]] = { i, j };
            if (u[i][j] == 0)
                u[i][j] = INF + 1;
            ans[i][j] = INF;
        }
    }

    for (char &c : s) {
        c = find(dir, dir + 4, c) - dir;
    }

    s += s;
    m *= 2;

    for (int i = 0; i < (1 << 4); i++) {
        for (int j = 0; j < m; j++) {
            a[j] = (i >> s[j]) & 1;
        }
        for (int j = 0, k = -1; j < m; j++) {
            if (a[j]) {
                if (j == m - 1 || a[j + 1] == 0)
                    mx_seq[i] = max(mx_seq[i], j - k);
            }
            else {
                k = j;
            }
        }
        if (mx_seq[i] == m)
            mx_seq[i] = INF;
    }

    fill(q, q + C, -1);

    bool work = true;

    while (work) {
        work = false;

        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                if (isSpec[i][j] && !isDead[comp[i][j]] && u[i][j] < INF) {
                    if (bfs(i, j))
                        isDead[comp[i][j]] = 1;
                    else
                        work = true;
                }
            }
        }

        // for (int x = 0; x < r; x++) {
        //     for (int y = 0; y < c; y++) {
        //         cout << findSet(toNum(x, y)) << " ";
        //     }
        //     cout << "\n";
        // }
        // cout << "\n";
        // for (int x = 0; x < r; x++) {
        //     for (int y = 0; y < c; y++) {
        //         cout << ans[x][y] << " ";
        //     }
        //     cout << "\n";
        // }
        // cout << "\n";
        // for (int x = 0; x < r; x++) {
        //     for (int y = 0; y < c; y++) {
        //         cout << isDead[findSet(toNum(x, y))] << " ";
        //     }
        //     cout << "\n";
        // }
        // cout << "\n";
        // cout << "\n";
        // cout << "\n";
    }


    int mn = INF, ct = 0;
    for (int i = 0; i < r; i++) {
        for (int j = 0; j < c; j++) {
            if (ans[i][j] < mn) {
                mn = ans[i][j];
                ct = 0;
            }
            if (ans[i][j] == mn) {
                ct++;
            }
        }
    }

    cout << mn << "\n" << ct;


    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 3832 KB Output is correct
2 Correct 183 ms 25632 KB Output is correct
3 Correct 190 ms 27896 KB Output is correct
4 Correct 168 ms 25388 KB Output is correct
5 Correct 204 ms 28136 KB Output is correct
6 Correct 17 ms 16504 KB Output is correct
7 Correct 223 ms 26780 KB Output is correct
8 Correct 96 ms 17692 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3192 KB Output is correct
2 Correct 11 ms 4252 KB Output is correct
3 Correct 24 ms 4384 KB Output is correct
4 Correct 13 ms 4380 KB Output is correct
5 Correct 25 ms 4124 KB Output is correct
6 Correct 25 ms 5148 KB Output is correct
7 Correct 4 ms 3196 KB Output is correct
8 Correct 24 ms 5148 KB Output is correct
9 Correct 6 ms 3832 KB Output is correct
10 Correct 12 ms 4304 KB Output is correct
11 Correct 6 ms 3960 KB Output is correct
12 Correct 6 ms 3960 KB Output is correct
13 Correct 23 ms 5148 KB Output is correct
14 Correct 23 ms 5148 KB Output is correct
15 Correct 24 ms 5148 KB Output is correct
16 Correct 24 ms 5172 KB Output is correct
17 Correct 16 ms 4600 KB Output is correct
18 Correct 6 ms 3960 KB Output is correct
19 Correct 25 ms 5144 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 3832 KB Output is correct
2 Correct 183 ms 25632 KB Output is correct
3 Correct 190 ms 27896 KB Output is correct
4 Correct 168 ms 25388 KB Output is correct
5 Correct 204 ms 28136 KB Output is correct
6 Correct 17 ms 16504 KB Output is correct
7 Correct 223 ms 26780 KB Output is correct
8 Correct 96 ms 17692 KB Output is correct
9 Correct 5 ms 3192 KB Output is correct
10 Correct 11 ms 4252 KB Output is correct
11 Correct 24 ms 4384 KB Output is correct
12 Correct 13 ms 4380 KB Output is correct
13 Correct 25 ms 4124 KB Output is correct
14 Correct 25 ms 5148 KB Output is correct
15 Correct 4 ms 3196 KB Output is correct
16 Correct 24 ms 5148 KB Output is correct
17 Correct 6 ms 3832 KB Output is correct
18 Correct 12 ms 4304 KB Output is correct
19 Correct 6 ms 3960 KB Output is correct
20 Correct 6 ms 3960 KB Output is correct
21 Correct 23 ms 5148 KB Output is correct
22 Correct 23 ms 5148 KB Output is correct
23 Correct 24 ms 5148 KB Output is correct
24 Correct 24 ms 5172 KB Output is correct
25 Correct 16 ms 4600 KB Output is correct
26 Correct 6 ms 3960 KB Output is correct
27 Correct 25 ms 5144 KB Output is correct
28 Correct 254 ms 35032 KB Output is correct
29 Correct 223 ms 30988 KB Output is correct
30 Correct 185 ms 26908 KB Output is correct
31 Correct 219 ms 26140 KB Output is correct
32 Correct 277 ms 25404 KB Output is correct
33 Correct 182 ms 25756 KB Output is correct
34 Correct 334 ms 33956 KB Output is correct
35 Correct 234 ms 24556 KB Output is correct
36 Correct 293 ms 26152 KB Output is correct
37 Correct 282 ms 29556 KB Output is correct
38 Correct 235 ms 33888 KB Output is correct
39 Correct 232 ms 27808 KB Output is correct
40 Correct 242 ms 27804 KB Output is correct
41 Correct 189 ms 26356 KB Output is correct
42 Correct 230 ms 30416 KB Output is correct
43 Correct 191 ms 26908 KB Output is correct
44 Correct 99 ms 17564 KB Output is correct