Submission #331287

#	Time	Username	Problem	Language	Result	Execution time	Memory
331287		syy	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	132 ms	15616 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(ll i = (ll)a; i <= (ll)b; i++)
#define DEC(i, a, b) for(ll i = (ll)a; i >= (ll)b; i--)
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<ll, pi> ipi;
typedef pair<pi, pi> pipi;
#define f first
#define s second
typedef vector<ll> vi;
typedef vector<pi> vpi;
typedef vector<pii> vpii;
#define pb push_back
#define pf push_front
#define all(v) v.begin(), v.end()
#define size(v) (ll) v.size()
#define disc(v) sort(all(v)); v.resize(unique(all(v)) - v.begin());
#define INF (ll) 1e9 + 100
#define LLINF (ll) 1e18
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define sandybridge __attribute__((optimize("Ofast"), target("arch=sandybridge")))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline ll rand(ll x, ll y) { ++y; return (rng() % (y-x)) + x; } //inclusivesss

ll n, b[200005], pref[200005], suff[200005], ans[200005];
pi a[200005];

int main() {
	fastio; cin >> n;
	FOR(i, 1, n+1) {
		cin >> a[i].f;
		a[i].s = i;
	}
	FOR(i, 1, n) cin >> b[i];
	sort(a+1, a+n+2);
	sort(b+1, b+n+1);
	DEC(i, n, 1) suff[i] = max(suff[i+1], a[i+1].f - b[i]);
	FOR(i, 1, n+1) {
		ans[a[i].s] = max({pref[i-1], suff[i+1], a[i+1].f - b[i]});
		pref[i] = max(pref[i-1], a[i].f - b[i]);
	}
	FOR(i, 1, n+1) cout << ans[i] << " ";
}

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