Submission #654319

#	Time	Username	Problem	Language	Result	Execution time	Memory
654319		sunwukong123	Measures (CEOI22_measures)	C++14	0 / 100	1 ms	468 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int ll 
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#else
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first 	
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
#define reach cerr << "LINE: " << __LINE__ << "\n";
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
typedef tuple<ll,ll,ll,ll> ti4;
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> bool chmax(T& a, const T b) { return a<b ? a = b, 1 : 0; }
template <typename T> bool chmin(T& a, const T b) { return a>b ? a = b, 1 : 0; }
const int MAXN = 200005;
int n,m,d;
int A[MAXN];
int B[MAXN];

double solve() {
	int mx=0;
	int ans=0;
	int D[n+2];
	dba(A,1,n);
	FOR(i,1,n-1) {
		D[i]=A[i+1]-A[i];
		D[i] = d-D[i];
	}
	dba(D,1,n-1);
	FOR(i,1,n-1) {
		mx=max(mx+D[i],D[i]);
		chmax(ans,mx);
	}
	return ans/2.0;
}

int32_t main() 
{
	IAMSPEED
	cin >> n >> m >> d;
	assert(n!=0);
	FOR(i,1,n) {
		cin >> A[i];
	}
	sort(A+1,A+n+1);
	FOR(i,1,m){
		int x; cin >> x;
		int idx=lower_bound(A+1,A+n+1,x)-A;
		DEC(i,n,idx)A[i+1]=A[i];
		A[idx]=x;
		++n;
		cout << solve() << ' ';
	}
}

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