oj.uz

Submission #824213

# Submission time Handle Problem Language Result Execution time Memory
824213 2023-08-13T18:30:43 Z PanosPask Virus Experiment (JOI19_virus) C++14
100 / 100
 544 ms 235060 KB 
#include <bits/stdc++.h>
#define CHECK_BIT(val, pos) ((1 << pos) & val)
#define pb push_back

using namespace std;

typedef pair<int, int> pi;

const int INF = 1e5;

const int DIRS = 4;
const string winds = "SENW";
const int d_x[] = {0, -1, 0, 1};
const int d_y[] = {-1, 0, 1, 0};
// Longest time period that wind blows continuously from the sides defined in the submask
int continuous[1 << DIRS];

struct Node {
    vector<int> members;
    set<int> unlocked_edges;
    map<int, int> locked_edges;

    int size(void) {
        return members.size() + unlocked_edges.size() + locked_edges.size();
    }
    void clear(void) {
        members.clear();
        unlocked_edges.clear();
        locked_edges.clear();
    }
};

int R, C, M;
int N;

vector<int> U;
vector<int> D;
vector<bool> is_immune;
vector<Node> graph;

vector<int> in_graph;

// DFS Variables
vector<bool> vis;
vector<bool> on_cycle;
stack<int> cyc;
vector<int> rep;
vector<int> nxt;

set<int> proc;

bool inside(int i, int j)
{
    return i < R && i >= 0 && j < C && j >= 0;
}

int code(int i, int j)
{
    return C * i + j;
}

void calculate_continuous(int mask)
{
    int best = 0;
    int cur = 0;
    for (int i = 0; i < 2 * M; i++) {
        if (CHECK_BIT(mask, D[i])) {
            cur++;
        }
        else {
            cur = 0;
        }

        best = max(best, cur);
    }

    if (best == 2 * M)
        best = INF;

    continuous[mask] = best;
}

// Returns idx of the new merged node
int merge(int a, int b)
{
    if (graph[a].size() < graph[b].size())
        swap(a, b);

    for (auto mem : graph[b].members) {
        graph[a].members.pb(mem);
        graph[a].unlocked_edges.erase(mem);
        graph[a].locked_edges.erase(mem);
        in_graph[mem] = a;
        rep[mem] = a;
    }

    for (auto v : graph[b].unlocked_edges) {
        if (in_graph[v] == a)
            continue;

        graph[a].unlocked_edges.insert(v);
        graph[a].locked_edges.erase(v);
    }

    for (auto [v, k] : graph[b].locked_edges) {
        if (in_graph[v] == a)
            continue;
        if (graph[a].unlocked_edges.count(v))
            continue;

        int res = graph[a].locked_edges[v] + k;
        if (continuous[res] >= U[v]) {
            graph[a].locked_edges.erase(v);
            graph[a].unlocked_edges.insert(v);
        }
        else {
            graph[a].locked_edges[v] = res;
        }
    }

    graph[b].clear();

    return a;
}

int find(int a)
{
    if (rep[a] != a)
        rep[a] = find(rep[a]);

    return rep[a];
}

void dfs(int node)
{
    if (vis[node]) {
        if (on_cycle[node]) {
            int init = node;
            rep[node] = node;

            while (cyc.top() != init) {
                int v = cyc.top();
                cyc.pop();

                node = merge(node, v);
                rep[v] = node;
            }

            proc.insert(node);
        }

        return;
    }

    vis[node] = true;
    on_cycle[node] = true;
    cyc.push(node);

    int dest = *graph[node].unlocked_edges.begin();
    dfs(dest);

    on_cycle[node] = false;

    nxt[node] = dest;
    rep[node] = rep[dest];
}

void ReadInput(void)
{
    scanf("%d %d %d", &M, &R, &C);

    N = R * C;

    rep.resize(N);
    nxt.resize(N);
    D.resize(2 * M);
    vis.assign(N, false);
    in_graph.resize(N);
    on_cycle.assign(N, false);
    U.resize(R * C);
    graph.resize(R * C);
    is_immune.assign(R * C, false);

    for (int i = 0; i < M; i++) {
        char c;
        scanf(" %c", &c);

        D[i] = D[M + i] = winds.find(c);
    }

    for (int i = 0; i < R; i++)
        for (int j = 0; j < C; j++) {
            int v;
            scanf("%d", &v);

            U[code(i, j)] = v;
            if (U[code(i, j)] == 0)
                is_immune[code(i, j)] = true;

            in_graph[code(i, j)] = code(i, j);
        }
}

void InitializeEdges(void)
{
    for (int s = 0; s < (1 << DIRS); s++)
        calculate_continuous(s);

    for (int i = 0; i < R; i++)
        for (int j = 0; j < C; j++) {
            int c1 = code(i, j);

            graph[c1].members.pb(c1);

            if (is_immune[c1])
                continue;

            for (int d = 0; d < DIRS; d++) {
                int n_i = i + d_y[d];
                int n_j = j + d_x[d];

                if (!inside(n_i, n_j))
                    continue;

                int c2 = code(n_i, n_j);
                if (is_immune[c2])
                        continue;

                int cur = 1 << d;
                if (continuous[cur] < U[c2]) {
                    graph[c1].locked_edges[c2] = cur;
                }
                else {
                    graph[c1].unlocked_edges.insert(c2);
                }
            }
        }
}

