제출 #1261591

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

dzumbus

#include <bits/stdc++.h>

#define task     "BriantheCrab"

#define int    long long
#define pii    pair <int, int>
#define fi     first
#define se     second
#define szf    sizeof
#define sz(s)  (int)((s).size())
#define all(v) (v).begin(), (v).end()

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using namespace std;

template <class T> void minimize (T &t, T f) {if (t > f) t = f;}
template <class T> void maximize (T &t, T f) {if (t < f) t = f;}

const int maxN = 1e3 + 5;
const int inf = 1e18 + 7;
const int mod = 1e9 + 7;

// khong tu code thi khong kha len duoc dau
// biet sol roi thi tu lam not di

int n, m;
int a[maxN];
vector <int> adj[maxN];
int sz[maxN];
int dp[maxN][maxN][3]; // 0 : chua cho, 1 : cho roi, chua nhan, 2 : cho roi, nhan roi
void dfs (int u, int p) {
    dp[u][0][0] = 0;
    dp[u][1][2] = a[u];
    sz[u] = 1;
    for (auto v : adj[u]) {
        if (v == p) {
            continue;
        }
        if (sz[v] == 0) {
            dfs (v, u);
        };
        for (int j = sz[u]; j >= 0; j --) {
            for (int k = 1; k <= sz[v]; k ++) {
                minimize (dp[u][j + k][0], dp[u][j][0] + min ({dp[v][k][0], dp[v][k][1]}));
                minimize (dp[u][j + k][1], dp[u][j][1] + min ({dp[v][k][0], dp[v][k][1], dp[v][k][2]}));
                minimize (dp[u][j + k][1], dp[u][j][2] + min (dp[v][k][1], dp[v][k][2]));
                minimize (dp[u][j + k][2], dp[u][j][2] + dp[v][k][0]);
            }
        }
        sz[u] += sz[v];
    }
}

void solve () {
    cin >> n >> m;
    for (int i = 0; i <= n; i ++) {
        if (i) {
            cin >> a[i];
        }
        for (int j = 0; j <= n; j ++) {
            dp[i][j][0] = dp[i][j][1] = dp[i][j][2] = inf;
        }
    }
    for (int i = 1; i <= m; i ++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back (v);
        adj[v].push_back (u);
    }
    for (int i = 1; i <= n; i ++) {
        if (sz[i] == 0) {
            dfs (i, 0);
            adj[0].push_back (i);
        }
    }
    dfs (0, 0);
    int q;
    cin >> q;
    for (int i = 1; i <= q; i ++) {
        int x;
        cin >> x;
        for (int k = n; k >= 0; k --) {
            if (dp[0][k][0] <= x) {
                cout << k << '\n';
                break;
            }
        }
    }
    return;
}

signed main () {
    cin.tie (nullptr) -> sync_with_stdio (false);
    if (fopen (task".inp", "r")) {
        freopen (task".inp", "r", stdin);
        freopen (task".out", "w", stdout);
    }
    int t = 1;
    //cin >> t;
    while (t --) {
        solve ();
    } 
    return 0;
}
// thfv

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

dzumbus.cpp: In function 'int main()':
dzumbus.cpp:98:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |         freopen (task".inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
dzumbus.cpp:99:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |         freopen (task".out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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