oj.uz

답안 #1099222

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1099222 2024-10-10T20:14:00 Z f0rizen Džumbus (COCI19_dzumbus) C++17
110 / 110
 61 ms 21160 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll infll = 1e18;

template<typename T>
istream &operator>>(istream &is, vector<T> &a) {
    for (auto &i : a) {
        is >> i;
    }
    return is;
}

vector<vector<int>> gg;
vector<bool> used;

void dfs(int v) {
    used[v] = 1;
    for (auto u : gg[v]) {
        if (!used[u]) {
            dfs(u);
        }
    }
}

vector<int> a;
vector<vector<int>> g;
vector<int> sz;
vector<vector<vector<ll>>> dp;

void dfs_dp(int v, int p = -1) {
    sz[v] = 1;
    for (auto u : g[v]) {
        if (u != p) {
            dfs_dp(u, v);
            sz[v] += sz[u];
        }
    }
    dp[v].resize(2, vector<ll>(3, infll));
    dp[v][0][0] = 0;
    dp[v][0][1] = a[v];
    int cur = 1;
    for (auto u : g[v]) {
        if (u != p) {
            vector<vector<ll>> dpp(cur + sz[u] + 1, vector<ll>(3, infll));
            for (int i = 0; i <= cur; ++i) {
                for (int j = 0; j <= sz[u]; ++j) {
                    dpp[i + j][0] = min(dpp[i + j][0], dp[v][i][0] + dp[u][j][0]);
                    dpp[i + j][0] = min(dpp[i + j][0], dp[v][i][0] + dp[u][j][1]);
                    dpp[i + j][0] = min(dpp[i + j][0], dp[v][i][0] + dp[u][j][2]);
                    dpp[i + j][1] = min(dpp[i + j][1], dp[v][i][1] + dp[u][j][0]);
                    dpp[i + j][2] = min(dpp[i + j][2], dp[v][i][2] + dp[u][j][0]);
                    if (i + j + 1 <= cur + sz[u]) {
                        dpp[i + j + 1][2] = min(dpp[i + j + 1][2], dp[v][i][2] + dp[u][j][1]);
                    }
                    dpp[i + j][2] = min(dpp[i + j][2], dp[v][i][2] + dp[u][j][2]);
                    if (i + j + 2 <= cur + sz[u]) {
                        dpp[i + j + 2][2] = min(dpp[i + j + 2][2], dp[v][i][1] + dp[u][j][1]);
                    }
                    if (i + j + 1 <= cur + sz[u]) {
                        dpp[i + j + 1][2] = min(dpp[i + j + 1][2], dp[v][i][1] + dp[u][j][2]);
                    }
                }
            }
            dp[v] = dpp;
            cur += sz[u];
        }
    }
}

int32_t main() {
#ifdef LOCAL
    freopen("/tmp/input.txt", "r", stdin);
#else
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int n, m;
    cin >> n >> m;
    a.resize(n + 1);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    a[n] = inf;
    gg.resize(n);
    g.resize(n + 1);
    for (int i = 0; i < m; ++i) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        gg[u].push_back(v);
        gg[v].push_back(u);
        g[u].push_back(v);
        g[v].push_back(u);
    }
    int root = n;
    used.resize(n);
    for (int i = 0; i < n; ++i) {
        if (!used[i]) {
            dfs(i);
            g[root].push_back(i);
            g[i].push_back(root);
        }
    }
    sz.resize(n + 1);
    dp.resize(n + 1);
    dfs_dp(root);
    vector<ll> val(n + 1);
    for (int i = 0; i <= n; ++i) {
        val[i] = min({dp[root][i][0], dp[root][i][1], dp[root][i][2]});
    }
    for (int i = n - 1; i >= 0; --i) {
        val[i] = min(val[i], val[i + 1]);
    }
    int q;
    cin >> q;
    while (q--) {
        int s;
        cin >> s;
        int l = 0, r = n + 1;
        while (r - l > 1) {
            int mid = (l + r) / 2;
            if (val[mid] <= s) {
                l = mid;
            } else {
                r = mid;
            }
        }
        cout << l << "\n";
    }
    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 15956 KB Output is correct
2 Correct 34 ms 18432 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 15956 KB Output is correct
2 Correct 34 ms 18432 KB Output is correct
3 Correct 61 ms 21160 KB Output is correct
4 Correct 54 ms 16212 KB Output is correct
5 Correct 54 ms 14932 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 1372 KB Output is correct
2 Correct 23 ms 2140 KB Output is correct
3 Correct 27 ms 2652 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 15956 KB Output is correct
2 Correct 34 ms 18432 KB Output is correct
3 Correct 61 ms 21160 KB Output is correct
4 Correct 54 ms 16212 KB Output is correct
5 Correct 54 ms 14932 KB Output is correct
6 Correct 22 ms 1372 KB Output is correct
7 Correct 23 ms 2140 KB Output is correct
8 Correct 27 ms 2652 KB Output is correct
9 Correct 33 ms 4128 KB Output is correct
10 Correct 42 ms 3668 KB Output is correct
11 Correct 53 ms 3408 KB Output is correct