oj.uz

답안 #504897

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
504897 2022-01-10T09:49:29 Z tengiz05 바이러스 (JOI19_virus) C++17
100 / 100
 1093 ms 15880 KB 
#include <bits/stdc++.h>

using i64 = long long;

std::string dir = "NSWE";
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int k, n, m;
    std::cin >> k >> n >> m;
    
    std::string D;
    std::cin >> D;
    
    D += D;
    
    int mx[1 << 4] {};
    
    for (int b = 0; b < (1 << 4); b++) {
        for (int i = 0; i < 2 * k; ) {
            int j = i;
            while (j < 2 * k && (b >> dir.find(D[j]) & 1)) {
                j++;
            }
            mx[b] = std::max(mx[b], j - i);
            i = std::max(i + 1, j);
        }
        if (mx[b] == 2 * k) {
            mx[b] = 1E9;
        }
    }
    
    int a[n][m];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            std::cin >> a[i][j];
        }
    }
    
    auto good = [&](int x, int y) {
        return x >= 0 && y >= 0 && x < n && y < m;
    };
    
    std::vector<std::pair<int, int>> v;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            v.emplace_back(i, j);
        }
    }
    std::random_shuffle(v.begin(), v.end());
    
    int mn = 1E9;
    int ans = 0;
    
    bool done[n][m] {};
    bool vis[n][m] {};
    
    for (auto [x, y] : v) {
        if (a[x][y] == 0)
            continue;
        std::queue<std::pair<int, int>> q, rem;
        
        q.emplace(x, y);
        rem.emplace(x, y);
        vis[x][y] = true;
        int siz = 0;
        
        while (!q.empty()) {
            auto [x, y] = q.front();
            q.pop();
            siz++;
            
            if (done[x][y]) {
                siz = -1;
                break;
            }
            
            for (int i = 0; i < 4; i++) {
                int nx = x + dx[i];
                int ny = y + dy[i];
                int mask = 0;
                if (!good(nx, ny) || a[nx][ny] == 0) {
                    continue;
                }
                for (int j = 0; j < 4; j++) {
                    int X = nx + dx[j];
                    int Y = ny + dy[j];
                    if (good(X, Y) && vis[X][Y]) {
                        mask |= 1 << j;
                    }
                }
                if (mx[mask] >= a[nx][ny] && !vis[nx][ny]) {
                    vis[nx][ny] = true;
                    q.emplace(nx, ny);
                    rem.emplace(nx, ny);
                }
            }
        }
        
        done[x][y] = true;
        
        while (!rem.empty()) {
            auto [x, y] = rem.front();
            rem.pop();
            vis[x][y] = false;
        }
        
        if (siz == -1) {
            continue;
        }
        if (siz < mn) {
            mn = siz;
            ans = 0;
        }
        if (siz == mn) {
            ans += siz;
        }
    }
    
    std::cout << mn << "\n" << ans << "\n";
    
    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 460 KB Output is correct
2 Correct 214 ms 11116 KB Output is correct
3 Correct 437 ms 11112 KB Output is correct
4 Correct 465 ms 11108 KB Output is correct
5 Correct 184 ms 11184 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 507 ms 12668 KB Output is correct
8 Correct 111 ms 5456 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 23 ms 716 KB Output is correct
3 Correct 47 ms 716 KB Output is correct
4 Correct 26 ms 716 KB Output is correct
5 Correct 43 ms 716 KB Output is correct
6 Correct 42 ms 716 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 40 ms 716 KB Output is correct
9 Correct 3 ms 316 KB Output is correct
10 Correct 22 ms 832 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 39 ms 724 KB Output is correct
14 Correct 44 ms 740 KB Output is correct
15 Correct 38 ms 788 KB Output is correct
16 Correct 38 ms 844 KB Output is correct
17 Correct 21 ms 588 KB Output is correct
18 Correct 3 ms 332 KB Output is correct
19 Correct 40 ms 812 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 460 KB Output is correct
2 Correct 214 ms 11116 KB Output is correct
3 Correct 437 ms 11112 KB Output is correct
4 Correct 465 ms 11108 KB Output is correct
5 Correct 184 ms 11184 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 507 ms 12668 KB Output is correct
8 Correct 111 ms 5456 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 23 ms 716 KB Output is correct
11 Correct 47 ms 716 KB Output is correct
12 Correct 26 ms 716 KB Output is correct
13 Correct 43 ms 716 KB Output is correct
14 Correct 42 ms 716 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 40 ms 716 KB Output is correct
17 Correct 3 ms 316 KB Output is correct
18 Correct 22 ms 832 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 4 ms 332 KB Output is correct
21 Correct 39 ms 724 KB Output is correct
22 Correct 44 ms 740 KB Output is correct
23 Correct 38 ms 788 KB Output is correct
24 Correct 38 ms 844 KB Output is correct
25 Correct 21 ms 588 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 40 ms 812 KB Output is correct
28 Correct 1059 ms 15868 KB Output is correct
29 Correct 1062 ms 15880 KB Output is correct
30 Correct 846 ms 13916 KB Output is correct
31 Correct 815 ms 12636 KB Output is correct
32 Correct 874 ms 12324 KB Output is correct
33 Correct 425 ms 12372 KB Output is correct
34 Correct 975 ms 15548 KB Output is correct
35 Correct 688 ms 12032 KB Output is correct
36 Correct 750 ms 12744 KB Output is correct
37 Correct 1093 ms 12628 KB Output is correct
38 Correct 845 ms 15488 KB Output is correct
39 Correct 378 ms 13580 KB Output is correct
40 Correct 379 ms 13664 KB Output is correct
41 Correct 308 ms 12660 KB Output is correct
42 Correct 848 ms 13580 KB Output is correct
43 Correct 857 ms 13436 KB Output is correct
44 Correct 106 ms 5464 KB Output is correct