# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
224017 | dantoh000 | Just Long Neckties (JOI20_ho_t1) | C++14 | 5 ms | 384 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;
const int N = 200005;
typedef pair<int,int> ii;
ii a[N];
int b[N];
int l[N], r[N];
int ans[N];
int main(){
int n;
scanf("%d",&n);
for (int i = 1; i <= n+1; i++){
scanf("%d",&a[i].first);
a[i].second = i;
}
for (int i = 1; i <= n; i++){
scanf("%d",&b[i]);
}
sort(a+1,a+n+2);
sort(b+1,b+n+1);
for (int i = 1; i <= n; i++){
l[i] = max(l[i-1],max(0,a[i].first-b[i]));
}
for (int i = n; i >= 1; i--){
printf("%d %d\n",a[i+1].first,b[i]);
r[i] = max(r[i+1],max(0,a[i+1].first-b[i]));
}
for (int i = 1; i <= n; i++){
//printf("%d %d %d\n",i,l[i],r[i+1]);
}
for (int i = 1; i <= n+1; i++){
//printf("%d %d\n",a[i].first,a[i].second);
ans[a[i].second] = max(l[i-1],r[i]);
}
for (int i = 1; i <= n+1; i++) printf("%d ",ans[i]);
}
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... |