Submission #469456

#	Time	Username	Problem	Language	Result	Execution time	Memory
469456		robell	Stove (JOI18_stove)	C++17	20 / 100	1091 ms	23756 KiB

stove

#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef long long ll;
#define pb push_back
#define eb emplace_back
#define countbits __builtin_popcount
#define beg0 __builtin_clz
#define terminal0 __builtin_ctz
int mod = 1e9+7;
void setIO(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
}
void setIO(string f){
	freopen((f+".in").c_str(),"r",stdin);
	freopen((f+".out").c_str(),"w",stdout);
	setIO();
}
int N, K;
int t[100001];
int main(){
	setIO();
	cin >> N >> K;
	for (int i=0;i<N;i++) cin >> t[i];
	ll dp[N][K+1];
	for (int i=0;i<N;i++){
		if (i==0) dp[i][1]=0;
		else dp[i][1]=t[i]-t[i-1]+dp[i-1][1];
	}
	for (int k=2;k<=K;k++){
		for (int i=0;i<N;i++){
			dp[i][k]=1e18;
			for (int j=0;j<i;j++){
				dp[i][k]=min(t[i-1]+1-t[j]+dp[j][k-1],dp[i][k]);
			}
		}
	}
	ll totmin = 1e18;
	for (int i=0;i<N;i++){
		totmin=min(dp[i][K]+t[N-1]+1-t[i],totmin);
	}
	cout << totmin << "\n";
}

Compilation message (stderr)

stove.cpp: In function 'void setIO(std::string)':
stove.cpp:19:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |  freopen((f+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
stove.cpp:20:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |  freopen((f+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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