oj.uz

Submission #947022

# Submission time Handle Problem Language Result Execution time Memory
947022 2024-03-15T10:54:06 Z alextodoran Security Guard (JOI23_guard) C++17
26 / 100
 4000 ms 319568 KB 
/**
 _  _   __  _ _ _  _  _ _
 |a  ||t  ||o    d | |o  |
| __    _| | _ | __|  _ |
| __ |/_  | __  /__\ / _\|

**/

#include <bits/stdc++.h>
#define int long long

using namespace std;

typedef long long ll;

const int N_MAX = 200000;
const int M_MAX = 400000;

int N, M, Q;
int S[N_MAX + 2];
int edge_u[M_MAX + 2], edge_v[M_MAX + 2];

int order[M_MAX + 2];

int leader[N_MAX + 2];
int find_leader (int u) {
    return (leader[u] == 0 ? u : leader[u] = find_leader(leader[u]));
}
bool join (int u, int v) {
    u = find_leader(u);
    v = find_leader(v);
    if (u != v) {
        leader[u] = v;
        return true;
    }
    return false;
}

vector <int> adj[N_MAX + 2];

int root;
ll cost;

void init () {
    int mx = 0;
    for (int u = 1; u <= N; u++) {
        cost -= S[u];
        mx = max(mx, S[u]);
    }
    cost += mx;
    root = 1;
    for (int u = 2; u <= N; u++) {
        if (S[u] < S[root]) {
            root = u;
        }
    }
    for (int u = 1; u <= N; u++) {
        if (u != root) {
            cost += S[u] + S[root];
        }
    }
}

ll answer[N_MAX + 2];

set <tuple <int, int, int>> st;

int min_comp[N_MAX + 2];
vector <int> comp[N_MAX + 2];

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

    cin >> N >> M >> Q;
    for (int u = 1; u <= N; u++) {
        cin >> S[u];
    }
    for (int i = 1; i <= M; i++) {
        cin >> edge_u[i] >> edge_v[i];
    }
    iota(order + 1, order + M + 1, 1);
    sort(order + 1, order + M + 1, [&] (const int &i, const int &j) {
        return S[edge_u[i]] + S[edge_v[i]] < S[edge_u[j]] + S[edge_v[j]];
    });
    for (int _ = 1; _ <= M; _++) {
        int i = order[_];
        if (join(edge_u[i], edge_v[i]) == true) {
            adj[edge_u[i]].push_back(edge_v[i]);
            adj[edge_v[i]].push_back(edge_u[i]);
        }
    }
    init();
    for (int i = N - 1; i <= Q; i++) {
        answer[i] = cost;
    }
    fill(leader + 1, leader + N + 1, 0);
    for (int u = 1; u <= N; u++) {
        min_comp[u] = S[u];
        comp[u] = {u};
    }
    for (int u = 1; u <= N; u++) {
        for (int v : adj[u]) {
            if (u < v) {
                st.insert(make_tuple(S[u] + S[v] - max(S[u], S[v]), u, v));
            }
        }
    }
    for (int k = N - 2; k >= 0; k--) {
        int delta, u, v; tie(delta, u, v) = *st.begin();
        st.erase(st.begin());
        cost += delta;
        cost -= S[root];
        answer[k] = cost;
        u = find_leader(u); v = find_leader(v);
        if (min_comp[u] < min_comp[v]) {
            swap(u, v);
        }
        while (comp[u].empty() == false) {
            int x = comp[u].back();
            comp[u].pop_back();
            comp[v].push_back(x);
            for (int y : adj[x]) {
                set <tuple <int, int, int>> :: iterator it
                    = st.find(make_tuple(S[x] + S[y] - max(min_comp[u], min_comp[y]), min(x, y), max(x, y)));
                if (it != st.end()) {
                    st.erase(it);
                    st.insert(make_tuple(S[x] + S[y] - max(min_comp[v], min_comp[y]), min(x, y), max(x, y)));
                }
            }
            min_comp[x] = min_comp[v];
        }
        leader[u] = v;
    }
    for (int i = 0; i <= Q; i++) {
        cout << answer[i] << "\n";
    }

    return 0;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 21084 KB Output is correct
2 Execution timed out 4091 ms 319568 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 21084 KB Output is correct
2 Execution timed out 4091 ms 319568 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 21084 KB Output is correct
2 Execution timed out 4091 ms 319568 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 21084 KB Output is correct
2 Execution timed out 4091 ms 319568 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 21084 KB Output is correct
2 Correct 4 ms 21084 KB Output is correct
3 Correct 4 ms 21084 KB Output is correct
4 Correct 3 ms 21084 KB Output is correct
5 Correct 3 ms 21084 KB Output is correct
6 Correct 5 ms 20928 KB Output is correct
7 Correct 4 ms 21080 KB Output is correct
8 Correct 20 ms 23132 KB Output is correct
9 Correct 16 ms 23292 KB Output is correct
10 Correct 16 ms 23124 KB Output is correct
11 Correct 16 ms 23128 KB Output is correct
12 Correct 20 ms 23128 KB Output is correct
13 Correct 16 ms 23132 KB Output is correct
14 Correct 16 ms 23124 KB Output is correct
15 Correct 17 ms 23132 KB Output is correct
16 Correct 16 ms 23132 KB Output is correct

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 21084 KB Output is correct
2 Correct 4 ms 21084 KB Output is correct
3 Correct 4 ms 21084 KB Output is correct
4 Correct 3 ms 21084 KB Output is correct
5 Correct 3 ms 21084 KB Output is correct
6 Correct 5 ms 20928 KB Output is correct
7 Correct 4 ms 21080 KB Output is correct
8 Correct 20 ms 23132 KB Output is correct
9 Correct 16 ms 23292 KB Output is correct
10 Correct 16 ms 23124 KB Output is correct
11 Correct 16 ms 23128 KB Output is correct
12 Correct 20 ms 23128 KB Output is correct
13 Correct 16 ms 23132 KB Output is correct
14 Correct 16 ms 23124 KB Output is correct
15 Correct 17 ms 23132 KB Output is correct
16 Correct 16 ms 23132 KB Output is correct
17 Correct 24 ms 23900 KB Output is correct
18 Correct 24 ms 23900 KB Output is correct
19 Correct 37 ms 28752 KB Output is correct
20 Correct 61 ms 29520 KB Output is correct
21 Correct 69 ms 29832 KB Output is correct
22 Correct 57 ms 29548 KB Output is correct
23 Correct 121 ms 31504 KB Output is correct
24 Correct 78 ms 30092 KB Output is correct
25 Correct 21 ms 23888 KB Output is correct
26 Correct 50 ms 29196 KB Output is correct
27 Correct 24 ms 24148 KB Output is correct
28 Correct 249 ms 33872 KB Output is correct
29 Correct 20 ms 23640 KB Output is correct
30 Correct 98 ms 27512 KB Output is correct
31 Correct 17 ms 22616 KB Output is correct
32 Correct 17 ms 22648 KB Output is correct
33 Correct 24 ms 23888 KB Output is correct
34 Correct 22 ms 24156 KB Output is correct
35 Correct 41 ms 28752 KB Output is correct
36 Correct 112 ms 31452 KB Output is correct

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 21084 KB Output is correct
2 Execution timed out 4091 ms 319568 KB Time limit exceeded
3 Halted 0 ms 0 KB -