Submission #762939

#	Time	Username	Problem	Language	Result	Execution time	Memory
762939		giaminh2211	Just Long Neckties (JOI20_ho_t1)	C++14	9 / 100	1066 ms	3284 KiB

ho_t1

#include<bits/stdc++.h>
#define fn(n) for(int i=1; i<=n; i++)
#define v first
#define s second

using namespace std;
using ll=long long;

int n;
pair<int, int> a[200002];
int c[200002];
int res[200002];

void nhap(){
    cin >> n;
    for(int i=1; i<=n+1; i++){
        cin >> a[i].v;
        a[i].s=i;
    }
    fn(n) cin >> c[i];
    sort(a+1, a+n+2);
    sort(c+1, c+n+1);
}

void solve(){
    for(int i=1; i<=n+1; i++){
        int l=0, r=0;
        while(l <= n && r < n){
            ++l;
            if(l==i) ++l;
            ++r;
            if(a[l].v>c[r]) res[a[i].s]=max(res[a[i].s], a[l].v-c[r]);
        }
    }
    for (int i=1; i<=n+1; i++) cout << res[i] << ' ';
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    nhap();
    solve();
}

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