Submission #868495

#	Time	Username	Problem	Language	Result	Execution time	Memory
868495		phongcd	Džumbus (COCI19_dzumbus)	C++14	50 / 110	154 ms	19148 KiB

dzumbus

#include <bits/stdc++.h>
#define ll long long
#define ld long  double
#define ull unsigned long long
#define ii pair <int, int>
#define ill pair <ll, ll>
#define ild pair <ld, ld>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define file "test"
using namespace std;
const int N = 1e3 + 2;
const int M = 40;
const ll MOD = 1e9 + 7;
const ll INF = 3e18;
const ll base = 311;
const ll base2 = 1e4 + 7;
const int BLOCK_SIZE = 400;
 
int n, m;
int sz[N];
ll d[N], f[N][N][2], dp[N];
vector <int> g[N];
 
void minimize(ll &a, ll b) {
    if (a > b) a = b;
}
 
void dfs(int u, int p) {
    f[u][0][0] = 0;
    if (u) sz[u] = 1;
    for (int v: g[u]) if (v != p) {
        dfs(v, u);
        for (int i = sz[u]; i >= 0; i --)
            for (int j = sz[v]; j >= 0; j --) {
                minimize(f[u][i + j][0], f[u][i][0] + min(f[v][j][0], f[v][j][1]));
                minimize(f[u][i + j][1], f[u][i][1] + min(f[v][j][0], f[v][j][1]));
                minimize(f[u][i + j + 1][1], f[u][i][0] + f[v][j][1] + d[u]);
                minimize(f[u][i + j + 1][1], f[u][i][1] + f[v][j][0] + d[v]);
                minimize(f[u][i + j + 2][1], f[u][i][0] + f[v][j][0] + d[u] + d[v]);
            }
        sz[u] += sz[v];
    }
}
 
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    // // #ifndef ONLINE_JUDGE
    //     freopen(file".inp","r",stdin); freopen(file".out","w",stdout);
    // // #endif
 
    cin >> n >> m;
    for (int i = 1; i <= n; i ++) cin >> d[i];
    
    for (int i = 0; i < m; i ++) {
        int u, v; cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
 
    memset(f, 0x3f, sizeof f);
 
    for (int i = 1; i <= n; i ++)
        if (f[i][0][0] > 1000) {
            g[0].push_back(i);
            dfs(0, -1);
        } 
 
    int q; cin >> q;
    while (q --) {
        int s; cin >> s;
        for (int i = n; i >= 0; i --)
            if (f[0][i][0] <= s) {
                cout << i << '\n';
                break;
            }
    }
}

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 0 / 30
• Subtask 4: 0 / 30