Submission #1312399

#	Time	Username	Problem	Language	Result	Execution time	Memory
1312399		coderg	Stove (JOI18_stove)	C++20	100 / 100	21 ms	1224 KiB

stove

#include "bits/stdc++.h"
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define pb push_back
void setIO(string name = ""){if(name.size()){ freopen((name + ".in").c_str(), "r", stdin);freopen((name + ".out").c_str(), "w", stdout);}}
#define F(i,l,r) for(int i=(l);i<(r);++i)
#define FR(i,l,r) for(int i=(l);i>=(r);--i)
typedef long long ll;

const int maxn=4000005;
const int mod=998244353;
const int mox=2000*500+505;
const int inf=1e9;

void solve(){
int n,k;
cin>>n>>k;
vector<int> t(n);
F(i,0,n)cin>>t[i];
vector<int> gaps;
if(n>1){
    gaps.reserve(n-1);
    F(i,0,n-1){
        int g=t[i+1]-t[i]-1;
        gaps.pb(g);
    }
}
sort(gaps.rbegin(),gaps.rend());
ll tot=(ll)t[n-1]+1-t[0];
int cuts=k-1;
ll saved=0;
for(int i=0;i<gaps.size() && i<cuts;++i)saved+=gaps[i];
cout<<(tot-saved)<<'\n';
}

signed main() {
    ios_base::sync_with_stdio(0);cin.tie(nullptr);
    
    int tt=1;
    //cin>>tt;
    while(tt--)solve(); 

    return 0;
}

Compilation message (stderr)

stove.cpp: In function 'void setIO(std::string)':
stove.cpp:10:54: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void setIO(string name = ""){if(name.size()){ freopen((name + ".in").c_str(), "r", stdin);freopen((name + ".out").c_str(), "w", stdout);}}
      |                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
stove.cpp:10:98: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void setIO(string name = ""){if(name.size()){ freopen((name + ".in").c_str(), "r", stdin);freopen((name + ".out").c_str(), "w", stdout);}}
      |                                                                                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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