| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 14394 | pjsdream | 정전 (OJUZ10_blackout) | C++98 | 52 ms | 1668 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <algorithm>
int a[150005], ans;
int main(){
int n, L;
scanf("%d %d", &n, &L);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
std::sort(a, a + n);
int x = a[0] + L, s = a[0] - L;
for (int i = 1; i < n; i++){
if(a[i] - L > s) s = a[i] - L;
if (s <= x){
ans += (x - s);
s = x;
}
x = a[i] + L;
}
printf("%d", ans);
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
