Submission #1303388

#	Time	Username	Problem	Language	Result	Execution time	Memory
1303388		m.zeeshanrashid	Measures (CEOI22_measures)	C++20	0 / 100	1595 ms	576 KiB

Main

// #ifdef __AVX2__
// #pragma GCC target "avx2"
// #endif
// #pragma GCC optimize "O3"
// #pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp> 
// using namespace __gnu_pbds; 
using namespace std;
// #define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
#define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector
#define ins(a,b,c) a.insert(begin(a)+b,c);

// const int mod=998244353;
const int mod1=998244353;
const int mod=1e9+7;
const int N=2e5+5;

double roun(double a,double b){
	int g=a/b;
	double mi=0;
	for(int i=g-2;i<=g+2;i++){
		if(abs(i*b-a)<abs(mi-a)) mi=i*b;
	}
	return mi;
}

int iter=1,itera=1;
void solve(){
	int n,m,d;
	cin>>n>>m>>d;
	vec<int>a(n);
	inp(a);
	sort(all(a));
	for(int i=0;i<m;i++){
		int x;
		cin>>x;
		if(a.size()==0 or a.back()<=x) a.append(x);
		else{
			int l=-1,r=a.size();
			while(l+1<r){
				int m=(l+r)/2;
				if(a[m]<=x) l=m;
				else r=m;
			}
			a.insert(begin(a)+l+1,x);
		}
		double l=0,r=1e15;
		while(l+1e-1<r){
			double m=(l+r)/2;
			vec<double>b;
			for(auto i:a) b.append(i);
			b[0]-=m;
			bool f=1;
			for(int i=1;i<a.size();i++){
				if(b[i]+m-b[i-1]<d) f=0;
				else b[i]=max(b[i-1]+d,b[i]-m);
			}
			if(f) r=m;
			else l=m;
		}
		string s=to_string(roun(r,0.5));
		while(s.back()=='0') s.pop_back();
		if(s.back()=='.') s.pop_back();
		cout<<s<<' ';
	}
}
signed main(){
	// freopen("","r",stdin);
	// freopen("","w",stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); 
	cout.tie(NULL);
	cout<<fixed<<setprecision(20);
	// cin>>itera;
	for(iter=1;iter<=itera;iter++) solve();
}

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