제출 #1254461

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1254461		wedonttalkanymore	Džumbus (COCI19_dzumbus)	C++20	110 / 110	29 ms	17220 KiB

dzumbus

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define int long long
#define pii pair<ll, ll>
#define fi first
#define se second

const ll N = 1005 + 5, inf = 1e18, mod = 1e9 + 7, block = 320, lim = 1 << 16;

int n, m, q;
int d[N], a[N], b[N];
int pos[N];
vector <int> adj[N];
int dp[N][N][2];
int sz[N];
int f[N];
vector <int> root;

void dfs(int u, int par) {
    dp[u][0][0] = 0;
    dp[u][1][1] = d[u];
    sz[u] = 1;
    for (auto v : adj[u]) {
        if (v == par) continue;
        dfs(v, u);
        for (int i = sz[u]; i >= 0; i--) {
            for (int j = 1; j <= sz[v]; j++) {
                // TH ko chon u
                if (j > 1) dp[u][i + j][0] = min(dp[u][i + j][0], dp[u][i][0] + min(dp[v][j][0], dp[v][j][1]));
                // TH chon u va v
                if (i + j > 1) dp[u][i + j][1] = min(dp[u][i + j][1], dp[u][i - 1][0] + d[u] + min(dp[v][j - 1][0] + d[v], dp[v][j][1]));
                // chon u ko chon v
                if (i > 1) dp[u][i + j][1] = min(dp[u][i + j][1], dp[u][i][1] + dp[v][j][0]);
                // chon u va co/khong chon v
                dp[u][i + j][1] = min(dp[u][i + j][1], dp[u][i][1] + min(dp[v][j - 1][0] + d[v], dp[v][j][1]));
            }
        }
        sz[u] += sz[v];
    }
} 

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    if (fopen(".inp", "r")) {
        freopen(".inp", "r", stdin);
        freopen(".out", "w", stdout);
    }
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> d[i];
    for (int i = 1; i <= m; i++) {
        cin >> a[i] >> b[i];
        adj[a[i]].push_back(b[i]);
        adj[b[i]].push_back(a[i]);
    }
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= n; j++) {
            for (int k = 0; k < 3; k++) dp[i][j][k] = inf;
        }
    }
    for (int i = 1; i <= n; i++) {
        if (!sz[i]) {
            root.push_back(i);
            dfs(i, 0);
        }
    }
    memset(f, 0x3f3f3f3f, sizeof(f));
    f[0] = 0;
    for (auto u : root) {
        for (int i = n; i >= 2; i--) {
            for (int j = 2; j <= sz[u]; j++) {
                if (i - j >= 0) f[i] = min(f[i], f[i - j] + min(dp[u][j][0], dp[u][j][1]));
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        pos[i] = f[i];
        // assert(i > 2 && pos[i] >= pos[i - 1]);
        // cout << "Ok: " << pos[i] << '\n';
    }
    // cout << "dm: " << dp[1][2][2] << '\n';
    cin >> q;
    while(q-- > 0) {
        int x;
        cin >> x;
        int tmp = upper_bound(pos + 1, pos + n + 1, x) - pos - 1;
        cout << tmp << '\n';
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

dzumbus.cpp: In function 'int main()':
dzumbus.cpp:48:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         freopen(".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
dzumbus.cpp:49:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |         freopen(".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
dzumbus.cpp:60:53: warning: iteration 2 invokes undefined behavior [-Waggressive-loop-optimizations]
   60 |             for (int k = 0; k < 3; k++) dp[i][j][k] = inf;
      |                                         ~~~~~~~~~~~~^~~~~
dzumbus.cpp:60:31: note: within this loop
   60 |             for (int k = 0; k < 3; k++) dp[i][j][k] = inf;
      |                             ~~^~~

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