Submission #8553

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
8553	2014-09-16 14:39:02	gs14004	택배 (KOI13_delivery)	C++98	100 / 100	12 ms	1720 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
28
29
30
#include <cstdio>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
struct good{int s,e,x;}d[10005];
bool cmp(good a, good b){
    return a.s == b.s ? a.e > b.e : a.s < b.s;
}
bool operator<(good a, good b){return a.e < b.e;}
int n,c,m;
int a[2005],cdone;
priority_queue<good> pq;
int main(){
    scanf("%d %d %d",&n,&c,&m);
    for (int i=0; i<m; i++) {
        scanf("%d %d %d",&d[i].s,&d[i].e,&d[i].x);
        a[d[i].s] += d[i].x;
        a[d[i].e] -= d[i].x;
        cdone += d[i].x;
    }
    a[1] -= c;
    a[n] += c;
    sort(d,d+m,cmp);
    for (int i=1; i<=n; i++) {
        a[i] += a[i-1];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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