Submission #816779

#	Time	Username	Problem	Language	Result	Execution time	Memory
816779		ono_de206	Measures (CEOI22_measures)	C++14	0 / 100	1572 ms	1044 KiB

Main

#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

#define int long long
 
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
    return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
    return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
    return in;
}


template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 4e5 + 10, inf = 1e18 + 10;
int a[mxn], pre[mxn], suf[mxn];

void go() {
	int n, m, d;
	cin >> n >> m >> d;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for(int t = 1; t <= m; t++) {
		cin >> a[n + t];
		sort(a + 1, a + n + t + 1);
		int ans = inf;
		pre[0] = suf[n + t + 1] = 0;
		for(int i = 1; i <= n + t; i++) {
			pre[i] = pre[i - 1];
			if(i > 1) pre[i] += max(0ll, d - a[i] + a[i - 1]);
		}
		for(int i = n + t; i >= 1; i--) {
			suf[i] = suf[i + 1];
			if(i + 1 <= n + t) suf[i] += max(0ll, d - a[i + 1] + a[i]);
		}
		for(int i = 1; i <= n + t; i++) {
			mnn(ans, max(pre[i], suf[i]) * 2);
			if(i - 1 >= 1) mnn(ans, max(pre[i - 1], suf[i]) * 2 + max(0ll, d - a[i] + a[i - 1]));
		}
		cout << ans / 2;
		if(ans & 1) cout << ".5";
		cout << ' ';
	}
}
 
signed main() {
	// #ifndef ONO
	// freopen("file.in", "r", stdin);
	// freopen("file.out", "w", stdout);
	// #endif
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

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