# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
556889 | hibiki | Just Long Neckties (JOI20_ho_t1) | C++11 | 1 ms | 212 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<bits/stdc++.h>
using namespace std;
#define PB push_back
#define F first
#define S second
int n;
int fl[200200],fr[200200],ans[200200];
vector<int> od;
vector<pair<int,int> > nw;
int main()
{
scanf("%d",&n);
od.resize(n);
nw.resize(n+1);
for(int i=0;i<n+1;i++)
scanf("%d",&nw[i].F),nw[i].S=i+1;
for(int i=0;i<n;i++)
scanf("%d",&od[i]);
sort(nw.begin(),nw.end());
sort(od.begin(),od.end());
for(int i=0;i<n;i++)
{
fl[i]=abs(od[i]-nw[i].F);
if(i)
fl[i]=max(fl[i],fl[i-1]);
}
ans[nw[n].S]=fl[n-1];
for(int i=n-1;i>=0;i--)
{
fr[i]=abs(od[i]-nw[i+1].F);
if(i<n-1)
fr[i]=max(fr[i],fr[i+1]);
if(i)
ans[nw[i].S]=max(fl[i-1],fr[i]);
}
ans[nw[0].S]=fr[0];
for(int i=1;i<=n+1;i++)
printf("%d ",ans[i]);
printf("\n");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |