oj.uz

Submission #14460

# Submission time Handle Problem Language Result Execution time Memory
14460 2015-05-17T08:25:45 Z yys980 정전 (OJUZ10_blackout) C++
100 / 100
 52 ms 10456 KB 
#include <stdio.h>
#include <algorithm>
using namespace std;
int n,l;
long long sum;
long long slight[300000],elight[300000];
long long allight[300000][2],acnt;
int main()
{
    scanf("%d %d",&n, &l);
    int i;
    for(i = 1 ; i <= n ; i++){
        scanf("%lld",&slight[i]);
        slight[i]-=l;
    }
    sort(slight+1,slight+1+n);
    for(i = 1 ; i <= n ; i++){
        elight[i]=slight[i]+l*2;
    }

    for(i = 1 ; i < n ; i++){
        if(slight[i+1] >= elight[i])continue;
        allight[acnt][0]=slight[i+1];
        allight[acnt][1]=elight[i];
        if(acnt>=1 && allight[acnt][0]<=allight[acnt-1][1]){
            allight[acnt-1][1]=allight[acnt][1];
            allight[acnt][0]=allight[acnt][1]=0;
        }
        else acnt++;
    }
    for(i = 0 ; i < acnt ; i++){
        sum+=(allight[i][1]-allight[i][0]);
    }
    printf("%lld",sum);
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 10456 KB Output is correct
2 Correct 41 ms 10456 KB Output is correct
3 Correct 0 ms 10456 KB Output is correct
4 Correct 25 ms 10456 KB Output is correct
5 Correct 40 ms 10456 KB Output is correct
6 Correct 19 ms 10456 KB Output is correct
7 Correct 29 ms 10456 KB Output is correct
8 Correct 30 ms 10456 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 10456 KB Output is correct
2 Correct 38 ms 10456 KB Output is correct
3 Correct 20 ms 10456 KB Output is correct
4 Correct 19 ms 10456 KB Output is correct
5 Correct 23 ms 10456 KB Output is correct
6 Correct 0 ms 10456 KB Output is correct
7 Correct 20 ms 10456 KB Output is correct
8 Correct 45 ms 10456 KB Output is correct
9 Correct 47 ms 10456 KB Output is correct
10 Correct 16 ms 10456 KB Output is correct
11 Correct 35 ms 10456 KB Output is correct
12 Correct 44 ms 10456 KB Output is correct
13 Correct 19 ms 10456 KB Output is correct
14 Correct 52 ms 10456 KB Output is correct
15 Correct 38 ms 10456 KB Output is correct