Submission #14046

#	Time	Username	Problem	Language	Result	Execution time	Memory
14046		paulsohn	정전 (OJUZ10_blackout)	C++98	100 / 100	51 ms	1708 KiB

blackout

#include <cstdio>
#include <algorithm>
using namespace std;

int N, X[160000];
long long L, a=-0xFFFFFFFF, b=-0xFFFFFFFFF, sum=0;

int main()
{
    int i,inp;
    scanf("%d%lld",&N,&L);
    for(i=0;i<N;++i) scanf("%d",X+i);
    sort(X,X+N);
    for(i=0;i<N;++i){
        if(b<X[i]-L){
            a=X[i]-L;
            b=X[i]+L;
        }
        else{
            sum+=b-max(a,X[i]-L);
            a=b;
            b=X[i]+L;
        }
    }
    printf("%lld",sum);

    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 30 / 30
• Subtask 4: 40 / 40