제출 #941550

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
941550		KiaRez	Measures (CEOI22_measures)	C++17	100 / 100	269 ms	35468 KiB

Main

/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

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

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 3e5+23, lg = 18;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

struct node {
	ll mnl, mxr, res, lazy, num;
	node() {
		res = lazy = num = 0;
		mxr = (ll)-1e18;
		mnl = (ll)1e18;
	}
} seg[2*N];

ll n, m, d, a[N], b[N];
vector<pll> comp;
int get(ll x, ll y) {
	int ptr = lower_bound(all(comp), Mp(x, y)) - comp.begin() + 1;
	return ptr;
}

void pushdown(int ind) {
	seg[ind].num += seg[ind].lazy;
	seg[ind].mxr += (d*seg[ind].lazy);
	seg[ind].mnl += (d*seg[ind].lazy);
	(ind < (1<<lg)) && (seg[2*ind].lazy += seg[ind].lazy);
	(ind < (1<<lg)) && (seg[2*ind+1].lazy += seg[ind].lazy);
	seg[ind].lazy = 0;
}

void pushup(int ind) {
	seg[ind].res = max({seg[2*ind].res, seg[2*ind+1].res, seg[2*ind+1].mxr - seg[2*ind].mnl});
	seg[ind].mxr = max(seg[2*ind].mxr, seg[2*ind+1].mxr);
	seg[ind].mnl = min(seg[2*ind].mnl, seg[2*ind+1].mnl);
}

void update1(int l, int r, int ind=1, int lc=1, int rc=(1<<lg)+1) {
	pushdown(ind);
	if(l>=rc || lc>=r) return;
	if(lc>=l && rc<=r) {
		seg[ind].lazy ++;
		pushdown(ind);
		return;
	}
	int mid = (lc+rc)/2;
	update1(l, r, 2*ind, lc, mid);
	update1(l, r, 2*ind+1, mid, rc);
	pushup(ind);
}

void update2(ll pos, int ind=1, int lc=1, int rc=(1<<lg)+1) {
	pushdown(ind);
	if(ind >= (1<<lg)) {
		seg[ind].mnl = seg[ind].mxr = seg[ind].num*d - comp[pos-1].F;
		return;
	}
	int mid=(lc+rc)/2;
	if(pos<mid) {update2(pos, 2*ind, lc, mid); pushdown(2*ind+1);}
	else {update2(pos, 2*ind+1, mid, rc); pushdown(2*ind);}
	pushup(ind);
}

int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>n>>m>>d;
	for(int i=1; i<=n+m; i++) cin>>a[i], comp.pb({a[i], i});
	sort(all(comp));

	for(int i=1; i<=n+m; i++) {
		int ptr = get(a[i], i);
		update1(ptr, n+m+1);
		update2(ptr);
		ll ans = max(seg[1].res, 0ll);
		if(i>n) {
			cout<<ans/2;
			if(ans%2==1) cout<<".5 ";
			else cout<<" ";
		}
	}


	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 14 / 14
• Subtask 3: 35 / 35
• Subtask 4: 41 / 41