Submission #915404

#	Time	Username	Problem	Language	Result	Execution time	Memory
915404		HorizonWest	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	327 ms	24856 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e9 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

void solve()
{
    int n; cin >> n; 
    vector <int> a(n+1), b(n), c; 
    for(auto& u : a) cin >> u;
    for(auto& u : b) cin >> u;

    c = a; sort(all(a)); sort(all(b));

    vector <int> s(n+1);
    for(int i = n; i > 0; i--)
        s[i-1] = max(s[i], a[i] - b[i-1]);

    int mx = 0; map <int, int> mp;

    for(int i = 0; i <= n; i++)
    {
        mp[a[i]] = max(mx, s[i]); 
        mx = max(mx, a[i] - b[i]);
    }

    for(auto& u : c) cout << mp[u] << " ";
}

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

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}

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