# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14217 | khsoo01 | 정전 (OJUZ10_blackout) | C++98 | 51 ms | 4012 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<cstdio>
#include<algorithm>
#define INF 0x7fffffff
using namespace std;
int n,l,a[150005],seg[2][150005][2],cnt[2],i,i1,i2,ans;
int main()
{
scanf("%d%d",&n,&l);
for(i=0;i<n;i++) {
scanf("%d",&a[i]);
}
std::sort(a,a+n);
for(i=0;i<150005;i++){
seg[0][i][0]=-INF;
seg[0][i][1]=-INF;
seg[1][i][0]=-INF;
seg[1][i][1]=-INF;
}
for(i=0;i<n;i+=2) {
if(seg[0][cnt[0]][1]<a[i]-l+1){
cnt[0]++;
seg[0][cnt[0]][0]=a[i]-l+1;
seg[0][cnt[0]][1]=a[i]+l;
}
else seg[0][cnt[0]][1]=a[i]+l;
}
for(i=1;i<n;i+=2) {
if(seg[1][cnt[1]][1]<a[i]-l+1){
cnt[1]++;
# | 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... |