Submission #826303

#	Time	Username	Problem	Language	Result	Execution time	Memory
826303		ajay	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	83 ms	10820 KiB

ho_t1

/* Ajay Jadhav */

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;

#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'

void solve()
{
    int n;
    std::cin >> n;
    vii a(n + 2);
    vi b(n + 1), ans(n + 2);
    vi pref(n + 1), suff(n + 1);
    rep(i, 1, n + 2)
    {
        cin >> a[i].first;
        a[i].y = i;
    }
    rep(i, 1, n + 1)
    {
        cin >> b[i];
    }
    sort(a.begin() + 1, a.begin() + n + 2);
    sort(b.begin() + 1, b.begin() + n + 1);

    rep(i, 1, n + 1)
    {
        pref[i] = max(pref[i - 1], max(a[i].first - b[i], 0));
    }
    rep(i, 1, n + 1)
    {
        suff[i] = max(suff[i - 1], max(a[n + 2 - i].first - b[n + 1 - i], 0));
    }

    rep(i, 1, n + 2)
    {
        ans[a[i].y] = max(pref[i - 1], suff[n + 1 - i]);
    }

    rep(i, 1, n + 2)
    {
        cout << ans[i] << ' ';
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin>>t;
    while (t--)
    {
        solve();
    }
    return 0;
}

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