oj.uz

Submission #819300

# Submission time Handle Problem Language Result Execution time Memory
819300 2023-08-10T09:07:54 Z 이동현(#10134) Virus Experiment (JOI19_virus) C++17
6 / 100
 2000 ms 15780 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define int long long
using namespace std;

int wx[4] = {-1, 0, 1, 0}, wy[4] = {0, 1, 0, -1};

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

    int m, r, c;
    cin >> m >> r >> c;

    string s;
    cin >> s;
    s += s;
    m += m;

    vector<int> len(16);
    for(int i = 0; i < 16; ++i){
        auto can = [&](int x, char c){
            if((x & 1) && c == 'N') return 1;
            if((x & 2) && c == 'E') return 1;
            if((x & 4) && c == 'S') return 1;
            if((x & 8) && c == 'W') return 1;
            return 0;
        };
        for(int j = 0; j < m; ++j){
            if(!can(i, s[j])) continue;
            int k = j;
            while(k + 1 < m && can(i, s[k + 1])){
                ++k;
            }

            len[i] = max(len[i], k - j + 1);
            j = k;
        }

        if(len[i] == m) len[i] = (int)1e9;
    }

    // cout << len[2] << ' ' << len[8] << endl;

    vector<vector<int>> a(r, vector<int>(c));
    for(int i = 0; i < r; ++i){
        for(int j = 0; j < c; ++j){
            cin >> a[i][j];
        }
    }

    vector<vector<int>> ans(r, vector<int>(c, 0));

    for(int i = 0; i < r; ++i){
        for(int j = 0; j < c; ++j){
            if(!a[i][j]) continue;

            vector<vector<int>> chk(r, vector<int>(c));
            queue<array<int, 2>> que;

            auto enque = [&](int x, int y){
                int bt = 0;
                for(int i = 0; i < 4; ++i){
                    int nx = x + wx[i], ny = y + wy[i];
                    if(nx >= 0 && nx < r && ny >= 0 && ny < c && chk[nx][ny]){
                        bt |= 1 << i;
                    }
                }

                if(len[bt] >= a[x][y]){
                    chk[x][y] = 1;
                    que.push({x, y});
                }
            };

            chk[i][j] = 1;
            que.push({i, j});
            while(!que.empty()){
                ++ans[i][j];
                int x = que.front()[0], y = que.front()[1];
                que.pop();

                for(int i = 0; i < 4; ++i){
                    int nx = x + wx[i], ny = y + wy[i];

                    if(nx >= 0 && nx < r && ny >= 0 && ny < c && !chk[nx][ny] && a[nx][ny]){
                        enque(nx, ny);
                    }
                }
            }
        }
    }

    pair<int, int> out = {(int)1e9, -1};
    for(int i = 0; i < r; ++i){
        for(int j = 0; j < c; ++j){
            if(!a[i][j]) continue;

            if(ans[i][j] < out.first){
                out = {ans[i][j], 1};
            }
            else if(ans[i][j] == out.first){
                ++out.second;
            }
        }
    }

    cout << out.first << '\n' << out.second << '\n';
    
    return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 468 KB Output is correct
2 Execution timed out 2063 ms 15780 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 23 ms 724 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 23 ms 724 KB Output is correct
6 Correct 192 ms 716 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 23 ms 724 KB Output is correct
9 Correct 85 ms 356 KB Output is correct
10 Correct 5 ms 768 KB Output is correct
11 Correct 8 ms 392 KB Output is correct
12 Correct 258 ms 372 KB Output is correct
13 Correct 97 ms 752 KB Output is correct
14 Correct 92 ms 812 KB Output is correct
15 Correct 93 ms 724 KB Output is correct
16 Correct 85 ms 724 KB Output is correct
17 Correct 17 ms 596 KB Output is correct
18 Correct 18 ms 400 KB Output is correct
19 Correct 28 ms 852 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 468 KB Output is correct
2 Execution timed out 2063 ms 15780 KB Time limit exceeded
3 Halted 0 ms 0 KB -