Submission #16239

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
16239	2015-08-18 11:13:31	eaststar	택배 (KOI13_delivery)	C++14	100 / 100	30 ms	1208 KiB

delivery

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
#include <stdio.h>
#include <algorithm>
using namespace std;
struct data{
    int s,e,cnt;
    bool operator<(const data&r)const{
        if(e==r.e)return s>r.s;
        return e<r.e;
    }
}a[10010];
int s[2010],ans,mx;
int main(){
    int i,j,n,c,m;
    scanf("%d%d%d",&n,&c,&m);
    for(i=0;i<m;++i)scanf("%d%d%d",&a[i].s,&a[i].e,&a[i].cnt);
    sort(a,a+m);
    for(i=0;i<m;++i){
        mx=0;
        for(j=a[i].s;j<a[i].e;++j)mx=max(mx,s[j]);
        mx=min(a[i].cnt,c-mx);
        for(j=a[i].s;j<a[i].e;++j)s[j]+=mx;
        ans+=mx;
    }
    printf("%d",ans);
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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