oj.uz

답안 #795713

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
795713 2023-07-27T13:21:49 Z someone 바이러스 (JOI19_virus) C++14
100 / 100
 408 ms 132536 KB 
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;

const int N = 2e5 + 42, M = 805, INF = 1e9 + 42;

int dl[] = {-1, 0, 1, 0},
    dc[] = {0, -1, 0, 1};
char ch[N], w[] = {'N', 'W', 'S', 'E'};

pair<int, int> acces[M][M], same[M][M];
vector<pair<int, int>> cfc[M][M], toAdd[M][M];
int m, row, col, mini = INF, nb = 0, maxi[16], u[M][M];

pair<int, int> getCFC(pair<int, int> coo) {
    if(same[coo.x][coo.y] == coo)
        return coo;
    return same[coo.x][coo.y] = getCFC(same[coo.x][coo.y]);
}

pair<int, int> getAcces(pair<int, int> coo) {
    if(acces[coo.x][coo.y] == coo)
        return coo;
    return acces[coo.x][coo.y] = getAcces(acces[coo.x][coo.y]);
}

inline bool valid(int x, int y) {
    return -1 < x && x < row && -1 < y && y < col;
}

inline bool hasAcces(int l, int c, int x, int y) {
    int mask = 0;
    for(int i = 0; i < 4; i++) {
        int adjX = l + dl[i], adjY = c + dc[i];
        if(valid(adjX, adjY) && getCFC({x, y}) == getCFC({adjX, adjY}))
            mask += (1 << i);
    }
    return u[l][c] <= maxi[mask];
}

