제출 #1156660

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1156660		MPG	Just Long Neckties (JOI20_ho_t1)	C++20	100 / 100	234 ms	17852 KiB

ho_t1

//#pragma GCC optomize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse4.1,sse4.2") 



#include <bits/stdc++.h>
using namespace std;
typedef long long                           ll;
#define                                     max_heap priority_queue<pair <ll, pair <ll, ll>>>
#define                                     min_heap priority_queue<pair <ll, ll>, vector<pair <ll, ll>>, greater<pair <ll, ll>>>
//#define                                     min_heap priority_queue<ll, vector<ll>, greater<ll>>
#define                                     sariE cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false);
#define                                     filE freopen("in.txt", "r", stdin); freopen("out1.txt", "w", stdout); 
#define                                     endl '\n'
#define                                     md(a) (a % mod + mod) % mod
#define pb push_back
//cout << vectorprecision(5) << fixed << f;
//hash prime = 769
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


ll const maxn = 2e5 + 123;
ll const inf = 2e18;
ll const loG = 23;
ll const mod = 1e9 + 7;
//ll const mod = 998244353;
ll const sq = 350;
ll power(ll a, ll b, ll mod){if(b==0)return 1;if(b==1)return a;ll x = power(a, b / 2, mod);return (((x * x) % mod) * (b % 2 ? a : 1)) % mod;}



ll n, asl[maxn], ans[maxn];
vector <pair <ll, ll>> arr;
multiset <ll> st;

void Solve(){

cin >> n;
for (int i = 1; i < n + 2; i++){
    ll x; cin >> x;
    arr.pb({x, i});
}
for (int i = 1; i < n + 1; i++){
    cin >> asl[i];
}
arr.pb({-1, -1});
sort(arr.begin(), arr.end());
sort(asl + 1, asl + n + 1);
for (int i = 2; i < n + 2; i++){
    st.insert(max((ll)0, arr[i].first - asl[i - 1]));
}
ans[arr[1].second] = *prev(st.end());
for (int i = 2; i < n + 2; i++){
    ll x = max((ll)0, arr[i].first - asl[i - 1]);
    st.erase(st.find(x));
    st.insert(max((ll)0, arr[i - 1].first - asl[i - 1]));
    ans[arr[i].second] = *prev(st.end());
}
for (int i = 1; i < n + 2; i++)
    cout << ans[i] << ' ';
cout << endl;


}





int main(){
sariE;// filE;



int test = 1;
//cin >> test;
while (test--) Solve();
return 0;
}

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