제출 #445602

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
445602		arwaeystoamneg	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	119 ms	10820 KiB

ho_t1

// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 31607;//998244353    1000000007

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}

int n;
vpi a;
vi b, prefix, suffix;
int main()
{
	setIO("test1");
	cin >> n;
	a.rsz(n + 1);
	trav(x, a)cin >> x.f;
	F0R(i, n + 1)a[i].s = i;
	sort(all(a));
	b.rsz(n);
	trav(x, b)cin >> x;
	sort(all(b));
	prefix.rsz(n + 1);
	suffix.rsz(n + 1);
	F0R(i, n)prefix[i + 1] = max(prefix[i], (a[i].f - b[i]));
	R0F(i, n)suffix[i] = max(suffix[i + 1], (a[i + 1].f - b[i]));
	vi ans(n + 1);
	F0R(i, n + 1)ans[a[i].s] = max(prefix[i], suffix[i]);
	trav(x, ans)cout << x << " ";
	cout << endl;
}

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