Submission #245750

#	Time	Username	Problem	Language	Result	Execution time	Memory
245750		Atill83	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	386 ms	18680 KiB

ho_t1

#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;

pii a[MAXN];
int b[MAXN];
int ans[MAXN];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n;

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

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

    sort(a + 1, a + n + 2);
    multiset<int> st;
    sort(b + 1, b + n + 1);
    for(int i = 2; i <= n + 1; i++){
        st.insert(a[i].ff - b[i - 1]);
    }

    ans[a[1].ss] = max(0, *st.rbegin());
    for(int i = 1; i <= n; i++){
        st.erase(st.lower_bound(a[i + 1].ff - b[i]));
        st.insert(a[i].ff - b[i]);
        ans[a[i + 1].ss] = max(0, *st.rbegin());
    }

    for(int i = 1;  i <= n + 1; i++)
        cout<<ans[i]<<" ";
    



    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

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