# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
251887 | ivandasfs | Just Long Neckties (JOI20_ho_t1) | C++14 | 143 ms | 10872 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 x first
#define y second
#define mp make_pair
#define pb push_back
typedef long long ll;
const ll MOD = 1e9+7;
const ll INF = 1e9+5;
pair <int, int> a[200005];
int b[200005];
int pref[200005];
int suff[200005];
int sol[200005];
int main() {
int n;
scanf("%d", &n);
for (int i=1 ; i<=n+1 ; i++) {
scanf("%d", &a[i].x);
a[i].y = i;
}
sort(a+1, a+n+2);
for (int i=1 ; i<=n ; i++) {
scanf("%d", b+i);
}
sort(b+1, b+n+1);
for (int i=1 ; i<=n ; i++) {
pref[i] = max(pref[i-1], max(a[i].x-b[i], 0));
}
for (int i=n+1 ; i>=2 ; i--) {
suff[i] = max(suff[i+1], max(a[i].x-b[i-1], 0));
}
for (int i=1 ; i<=n+1 ; i++) {
sol[a[i].y] = max(pref[i-1], suff[i+1]);
}
for (int i=1 ; i<=n+1 ; i++) {
printf("%d ", sol[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... |