Submission #14062

#	Time	Username	Problem	Language	Result	Execution time	Memory
14062		kipa00	정전 (OJUZ10_blackout)	C++98	100 / 100	55 ms	2384 KiB

blackout

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

int location[150000];
int L;

int dist(int a, int b) {
    int t = 2 * L - (b - a);
    return t > 0 ? t : 0;
}

int main() {
    int N, i;
    long long int l = 0;
    scanf("%d%d", &N, &L);
    for (i=0; i<N; ++i) {
        scanf("%d", location+i);
    }
    stable_sort(location, location+N);
    for (i=1; i<N; ++i) {
        l += dist(location[i - 1], location[i]);
    }
    for (i=2; i<N; ++i) {
        l -= dist(location[i - 2], location[i]);
    }
    printf("%lld\n", l);
    return 0;
}

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