void solve() {
    vector<pair<int, int>> candidat;
    for(int i = 0; i < row; i++)
        for(int j = 0; j < col; j++)
            if(u[i][j] != INF)
                candidat.push_back({i, j});
    while(!candidat.empty()) {
        pair<int, int> cand = candidat.back();
        candidat.pop_back();

        bool nouv = false;
        while(!toAdd[cand.x][cand.y].empty()) {
            pair<int, int> coo = toAdd[cand.x][cand.y].back();
            toAdd[cand.x][cand.y].pop_back();
            if(valid(coo.x, coo.y)) {
                for(int i = 0; i < 4 && !nouv; i++) {
                    int x = coo.x + dl[i], y = coo.y + dc[i];
                    if(valid(x, y) && getCFC(coo) != getCFC({x, y}) && hasAcces(x, y, coo.x, coo.y)) {
                        nouv = true;
                        if(getAcces({x, y}) != cand) {
                            acces[cand.x][cand.y] = getCFC({x, y});
                        } else {
                            auto act = cand, pre = getCFC({x, y});
                            if(cfc[act.x][act.y].size() < cfc[pre.x][pre.y].size()) {
                                swap(cfc[pre.x][pre.y], cfc[pre.x][pre.y]);
                                swap(toAdd[pre.x][pre.y], toAdd[pre.x][pre.y]);
                            }
                            for(pair<int, int> cas : cfc[pre.x][pre.y]) {
                                cfc[act.x][act.y].push_back(cas);
                                toAdd[act.x][act.y].push_back(cas);
                            }
                            toAdd[act.x][act.y].push_back(coo);
                            same[pre.x][pre.y] = act;
                            acces[pre.x][pre.y] = act;
                            candidat.push_back(act);
                        }
                    }
                }
            }
            if(nouv) break;
        }
        if(!nouv) {
            int sz = (int)cfc[cand.x][cand.y].size();
            if(mini == sz) nb += sz;
            else if(mini > sz) mini = nb = sz;
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> m >> row >> col;
    for(int i = 0; i < m; i++)
        cin >> ch[i];
    for(int i = 0; i < m; i++)
        ch[i + m] = ch[i];
    for(int i = 0; i < 16; i++) {
        int len = 0;
        for(int j = 0; j < 2*m; j++) {
            int wind = 0;
            for(int k = 0; k < 4; k++)
                if(w[k] == ch[j] && (i & (1 << k)))
                    wind = 1;
            if(wind == 0)
                len = 0;
            else
                len++;
            maxi[i] = max(maxi[i], len);
        }
        if(maxi[i] == 2*m) maxi[i] = N;
    }

    for(int i = 0; i < row; i++)
        for(int j = 0; j < col; j++) {
            cin >> u[i][j];
            if(u[i][j] == 0)
                u[i][j] = INF;
            cfc[i][j].push_back({i, j});
            toAdd[i][j].push_back({i, j});
            same[i][j] = acces[i][j] = {i, j};
        }

    solve();
    cout << mini << '\n' << nb << '\n';
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 31036 KB Output is correct
2 Correct 222 ms 91792 KB Output is correct
3 Correct 205 ms 91792 KB Output is correct
4 Correct 151 ms 91752 KB Output is correct
5 Correct 218 ms 91728 KB Output is correct
6 Correct 19 ms 39636 KB Output is correct
7 Correct 408 ms 95044 KB Output is correct
8 Correct 115 ms 56680 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 30764 KB Output is correct
2 Correct 28 ms 30956 KB Output is correct
3 Correct 47 ms 31052 KB Output is correct
4 Correct 26 ms 31060 KB Output is correct
5 Correct 48 ms 30932 KB Output is correct
6 Correct 51 ms 31848 KB Output is correct
7 Correct 15 ms 30848 KB Output is correct
8 Correct 48 ms 31476 KB Output is correct
9 Correct 16 ms 31444 KB Output is correct
10 Correct 27 ms 30960 KB Output is correct
11 Correct 16 ms 31556 KB Output is correct
12 Correct 16 ms 31608 KB Output is correct
13 Correct 48 ms 31712 KB Output is correct
14 Correct 46 ms 31728 KB Output is correct
15 Correct 50 ms 31692 KB Output is correct
16 Correct 46 ms 31740 KB Output is correct
17 Correct 32 ms 31636 KB Output is correct
18 Correct 17 ms 31568 KB Output is correct
19 Correct 49 ms 31720 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 31036 KB Output is correct
2 Correct 222 ms 91792 KB Output is correct
3 Correct 205 ms 91792 KB Output is correct
4 Correct 151 ms 91752 KB Output is correct
5 Correct 218 ms 91728 KB Output is correct
6 Correct 19 ms 39636 KB Output is correct
7 Correct 408 ms 95044 KB Output is correct
8 Correct 115 ms 56680 KB Output is correct
9 Correct 17 ms 30764 KB Output is correct
10 Correct 28 ms 30956 KB Output is correct
11 Correct 47 ms 31052 KB Output is correct
12 Correct 26 ms 31060 KB Output is correct
13 Correct 48 ms 30932 KB Output is correct
14 Correct 51 ms 31848 KB Output is correct
15 Correct 15 ms 30848 KB Output is correct
16 Correct 48 ms 31476 KB Output is correct
17 Correct 16 ms 31444 KB Output is correct
18 Correct 27 ms 30960 KB Output is correct
19 Correct 16 ms 31556 KB Output is correct
20 Correct 16 ms 31608 KB Output is correct
21 Correct 48 ms 31712 KB Output is correct
22 Correct 46 ms 31728 KB Output is correct
23 Correct 50 ms 31692 KB Output is correct
24 Correct 46 ms 31740 KB Output is correct
25 Correct 32 ms 31636 KB Output is correct
26 Correct 17 ms 31568 KB Output is correct
27 Correct 49 ms 31720 KB Output is correct
28 Correct 341 ms 111284 KB Output is correct
29 Correct 175 ms 91988 KB Output is correct
30 Correct 186 ms 91896 KB Output is correct
31 Correct 259 ms 93604 KB Output is correct
32 Correct 236 ms 95168 KB Output is correct
33 Correct 158 ms 91780 KB Output is correct
34 Correct 364 ms 132536 KB Output is correct
35 Correct 220 ms 86484 KB Output is correct
36 Correct 322 ms 102848 KB Output is correct
37 Correct 302 ms 114180 KB Output is correct
38 Correct 276 ms 108792 KB Output is correct
39 Correct 235 ms 91968 KB Output is correct
40 Correct 272 ms 91892 KB Output is correct
41 Correct 147 ms 91888 KB Output is correct
42 Correct 367 ms 106964 KB Output is correct
43 Correct 183 ms 91968 KB Output is correct
44 Correct 117 ms 56668 KB Output is correct