제출 #6878

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
6878		gs12117	도장 모으기 (JOI14_stamps)	C++98	85 / 100	0 ms	5780 KiB

stamps

#include<stdio.h>
#define INF 999999999999999LL
int n;
long long int m;
long long int a[100100];
long long int b[100100];
long long int c[100100];
long long int d[100100];
long long int dpa[100100];
long long int dpb[100100];
long long int stp;
int main(){
	int i;
	scanf("%d%lld",&n,&m);
	dpa[0]=m;
	dpb[0]=INF;
	stp=INF;
	for(i=0;i<n;i++){
		scanf("%lld%lld%lld%lld",&a[i],&b[i],&c[i],&d[i]);
		if(stp>b[i]+c[i])stp=b[i]+c[i];
		dpa[i+1]=dpa[i]+a[i]+b[i];
		dpb[i+1]=dpb[i]+a[i]+b[i];
		if(dpb[i+1]>dpb[i]+c[i]+d[i])dpb[i+1]=dpb[i]+c[i]+d[i];
		if(dpa[i+1]>dpb[i]+a[i]+d[i])dpa[i+1]=dpb[i]+a[i]+d[i];
		if(dpb[i+1]>dpa[i]+b[i]+c[i])dpb[i+1]=dpa[i]+b[i]+c[i];
		if(dpb[i+1]>dpa[i]+stp+c[i]+d[i])dpb[i+1]=dpa[i]+stp+c[i]+d[i];
		if(dpb[i+1]>dpa[i+1]+stp)dpb[i+1]=dpa[i+1]+stp;
		dpa[i+1]+=m;
		dpb[i+1]+=3*m;
		stp+=2*m;
	}
	printf("%lld",dpa[n]);
}

• Subtask 1: 10 / 10
• Subtask 2: 75 / 75
• Subtask 3: 0 / 15