Submission #4832

#	Time	Username	Problem	Language	Result	Execution time	Memory
4832		gs13068	택배 (KOI13_delivery)	C++98	100 / 100	20 ms	1212 KiB

delivery

#include<cstdio>
#include<algorithm>

struct delivery
{
	int start;
	int end;
	int howmany;
} d[10000];

inline bool operator <(const delivery &a,const delivery &b)
{
	if(a.end!=b.end)return a.end<b.end;
	if(a.start!=b.start)return a.start>b.start;
	return a.howmany>b.howmany;
}

int a[2001];

int main()
{
	int i,j,n,m,c,res=0,min;
	scanf("%d%d%d",&n,&c,&m);
	for(i=0;i<m;i++)scanf("%d%d%d",&d[i].start,&d[i].end,&d[i].howmany);
	std::sort(d,d+m);
	for(i=0;i<m;i++)
	{
		min=d[i].howmany;
		for(j=d[i].start;j<d[i].end;j++)if(c-a[j]<min)min=c-a[j];
		res+=min;
		for(j=d[i].start;j<d[i].end;j++)a[j]+=min;
	}
	printf("%d",res);
}

• Subtask 1: 15 / 15
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 23 / 23
• Subtask 5: 25 / 25