| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 307873 | Bill_00 | Just Long Neckties (JOI20_ho_t1) | C++14 | 421 ms | 12700 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>
#define pp push
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
using namespace std;
pair<int,int>p[200005];
pair<int,int>h[200005];
int dpf[200005];
int dpl[200005];
vector<pair<int,int> >v;
int main(){
int n;
cin >> n;
for(int i=1;i<=n+1;i++){
int a;
cin >> a;
p[i]=mp(a,i);
}
for(int i=1;i<=n;i++){
int a;
cin >> a;
h[i]=mp(a,i);
}
sort(p+1,p+n+2);
sort(h+1,h+n+1);
dpf[0]=0;
for(int i=1;i<=n;i++){
int a=p[i].ff;
int b=h[i].ff;
dpf[i]=max(dpf[i-1],a-b);
}
dpl[n+1]=0;
for(int i=n;i>=1;i--){
int a=p[i+1].ff;
int b=h[i].ff;
dpl[i]=max(dpl[i+1],a-b);
}
for(int i=1;i<=n+1;i++){
v.pb(mp(p[i].ss,max(dpf[i-1],dpl[i])));
}
sort(v.begin(),v.end());
for(int i=0;i<v.size();i++){
cout << v[i].ss << ' ';
}
}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... | ||||
