oj.uz

답안 #847050

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
847050 2023-09-09T04:48:19 Z Cookie Džumbus (COCI19_dzumbus) C++14
0 / 110
 286 ms 16216 KB 
#include<bits/stdc++.h>
#define ll long long
#define vt vector
#define pb push_back
#define pii pair<int, int>
#define sz(v) (int)v.size()
#define fi first
#define se second
using namespace std;
const ll base = 107, mod = 1e9 + 7, mxv = 1e4 + 5, inf = 1e15;
const int mxn = 1e3 + 5, N = 3e6 + 5;
int n, m;
ll d[mxn + 1];
ll dp[mxn + 1][mxn + 1][2];
bool vis[mxn + 1];
int sz[mxn + 1];
vt<int>adj[mxn + 1];
void dfs2(int s){
    vis[s] = 1;
    for(auto i: adj[s]){
        if(!vis[i]){
            dfs2(i);
        }
    }
}
void ckmin(ll &a, ll b){
    a = min(a, b);
}
void dfs(int s, int pre){
    dp[s][0][0] = 0;
    sz[s] = 1;
    for(auto i: adj[s]){
        if(i != pre){
            dfs(i, s);
            for(int j = sz[s] + sz[i]; j >= 1; j--){
                for(int k = 0; k <= min(sz[i], j); k++){
                    ckmin(dp[s][j][0], dp[s][j - k][0] + min(dp[i][k][1], dp[i][k][0]));
                }
            }
            for(int j = sz[s] + sz[i]; j >= 1; j--){
                for(int k = 0; k <= min(sz[i], j); k++){
                    ckmin(dp[s][j][1], dp[s][j - k][1] + min(dp[i][k][0], dp[i][k][1]));
                    if(j - k >= 1){
                        // connect s (off) = i(on)
                        ckmin(dp[s][j][1], dp[s][j - k - 1][0] + d[s] + dp[i][k][1]);
                    }if(j - k >= 1 && k >= 1){
                        // connect s to i (both off)
                        ckmin(dp[s][j][1], dp[s][j - k - 1][0] + d[s] + d[i] + dp[i][k - 1][0]);
                    }if(k >= 1){
                        // connect active s to off i 
                        ckmin(dp[s][j][1], dp[s][j - k][1] + d[s] + d[i] + dp[i][k - 1][0]);
                    }
                }
            }
            sz[s] += sz[i];
        }
    }
}
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    d[0] = inf;
    for(int i = 1; i <= n; i++)cin >> d[i];
    for(int i = 0; i <= n; i++){
        for(int j = 0; j <= n; j++){
            dp[i][j][0] = dp[i][j][1] = inf;
        }
    }
    for(int i = 0; i < m; i++){
        int u, v; cin >> u >> v;
        adj[u].pb(v); adj[v].pb(u);
    }
    for(int i = 1; i <= n; i++){
        if(!vis[i]){
            dfs2(i);
            adj[0].pb(i);
        }
    }
    dfs(0, -1);
    int q; cin >> q;
    vt<ll>comp;
    for(int i = 0; i <= n; i++){
        comp.pb(min(dp[0][i][0], dp[0][i][1]));
    }
   
    while(q--){
        ll s; cin >> s;
        int id = upper_bound(comp.begin(), comp.end(), s) - comp.begin() - 1;
        cout << id << "\n";
    }
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 286 ms 16216 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 286 ms 16216 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 4432 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 286 ms 16216 KB Output isn't correct
2 Halted 0 ms 0 KB -