Submission #1248451

#	Time	Username	Problem	Language	Result	Execution time	Memory
1248451		hainam2k9	Džumbus (COCI19_dzumbus)	C++20	110 / 110	29 ms	17220 KiB

dzumbus

#include <bits/stdc++.h>
#define tt cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(0)
#define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define db long double
#define sz(a) ((int)(a).size())
#define pb emplace_back
#define pf emplace_front
#define pob pop_back
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define ins emplace
#define mp make_pair
using namespace std;
const int MOD = 1e9+7, MAXN = 1e5+5;
const string NAME = "";
int n,m,q,a[1005],sz[1005];
ll dp[1005][1005][2],dp2[1005];
vector<int> adj[1005],v;
void dfs(int u, int par){
    sz[u]=1, dp[u][1][1]=a[u];
    for(int& 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){
                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]));
                if(i+j>1) dp[u][i+j][1]=min(dp[u][i+j][1],dp[u][i-1][0]+a[u]+min(dp[v][j][1],dp[v][j-1][0]+a[v]));
                if(i>1) dp[u][i+j][1]=min(dp[u][i+j][1],dp[u][i][1]+dp[v][j][0]);
                dp[u][i+j][1]=min(dp[u][i+j][1],dp[u][i][1]+min(dp[v][j][1],dp[v][j-1][0]+a[v]));
            }
        sz[u]+=sz[v];
    }
}
int bs(int bound){
    int l=2,r=n,rs=0;
    while(l<=r){
        int mid=(l+r)>>1;
        if(dp2[mid]<=bound) rs=mid, l=mid+1;
        else r=mid-1;
    }
    return rs;
}
int main()
{
    tt;
    if(fopen((NAME + ".INP").c_str(), "r")) fo;
    cin >> n >> m;
    for(int i = 1; i<=n; ++i)
        cin >> a[i];
    for(int i = 1; i<=m; ++i){
        int x,y;
        cin >> x >> y;
        adj[x].pb(y), adj[y].pb(x);
    }
    memset(dp,0x3f,sizeof(dp));
    for(int i = 1; i<=n; ++i)
        dp[i][0][0]=0;
    for(int i = 1; i<=n; ++i)
        if(!sz[i]) dfs(i,0), v.pb(i);
    memset(dp2,0x3f,sizeof(dp2));
    dp2[0]=0;
    for(int& u : v)
        for(int i = n; i>1; --i)
            for(int j = 2; j<=min(i,sz[u]); ++j)
                dp2[i]=min(dp2[i],dp2[i-j]+min(dp[u][j][0],dp[u][j][1]));
    cin >> q;
    while(q--){
        int sum;
        cin >> sum;
        cout << bs(sum) << "\n";
    }
}

Compilation message (stderr)

dzumbus.cpp: In function 'int main()':
dzumbus.cpp:3:19: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    3 | #define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
      |            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dzumbus.cpp:52:45: note: in expansion of macro 'fo'
   52 |     if(fopen((NAME + ".INP").c_str(), "r")) fo;
      |                                             ^~
dzumbus.cpp:3:63: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    3 | #define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
      |                                                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dzumbus.cpp:52:45: note: in expansion of macro 'fo'
   52 |     if(fopen((NAME + ".INP").c_str(), "r")) fo;
      |                                             ^~

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