Submission #1281954

#	Time	Username	Problem	Language	Result	Execution time	Memory
1281954		hafo	Džumbus (COCI19_dzumbus)	C++17	110 / 110	35 ms	18984 KiB

dzumbus

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define Size(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini(T1 &a, T2 b) { if(a > b) a = b; else return 0; return 1; }
template<typename T1, typename T2> bool maxi(T1 &a, T2 b) { if(a < b) a = b; else return 0; return 1; }

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e3 + 7;
const ll oo = (ll) 1e9 + 69;
const int maxq = (int) 2e5 + 7;
int n, m, q, d[maxn], u, v, sz[maxn], f[maxn][maxn][3], dp[maxn][maxn][3];
vector<int> g[maxn];
bool vis[maxn];

pa que[maxq];
int res[maxq];

void dfs_root(int u) {
    vis[u] = 1;
    for(auto v:g[u]) {
        if(vis[v]) continue;
        dfs_root(v);
    }
}

void dfs(int u, int par) {
    for(auto v:g[u]) {
        if(v == par) continue;
        dfs(v, u);
    }

    for(int i = 0; i <= Size(g[u]); i++) {
        for(int j = 0; j <= n; j++) {
            for(int t = 0; t < 3; t++) {
                f[i][j][t] = oo;
            }
        }
    }

    sz[u] = 1;
    f[0][0][0] = 0; // not choose u 
    f[0][0][1] = d[u]; // choose u but cannot add 
    for(int i = 1; i <= Size(g[u]); i++) {
        int v = g[u][i - 1];
        if(v == par) {
            for(int j = 0; j <= sz[u]; j++) {
                for(int t = 0; t < 3; t++) {
                    f[i][j][t] = f[i - 1][j][t];
                }
            }
            continue;
        }

        for(int szU = 0; szU <= sz[u]; szU++) {
            for(int szV = 0; szV <= sz[v]; szV++) {
                mini(f[i][szU + szV][0], f[i - 1][szU][0] + dp[v][szV][0]);
                mini(f[i][szU + szV][0], f[i - 1][szU][0] + dp[v][szV][2]);

                mini(f[i][szU + szV][1], f[i - 1][szU][1] + dp[v][szV][0]);
                if(szU + szV + 2 <= sz[u] + sz[v]) {
                    mini(f[i][szU + szV + 2][2], f[i - 1][szU][1] + dp[v][szV][1]);
                }
                if(szU + szV + 1 <= sz[u] + sz[v]) {
                    mini(f[i][szU + szV + 1][2], f[i - 1][szU][1] + dp[v][szV][2]);
                }

                mini(f[i][szU + szV][2], f[i - 1][szU][2] + dp[v][szV][0]);
                if(szU + szV + 1 <= sz[u] + sz[v]) {
                    mini(f[i][szU + szV + 1][2], f[i - 1][szU][2] + dp[v][szV][1]);
                }
                mini(f[i][szU + szV][2], f[i - 1][szU][2] + dp[v][szV][2]);

            }
        }
        sz[u] += sz[v];
    }

    for(int i = 0; i <= sz[u]; i++) {
        for(int t = 0; t < 3; t++) dp[u][i][t] = f[Size(g[u])][i][t];
    } 
} 

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    cin>>n>>m;
    for(int i = 1; i <= n; i++) cin>>d[i];
    while(m--) {
        cin>>u>>v;
        g[u].pb(v);
        g[v].pb(u);
    }

    for(int i = 1; i <= n; i++) {
        if(vis[i]) continue;
        dfs_root(i);
        g[0].pb(i);
    }

    for(int i = 0; i <= n; i++) {
        for(int j = 0; j <= n; j++) {
            for(int t = 0; t < 3; t++) dp[i][j][t] = oo;
        }
    }
    dfs(0, -1);

    cin>>q;
    for(int i = 0; i < q; i++) {
        cin>>que[i].fi;
        que[i].se = i;
    }
    sort(que, que + q);

    for(int i = n - 1; i >= 0; i--) {
        mini(dp[0][i][0], dp[0][i + 1][0]);
    }

    int ans = 0;
    for(int i = 0; i < q; i++) {
        while(ans + 1 <= n && dp[0][ans + 1][0] <= que[i].fi) {
            ans++;
        }
        res[que[i].se] = ans;
    }

    for(int i = 0; i < q; i++) {
        cout<<res[i]<<"\n";
    }
    return 0;
}

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