| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 647303 | ck_platypus | Just Long Neckties (JOI20_ho_t1) | C++14 | 92 ms | 13932 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 <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <algorithm>
#include <utility>
#include <bitset>
#include <climits>
#include <set>
#include <map>
#include <iomanip>
#include <queue>
#include <cstring>
#include <fstream>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define plpll pair<ll, pll>
#define pii pair<int, int>
#define f first
#define s second
#define inf 1000000000000000
#define endl '\n'
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll n;
cin >> n;
ll b[n];
pll a[n+1];
for(int i=0;i<n+1;i++) cin >> a[i].f, a[i].s=i;
sort(a, a+n+1);
for(int i=0;i<n;i++) cin >> b[i];
sort(b, b+n);
ll mx[n];
mx[n-1]=max(0ll, a[n].f-b[n-1]);
for(int i=n-2;i>=0;i--){
mx[i]=max(mx[i+1], a[i+1].f-b[i]);
}
ll ans[n+1], cool=0;
for(int i=0;i<n;i++){
ans[a[i].s]=max(cool, mx[i]);
cool=max(cool, a[i].f-b[i]);
}
ans[a[n].s]=cool;
for(int i=0;i<n+1;i++) cout << ans[i] << ' ';cout << endl;
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... | ||||
