Submission #1275694

#	Time	Username	Problem	Language	Result	Execution time	Memory
1275694		hainam2k9	여별 열쇠 (JOI15_keys)	C++20	100 / 100	1 ms	1348 KiB

keys

#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,t,k,sz[2005],sum=0,val[2005],dp[2005][2005][2],dp2[2005];
bool vis[2005];
pair<int,int> p[2005];
vector<pair<int,pair<int,int>>> v;
vector<pair<int,int>> adj[2005];
void addedge(int x, int y, int w){
    adj[x].pb(y,w), adj[y].pb(x,w);
}
void dfs(int u){
    dp[u][1][1]=val[u];
    sz[u]=vis[u]=1;
    for(pair<int,int>& e : adj[u]){
        if(vis[e.fi]) continue;
        dfs(e.fi);
        for(int i = min(k,sz[u]); i>=0; --i)
            for(int j = 1; j<=min(sz[e.fi],k-i); ++j){
                dp[u][i+j][0]=max(dp[u][i+j][0],max(dp[e.fi][j][0],dp[e.fi][j][1])+dp[u][i][0]);
                if(i>0) dp[u][i+j][1]=max({dp[u][i+j][1],dp[u][i][1]+dp[e.fi][j][0],dp[u][i][1]+dp[e.fi][j][1]+e.se});
            }
        sz[u]+=sz[e.fi];
    }
}
int main()
{
    tt;
    if(fopen((NAME + ".INP").c_str(), "r")) fo;
    cin >> n >> t >> k;
    for(int i = 1; i<=n; ++i){
        cin >> p[i].fi >> p[i].se;
        v.pb(p[i].fi,mp(i,1)), v.pb(p[i].se,mp(i,-1));
    }
    sort(v.begin(),v.end());
    sum+=v[0].fi+t-v.back().fi;
    for(int i = 1; i<sz(v); ++i){
        if(v[i].se.se==1&&v[i-1].se.se==-1) sum+=v[i].fi-v[i-1].fi;
        if(v[i].se.se==1&&v[i-1].se.se==1) val[v[i-1].se.fi]+=v[i].fi-v[i-1].fi;
        if(v[i].se.se==-1&&v[i-1].se.se==-1) val[v[i].se.fi]+=v[i].fi-v[i-1].fi;
        if(v[i].se.se==-1&&v[i-1].se.se==1){
            if(v[i].se.fi==v[i-1].se.fi) val[v[i].se.fi]+=v[i].fi-v[i-1].fi;
            else addedge(v[i].se.fi,v[i-1].se.fi,v[i].fi-v[i-1].fi);
        }
    }
    for(int i = 1; i<=n; ++i)
        if(!vis[i]){
            dfs(i);
            for(int j = k; j>0; --j)
                for(int z = 1; z<=min(j,sz[i]); ++z)
                    dp2[j]=max(dp2[j],dp2[j-z]+max(dp[i][z][0],dp[i][z][1]));
        }
    cout << dp2[k]+sum;
}

Compilation message (stderr)

keys.cpp: In function 'int main()':
keys.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)
      |            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
keys.cpp:47:45: note: in expansion of macro 'fo'
   47 |     if(fopen((NAME + ".INP").c_str(), "r")) fo;
      |                                             ^~
keys.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)
      |                                                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
keys.cpp:47:45: note: in expansion of macro 'fo'
   47 |     if(fopen((NAME + ".INP").c_str(), "r")) fo;
      |                                             ^~

• Subtask 1: 10 / 10
• Subtask 2: 90 / 90