oj.uz

Submission #5325

# Submission time Handle Problem Language Result Execution time Memory
5325 2014-03-23T11:11:44 Z baneling100 택배 (KOI13_delivery) C++
100 / 100
 20 ms 1212 KB 
#include <stdio.h>
#include <algorithm>

using namespace std;

typedef pair <int,int> ppair;
pair <ppair,int> box[10001];
int n, c, m, d[2001], ans;

void input(void)
{
    int i, x, y, z;

    scanf("%d %d %d",&n,&c,&m);
    for(i=1 ; i<=m ; i++)
    {
        scanf("%d %d %d",&x,&y,&z);
        box[i]=make_pair(make_pair(y-1,-x),-z);
    }
    sort(box+1,box+m+1);
}

void process(void)
{
    int i, j, mmin;

    for(i=1 ; i<=m ; i++)
    {
        box[i].first.second*=-1;
        box[i].second*=-1;
        mmin=box[i].second;
        for(j=box[i].first.second ; j<=box[i].first.first ; j++)
            if(mmin>c-d[j])
                mmin=c-d[j];
        for(j=box[i].first.second ; j<=box[i].first.first ; j++)
            d[j]+=mmin;
        ans+=mmin;
    }
}

void output(void)
{
    printf("%d",ans);
}

int main(void)
{
    input();
    process();
    output();

    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1212 KB Output is correct
2 Correct 0 ms 1212 KB Output is correct
3 Correct 0 ms 1212 KB Output is correct
4 Correct 0 ms 1212 KB Output is correct
5 Correct 0 ms 1212 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1212 KB Output is correct
2 Correct 0 ms 1212 KB Output is correct
3 Correct 0 ms 1212 KB Output is correct
4 Correct 0 ms 1212 KB Output is correct
5 Correct 0 ms 1212 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1212 KB Output is correct
2 Correct 0 ms 1212 KB Output is correct
3 Correct 0 ms 1212 KB Output is correct
4 Correct 0 ms 1212 KB Output is correct
5 Correct 0 ms 1212 KB Output is correct
6 Correct 0 ms 1212 KB Output is correct
7 Correct 0 ms 1212 KB Output is correct
8 Correct 0 ms 1212 KB Output is correct
9 Correct 0 ms 1212 KB Output is correct
10 Correct 0 ms 1212 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1212 KB Output is correct
2 Correct 0 ms 1212 KB Output is correct
3 Correct 0 ms 1212 KB Output is correct
4 Correct 0 ms 1212 KB Output is correct
5 Correct 0 ms 1212 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1212 KB Output is correct
2 Correct 0 ms 1212 KB Output is correct
3 Correct 20 ms 1212 KB Output is correct
4 Correct 20 ms 1212 KB Output is correct
5 Correct 20 ms 1212 KB Output is correct