Submission #292904

#	Time	Username	Problem	Language	Result	Execution time	Memory
292904		Hehehe	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	117 ms	15608 KiB

ho_t1

#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define sz(x) (int)((x).size())
#define int long long

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

const ll inf = 2e9;
const ll mod = 1e9 + 7;
const int N = 2e5 + 11;
const int X = 1e6;
const ll INF64 = 3e18 + 1;
const double eps = 1e-14;
const double PI = acos(-1);

//ifstream in(".in");
//ofstream out(".out");

int n, b[N], s[N], ans[N], l[N], r[N];
pi a[N];

void solve(){

    cin >> n;

    for(int i = 1; i <= n + 1; i++){
        cin >> a[i].ff;
        a[i].ss = i;
    }

    sort(a + 1, a + n + 2);

    for(int i = 1; i <= n; i++){
        cin >> b[i];
    }

    sort(b+ 1, b + n + 1);

    for(int i = 1; i <= n; i++){
        l[i + 1] = max(l[i], a[i].ff - b[i]);
    }

    for(int i = n; i > 0; i--){
        r[i] = max(r[i + 1], a[i + 1].ff - b[i]);
    }

    for(int i = 1; i <= n + 1; i++){
        ans[a[i].ss] += max(l[i], r[i]);
    }

    for(int i = 1; i <= n + 1; i++){
        cout << max(0ll, ans[i]) << ' ';
    }cout << '\n';

}

int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);

    //cout << setprecision(6) << fixed;

    int T = 1;
    //cin >> T;
    while(T--){
        solve();
    }
}

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 91 / 91