Submission #361904

#	Time	Username	Problem	Language	Result	Execution time	Memory
361904		Lightning	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	322 ms	19436 KiB

ho_t1

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
//#define int ll

const int N = 2e5 + 5;
const int oo = 1e9 + 5;

int n, ans[N];
pii a[N], b[N];
multiset <int> st;

void solve() {
    cin >> n;
    for (int i = 1; i <= n+1; ++i) {
        cin >> a[i].F;
        a[i].S = i;
    }
    for (int i = 1; i <= n; ++i) {
        cin >> b[i].F;
        b[i].S = i;
    }
    sort(a + 1, a + n + 2);
    sort(b + 1, b + n + 1);
    for (int i = 1; i <= n; ++i) {
        st.insert(max(a[i].F - b[i].F, 0));
    }
    ans[a[n+1].S] = *st.rbegin();
    for (int i = n; i >= 1; --i) {
        st.erase(st.find(max(a[i].F - b[i].F, 0))); // old a[i] - b[i]
        st.insert(max(a[i+1].F - b[i].F, 0)); // new a[i+1] - b[i]
        ans[a[i].S] = *st.rbegin();
    }
    for (int i = 1; i <= n+1; ++i) {
        cout << ans[i] <<" ";
    }
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/

Compilation message (stderr)

ho_t1.cpp:74:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   74 |  main () {
      |        ^

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