제출 #1136017

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1136017		banh@@notpro33	Džumbus (COCI19_dzumbus)	C++20	50 / 110	32 ms	17224 KiB

dzumbus

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define fi first
#define se second
#define pii pair<int, int>
#define pb push_back
#define eb emplace_back
#define task "file"
const int nmax = 1005;
int dp[nmax][nmax][2][2], sz[nmax], d[nmax], vis[nmax], n, m;
int res[nmax];
vector<int> adj[nmax];
void dfs(int u, int p = -1)
{
    vis[u] = 1;
    sz[u] = 1;
    dp[u][0][0][0] = 0;
    dp[u][1][1][0] = d[u];
    for (int v : adj[u])
    {
        if (v == p || vis[v])
            continue;
        dfs(v, u);
        for (int i = sz[u]; i >= 0; i--)
        {
            for (int j = 0; j <= sz[v]; j++)
            {
                dp[u][i + j][0][0] = min(dp[u][i + j][0][0], dp[u][i][0][0] + dp[v][j][1][1]);
                dp[u][i + j][0][0] = min(dp[u][i + j][0][0], dp[u][i][0][0] + dp[v][j][0][0]);
                dp[u][i + j][1][0] = min(dp[u][i + j][1][0], dp[u][i][1][0] + dp[v][j][0][0]);
                dp[u][i + j][1][1] = min(dp[u][i + j][1][1], dp[u][i][1][0] + dp[v][j][1][0]);
                dp[u][i + j][1][1] = min(dp[u][i + j][1][1], dp[u][i][1][0] + dp[v][j][1][1]);
                dp[u][i + j][1][1] = min(dp[u][i + j][1][1], dp[u][i][1][1] + dp[v][j][1][1]);
                dp[u][i + j][1][1] = min(dp[u][i + j][1][1], dp[u][i][1][1] + dp[v][j][0][0]);
                dp[u][i + j][1][1] = min(dp[u][i + j][1][1], dp[u][i][1][1] + dp[v][j][1][0]);
            }
        }
        sz[u] += sz[v];
    }
}

signed main()
{
    if (fopen(task ".inp", "r"))
    {
        freopen(task ".inp", "r", stdin);
        freopen(task ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> d[i];
    }
    for (int u, v, i = 1; i <= m; i++)
    {
        cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    memset(dp, 0x3f3f3f, sizeof(dp));
    for (int i = 1; i <= n; i++)
    {
        if (!vis[i])
        {
            dfs(i);
        }
    }
    memset(res, 0x3f3f3f, sizeof(res));
    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j <= n; j++)
        {
            res[j] = min({res[j], dp[i][j][0][0], dp[i][j][1][1]});
        }
    }
    for (int i = n - 1; i >= 0; i--)
    {
        res[i] = min(res[i], res[i + 1]);
    }
    int q;
    cin >> q;
    while (q--)
    {
        int x;
        cin >> x;
        int l = 2, r = n, ans = 0;
        while (l <= r)
        {
            int mid = (l + r) >> 1;
            if (res[mid] <= x)
                ans = mid, l = mid + 1;
            else
                r = mid - 1;
        }
        cout << ans << '\n';
    }
    return 0;
}

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

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

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