Submission #1116316

#	Time	Username	Problem	Language	Result	Execution time	Memory
1116316		thelegendary08	Measures (CEOI22_measures)	C++17	100 / 100	517 ms	36936 KiB

Main

#include<bits/stdc++.h>
#define pb push_back
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) cout<<#v<<' '; for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
const int mxn = 2e5 + 5;

vi tree(mxn * 4, -4e18);
vi lazy(mxn * 4, 0);
void push(int x){
	lazy[x*2] += lazy[x];
	tree[x*2] += lazy[x];
	lazy[x*2+1] += lazy[x];
	tree[x*2+1] += lazy[x];
	lazy[x] = 0;
}

void update(int node, int tl, int tr, int l, int r, int x){
	if(l > r)return;
	if(l == tl && r == tr){
		tree[node] += x;
		lazy[node] += x;
	}
	else{
		push(node);
		int mid = (tl + tr)/2;
		update(node * 2, tl, mid, l, min(mid,r), x);
		update(node * 2 + 1, mid+1, tr, max(mid+1, l), r, x);
		tree[node] = max(tree[node*2], tree[node*2+1]);
	}
}

int query(int node, int tl, int tr, int l, int r){
	if(l > r)return -4e18;
	if(l == tl && r == tr){
		return tree[node];
	}
	push(node);
	int mid = (tl + tr)/2;
	return max(query(node*2, tl, mid, l, min(r, mid)), query(node*2+1, mid+1, tr, max(l, mid+1), r));
}

vi tree2(mxn * 4, 4e18);
vi lazy2(mxn * 4, 0);

void push2(int x){
	lazy2[x*2] += lazy2[x];
	tree2[x*2] += lazy2[x];
	lazy2[x*2+1] += lazy2[x];
	tree2[x*2+1] += lazy2[x];
	lazy2[x] = 0;
}

void update2(int node, int tl, int tr, int l, int r, int x){
	if(l > r)return;
	if(l == tl && r == tr){
		tree2[node] += x;
		lazy2[node] += x;
	}
	else{
		push2(node);
		int mid = (tl + tr)/2;
		update2(node * 2, tl, mid, l, min(mid,r), x);
		update2(node * 2 + 1, mid+1, tr, max(mid+1, l), r, x);
		tree2[node] = min(tree2[node*2], tree2[node*2+1]);
	}
}

int query2(int node, int tl, int tr, int l, int r){
	if(l > r)return 4e18;
	if(l == tl && r == tr){
		return tree2[node];
	}
	push2(node);
	int mid = (tl + tr)/2;
	return min(query2(node*2, tl, mid, l, min(r, mid)), query2(node*2+1, mid+1, tr, max(l, mid+1), r));
}

//1 is max, 2 is min
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in3(n,m,d);
	if(n > 0){
		vin(v,n);
		f0r(i,n)v[i] *= 2;
		d *= 2;
		while(m--){
			in(x);
			v.pb(x*2);
			sort(all(v));
			int lo = 0;
			int hi = 3e14;
			while(lo < hi){
				int m = lo + (hi - lo)/2;
				//double m = mid/2.0;
				int cur = v[0] - m;
				
				bool ok = 1;
				FOR(i, 1, v.size()){
					if(v[i] - m > d + cur){
						cur = v[i] - m;
						//w.pb(v[i] - m);
					}
					else if(v[i] + m < d + cur){
						ok = 0;
						break;
					}
					else{
						cur = d + cur;
					}
				}
				//dout(mid);
				if(ok){
					hi = m;
				}
				else{
					lo = m + 1;
				}
				//if(mid == 6)vout(w);
			}
			if(lo%2==0)cout<<lo/2<<' ';
			else cout<<lo/2<<".5 ";
		}
	}
	else{
		//int ans = 0;
		int mx = 0;
		//int mn = 4e18;
		int ans = 0;
		vi v(m);
		f0r(i,m)cin>>v[i];
		vpii w(m);
		f0r(i,m)w[i] = {v[i], i};
		sort(all(w));
		vi dex(m);
		f0r(i,m)dex[w[i].second] = i+1;
		//vout(dex);
		FOR(i, 1, m+1){
			//cout<<query(1, 1, m, i, i)<<' ';
		}
		//cout<<'\n';
		f0r(i,m){
			int cur = dex[i];
			update(1, 1, m, cur+1, m, -d);
			update2(1, 1, m, cur+1, m, -d);
			update(1, 1, m, cur, cur, 4e18);
			update(1, 1, m, cur, cur, v[i]);
			update2(1, 1, m, cur, cur, -4e18);
			update2(1, 1, m, cur, cur, v[i]);
			FOR(i, 1, m+1){
				//cout<<query(1, 1, m, i, i)<<' ';
			}
			//cout<<'\n';
			
			ans = max(ans, query(1, 1, m, 1, cur) - query2(1, 1, m, cur, m));
			
			if(ans % 2 == 0)cout<<ans/2<<' ';
			else cout<<ans/2<<".5 ";
			
		}
		
	}
	
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:12:33: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 | #define FOR(i,k,n) for(int i=k;i<n;i++)
......
  127 |     FOR(i, 1, v.size()){
      |         ~~~~~~~~~~~~~~           
Main.cpp:127:5: note: in expansion of macro 'FOR'
  127 |     FOR(i, 1, v.size()){
      |     ^~~
Main.cpp:155:7: warning: unused variable 'mx' [-Wunused-variable]
  155 |   int mx = 0;
      |       ^~

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