oj.uz

답안 #800682

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
800682 2023-08-01T18:07:04 Z rnl42 바이러스 (JOI19_virus) C++14
100 / 100
 344 ms 24712 KB 
#include <bits/stdc++.h>
using namespace std;
#define amax(a, b) a = max(a, b)
#define cellid(r, c) (r*C+c)
#define extract(cell) (cell/C)][(cell%C)
    
string to_string(string s) { return s; }
template <typename T> string to_string(T v) {
    bool first = true;
    string res = "[";
    for (const auto &x : v) {
        if (!first)
            res += ", ";
        first = false;
        res += to_string(x);
    }
    res += "]";
    return res;
}
    
template <typename A, typename B>
string to_string(pair<A, B> p) {
    return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
    
void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
    cout << ' ' << to_string(H);
    dbg_out(T...);
}
    
#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
    
    
constexpr int INF = 1e9+42;
    
int M, R, C;
vector<vector<int>> U;
    
string to_s(int cell) {
    return to_string(cell/C)+","+to_string(cell%C);
}
    
struct patate {
    int centre;
    int num_cases = 1;
    bool operator<(const patate& other) const {
        return num_cases > other.num_cases;
    }
};
    
struct Dir {
    int v, h;
    inline bool ok(int cell) {
        int r = cell/C, c = cell%C;
        if (0 <= r+v && r+v < R && 0 <= c+h && c+h < C && U[r+v][c+h]) {
            return true;
        } else {
            return false;
        }
    }
    inline int next(int cell) {
        return cell+h+v*C;
    }
};
    
const Dir DIRS[] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
    
int maxconsecutive[1<<4];
//vector<patate> patates;
vector<int> uf;
vector<int> numchilds;
priority_queue<patate> pq;
int timer = 1;
vector<int> vu;
vector<int> bestcost;
int ans = INF;
int ansq = 0;
//vector<int> maskvoisin;
    
int root(int u) {
    return uf[u] == u ? u : uf[u] = root(uf[u]);
}
    
int main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cin >> M >> R >> C;
    string dirs;
    cin >> dirs;
    dirs.append(dirs);
    char _map[256];
    _map['S'] = 0;
    _map['W'] = 1;
    _map['N'] = 2;
    _map['E'] = 3;
    uf.resize(R*C);
    vu.resize(R*C);
    numchilds.assign(R*C, 1);
    bestcost.assign(R*C, INF);
    iota(uf.begin(), uf.end(), 0);
    for (int mask = 0; mask < 1<<4; mask++) {
        int l = 0;
        for (char c : dirs) {
            if ((mask >> _map[(unsigned char)c]) & 1) l++;
            else l = 0;
            maxconsecutive[mask] = max(maxconsecutive[mask], l);
        }
        if (maxconsecutive[mask] >= M) maxconsecutive[mask] = INF;
    }
    U.assign(R, vector<int>(C));
    for (int r = 0; r < R; r++) {
        for (int c = 0; c < C; c++) {
            cin >> U[r][c];
            if (U[r][c]) {
                pq.push({cellid(r, c), 1});
            }
        }
    }
    
    while (!pq.empty()) {
        auto cur = pq.top(); pq.pop();
        if (root(cur.centre) != cur.centre || numchilds[cur.centre] != cur.num_cases) continue;
    
        timer++;
        queue<int> q;
        q.push(cur.centre);
        vu[cur.centre] = timer;
        bool stopbfs = false;
        int num_explore = 0;
        vector<int> explored;
        while (!q.empty() && !stopbfs) {
            auto u = q.front(); q.pop();
            explored.push_back(u);
            num_explore++;
            for (auto dir : DIRS) {
                int next = dir.next(u);
                //cerr << "dir" << dir.v << ":" << dir.h << "   u=" << u << endl;
                if (dir.ok(u)) {
                    int i = 2;
                    int mask = 0;
                    for (auto dir2 : DIRS) {
                        int k = dir2.next(next);
                        if (dir2.ok(next) && vu[k] == vu[cur.centre]) {
                            mask += 1<<i;
                        }
                        i++, i &= 3;
                    }
                    //cerr << "vers dir" << dir.v << ":" << dir.h << "   mask=" << mask << endl;
                    if (U[extract(next)] <= maxconsecutive[mask]) {
                        if (vu[next] != timer && root(next) == cur.centre) {
                            vu[next] = timer;
                            q.push(next);
                        } else if (root(next) != cur.centre) {
                            //cerr << "FUSION " << to_s(root(cur.centre)) << " " << to_s(root(next)) << endl;
                            uf[cur.centre] = root(next);
                            numchilds[root(next)] += numchilds[cur.centre];
                            //cerr << "push " << to_s(root(next)) << " " << numchilds[root(cur.centre)] << endl;
                            pq.push({root(next), numchilds[root(next)]});
                            stopbfs = true;
                            break;
                        }
                    }
                }
            }
        }
        if (!stopbfs) {
            ans = min(ans, num_explore);
            for (auto k : explored) {
                bestcost[k] = min(bestcost[k], num_explore);
            }
        }
    }

    for (int i = 0; i < R*C; i++) {
        if (bestcost[i] == ans) ansq++;
    }
    cout << ans << '\n' << ansq << '\n';
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 468 KB Output is correct
2 Correct 232 ms 21224 KB Output is correct
3 Correct 234 ms 21152 KB Output is correct
4 Correct 234 ms 21196 KB Output is correct
5 Correct 171 ms 21176 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 286 ms 21416 KB Output is correct
8 Correct 64 ms 7532 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 6 ms 724 KB Output is correct
3 Correct 5 ms 724 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 4 ms 724 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 4 ms 724 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 5 ms 724 KB Output is correct
14 Correct 5 ms 724 KB Output is correct
15 Correct 6 ms 724 KB Output is correct
16 Correct 5 ms 724 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 6 ms 724 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 468 KB Output is correct
2 Correct 232 ms 21224 KB Output is correct
3 Correct 234 ms 21152 KB Output is correct
4 Correct 234 ms 21196 KB Output is correct
5 Correct 171 ms 21176 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 286 ms 21416 KB Output is correct
8 Correct 64 ms 7532 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 6 ms 724 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 4 ms 724 KB Output is correct
13 Correct 4 ms 724 KB Output is correct
14 Correct 5 ms 724 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 4 ms 724 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 5 ms 724 KB Output is correct
22 Correct 5 ms 724 KB Output is correct
23 Correct 6 ms 724 KB Output is correct
24 Correct 5 ms 724 KB Output is correct
25 Correct 3 ms 468 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 6 ms 724 KB Output is correct
28 Correct 294 ms 24712 KB Output is correct
29 Correct 234 ms 21420 KB Output is correct
30 Correct 235 ms 21348 KB Output is correct
31 Correct 248 ms 20784 KB Output is correct
32 Correct 235 ms 21052 KB Output is correct
33 Correct 247 ms 21184 KB Output is correct
34 Correct 344 ms 24520 KB Output is correct
35 Correct 201 ms 17748 KB Output is correct
36 Correct 294 ms 21248 KB Output is correct
37 Correct 280 ms 21220 KB Output is correct
38 Correct 263 ms 24364 KB Output is correct
39 Correct 241 ms 21348 KB Output is correct
40 Correct 249 ms 21404 KB Output is correct
41 Correct 227 ms 21312 KB Output is correct
42 Correct 232 ms 19480 KB Output is correct
43 Correct 214 ms 21420 KB Output is correct
44 Correct 69 ms 7532 KB Output is correct