int main(void)
{
    ReadInput();
    InitializeEdges();

    int cnt = 0;
    for (int i = 0; i < N; i++) {
        if (is_immune[i])
            continue;

        cnt += graph[i].unlocked_edges.empty();
    }

    if (cnt) {
        printf("%d\n%d\n", 1, cnt);
        return 0;
    }

    for (int i = 0; i < N; i++)
        if (!vis[i]) {
            dfs(i);
            while (!cyc.empty())
                cyc.pop();
        }

    while (!proc.empty()) {
        int u = *proc.begin();
        proc.erase(u);

        while (graph[u].unlocked_edges.empty() == false) {
            int v = *graph[u].unlocked_edges.begin();
            graph[u].unlocked_edges.erase(v);

            if (find(v) == u) {
                while (in_graph[v] != u) {
                    int c = merge(u, v);
                    rep[u] = c;
                    rep[v] = c;

                    u = c;
                    v = in_graph[nxt[v]];
                }
            }
            else {
                rep[u] = v;
                nxt[u] = v;
                break;
            }
        }
    }

    int min_v = INT_MAX;
    int min_cnt = 0;
    for (int i = 0; i < N; i++) {
        if (find(i) == i && !is_immune[i]) {
            if (min_v > graph[i].members.size()) {
                min_v = graph[i].members.size();
                min_cnt = 0;
            }
            if (min_v == graph[i].members.size()) {
                min_cnt += graph[i].members.size();
            }
        }
    }

    printf("%d\n%d\n", min_v, min_cnt);

    return 0;
}

Compilation message

virus.cpp: In function 'int merge(int, int)':
virus.cpp:105:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  105 |     for (auto [v, k] : graph[b].locked_edges) {
      |               ^
virus.cpp: In function 'int main()':
virus.cpp:295:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  295 |             if (min_v > graph[i].members.size()) {
      |                 ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
virus.cpp:299:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  299 |             if (min_v == graph[i].members.size()) {
      |                 ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
virus.cpp: In function 'void ReadInput()':
virus.cpp:170:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  170 |     scanf("%d %d %d", &M, &R, &C);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
virus.cpp:186:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  186 |         scanf(" %c", &c);
      |         ~~~~~^~~~~~~~~~~
virus.cpp:194:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  194 |             scanf("%d", &v);
      |             ~~~~~^~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 852 KB Output is correct
2 Correct 296 ms 227140 KB Output is correct
3 Correct 288 ms 229388 KB Output is correct
4 Correct 291 ms 226968 KB Output is correct
5 Correct 297 ms 229524 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 508 ms 231124 KB Output is correct
8 Correct 127 ms 82424 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 8 ms 1104 KB Output is correct
3 Correct 8 ms 1108 KB Output is correct
4 Correct 8 ms 1104 KB Output is correct
5 Correct 10 ms 1092 KB Output is correct
6 Correct 9 ms 1940 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 8 ms 1108 KB Output is correct
9 Correct 2 ms 852 KB Output is correct
10 Correct 8 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 3 ms 1108 KB Output is correct
13 Correct 8 ms 1876 KB Output is correct
14 Correct 8 ms 1876 KB Output is correct
15 Correct 10 ms 1972 KB Output is correct
16 Correct 10 ms 1944 KB Output is correct
17 Correct 6 ms 1492 KB Output is correct
18 Correct 2 ms 1108 KB Output is correct
19 Correct 8 ms 1876 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 852 KB Output is correct
2 Correct 296 ms 227140 KB Output is correct
3 Correct 288 ms 229388 KB Output is correct
4 Correct 291 ms 226968 KB Output is correct
5 Correct 297 ms 229524 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 508 ms 231124 KB Output is correct
8 Correct 127 ms 82424 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 8 ms 1104 KB Output is correct
11 Correct 8 ms 1108 KB Output is correct
12 Correct 8 ms 1104 KB Output is correct
13 Correct 10 ms 1092 KB Output is correct
14 Correct 9 ms 1940 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 8 ms 1108 KB Output is correct
17 Correct 2 ms 852 KB Output is correct
18 Correct 8 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 3 ms 1108 KB Output is correct
21 Correct 8 ms 1876 KB Output is correct
22 Correct 8 ms 1876 KB Output is correct
23 Correct 10 ms 1972 KB Output is correct
24 Correct 10 ms 1944 KB Output is correct
25 Correct 6 ms 1492 KB Output is correct
26 Correct 2 ms 1108 KB Output is correct
27 Correct 8 ms 1876 KB Output is correct
28 Correct 515 ms 232136 KB Output is correct
29 Correct 293 ms 227916 KB Output is correct
30 Correct 541 ms 231228 KB Output is correct
31 Correct 452 ms 211788 KB Output is correct
32 Correct 428 ms 217268 KB Output is correct
33 Correct 296 ms 227060 KB Output is correct
34 Correct 534 ms 235060 KB Output is correct
35 Correct 372 ms 175984 KB Output is correct
36 Correct 533 ms 227276 KB Output is correct
37 Correct 502 ms 225552 KB Output is correct
38 Correct 450 ms 230172 KB Output is correct
39 Correct 487 ms 222396 KB Output is correct
40 Correct 544 ms 224076 KB Output is correct
41 Correct 266 ms 206800 KB Output is correct
42 Correct 209 ms 164112 KB Output is correct
43 Correct 292 ms 228052 KB Output is correct
44 Correct 116 ms 82380 KB Output is correct