Submission #159143

#	Time	Username	Problem	Language	Result	Execution time	Memory
159143		AKaan37	Stove (JOI18_stove)	C++17	0 / 100	240 ms	262148 KiB

stove

//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
 

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t,dp[5005][5005][4];
int cev;
string s;
vector<int> v;

inline int f(int sira,int kac,int al){
	
	int cevv=inf;
	if(kac>k)return inf;
	//~ cout<<sira<<" "<<kac<<" "<<al<<endl;
	if(sira>n)return 0;
	if(~dp[sira][kac][al])return dp[sira][kac][al];
	if(al==0){
		cevv=min(cevv,f(sira+1,kac,1)+1);
		cevv=min(cevv,f(sira+1,kac+1,0)+1);
		
	}
	if(al==1){
		cevv=min(cevv,f(sira+1,kac,1)+a[sira]+1-(a[sira-1]+1));
		cevv=min(cevv,f(sira+1,kac+1,0)+a[sira]+1-a[sira-1]-1);
	}
	return dp[sira][kac][al]=cevv;
}

int main(void){
	memset(dp,-1,sizeof(dp));
	scanf("%d %d",&n,&k);
	FOR{
		scanf("%d",&a[i]);
	}
	printf("%d\n",f(1,1,0));
	return 0;
}

Compilation message (stderr)

stove.cpp: In function 'int main()':
stove.cpp:63:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&k);
  ~~~~~^~~~~~~~~~~~~~~
stove.cpp:65:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i]);
   ~~~~~^~~~~~~~~~~~

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