CodeForces 431E :Chemistry Experiment 线段树 + 离散化

传送门

题意

分析

二分比较好判断，所以我们需要做的就是往所有小于等于$mid$的水管里面注水就行了
所以需要快速处理出所有小于$mid$的个数和总和
用权值线段树就可以快速处理出来
但是因为这道题范围太大了，但是有用点最多只有$200000$个，所以我们可以选择动态开点或者离散化去处理
我这里用的是离散化，动态开点的写法有时间补上(刚下火车，在KFC敲完这道题)

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-5;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
ll a[N];
PII q[N];
int n,m;
vector<double> nums;

struct Node{
	int l,r;
	int cnt;
	ll sum;
}tr[N << 2];

struct Q{
	int op,x;
	ll val;
}ques[N];

int find(int x){
    return lower_bound(nums.begin(),nums.end(),x) - nums.begin() + 1;
}

void push(int u){
	tr[u].cnt = tr[u << 1].cnt + tr[u << 1 | 1].cnt;
	tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
}

void build(int u,int l,int r){
	tr[u] = {l,r,0,0};
	if(l == r) return;
	int mid = (l + r) >> 1;
	build(u << 1,l,mid),build(u << 1 | 1,mid + 1,r);
}

void modify(int u,int x,int k){
	if(tr[u].l == tr[u].r){
		if(k == 1) tr[u].cnt++,tr[u].sum += nums[x - 1];
		else tr[u].cnt--,tr[u].sum -= nums[x - 1];
		return;
	}
	int mid = (tr[u].l + tr[u].r) >> 1;
	if(x <= mid) modify(u << 1,x,k);
	else modify(u << 1 | 1,x,k);
	push(u);
}

int query_cnt(int u,int l,int r){
	if(tr[u].l >= l && tr[u].r <= r) return tr[u].cnt;
	int res = 0,mid = (tr[u].l + tr[u].r) >> 1;
	if(l <= mid) res = query_cnt(u << 1,l,r);
	if(r > mid) res += query_cnt(u << 1 | 1,l,r);
	return res;
}

ll query_sum(int u,int l,int r){
	if(tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
	ll res = 0;
	int mid = (tr[u].l + tr[u].r) >> 1;
	if(l <= mid) res = query_sum(u << 1,l,r);
	if(r > mid) res += query_sum(u << 1 | 1,l,r);
	return res;
}

void solve(ll x){	
	double l = 0,r = 1e15;
	double ans = 0;
	while(r - l >= eps){
		double mid = (l + r) / 2;
		int p = upper_bound(all(nums),mid) - nums.begin();
		if(query_cnt(1,1,p) * mid >= query_sum(1,1,p) * 1.0 + x) r = ans = mid;
		else l = mid;
	}
	printf("%lf\n",ans);
}	


int main() {
	read(n),read(m);
	for(int i = 1;i <= n;i++) read(a[i]),nums.pb(a[i]);
	for(int i = 1;i <= m;i++) {
		int op,x;
		ll val;
		read(op);
		if(op == 1) {
			read(x),read(val);
			ques[i] = {op,x,val};
			nums.pb(val);
		}	
		else{
			read(val);
			ques[i] = {0,0,val};
		}
	}
	sort(nums.begin(),nums.end());
    nums.erase(unique(nums.begin(),nums.end()),nums.end());
    nums.pb(1e15);
    int mx = nums.size();
    build(1,1,mx);
    for(int i = 1;i <= n;i++){
    	modify(1,find(a[i]),1);
    } 
    for(int i = 1;i <= m;i++){
    	int op = ques[i].op;
    	if(op == 1){
    		modify(1,find(a[ques[i].x]),-1);
    		a[ques[i].x] = ques[i].val;
    		modify(1,find(a[ques[i].x]),1);
    	}
    	else{
    		solve(ques[i].val);
    	}
    }
    return 0;
}

补上动态开点的代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-5;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
struct Node{
	int l,r;
	int cnt;
	ll sum;
}tr[N * 50];
int idx;
int a[N];
int mx = 1e9 + 10;
int n,m;

void push(int u){
    tr[u].cnt = tr[tr[u].l].cnt +  tr[tr[u].r].cnt;
    tr[u].sum = tr[tr[u].l].sum + tr[tr[u].r].sum;
}

void modify(int u,int l,int r,int x,int k){
	if(l == r){
		if(k == 1) tr[u].cnt++,tr[u].sum += x;
		else tr[u].cnt--,tr[u].sum -= x;
		return;
	}
	int mid = (l + r) >> 1;
	if(x <= mid){
		if(!tr[u].l) tr[u].l = ++idx;
		modify(tr[u].l,l,mid,x,k);
	}	
	else{
		if(!tr[u].r) tr[u].r = ++idx;
		modify(tr[u].r,mid + 1,r,x,k);
	}
	push(u);
}

int query_cnt(int u,int l,int r,double L,double R){
	if(l >= L && r <= R) return tr[u].cnt;
	int mid = (l + r) >> 1;
	int ans = 0;
	if(L <= mid) {
		if(!tr[u].l) ans = 0;
		else ans = query_cnt(tr[u].l,l,mid,L,R);
	}
	if(R > mid){
		if(!tr[u].r) ans += 0;
		else ans += query_cnt(tr[u].r,mid + 1,r,L,R);
	}
	return ans;
}

ll query_sum(int u,int l,int r,double L,double R){
	if(l >= L && r <= R) return tr[u].sum;
	int mid = (l + r) >> 1;
	ll ans = 0;
	if(L <= mid) {
		if(!tr[u].l) ans = 0;
		else ans = query_sum(tr[u].l,l,mid,L,R);
	}
	if(R > mid){
		if(!tr[u].r) ans += 0;
		else ans += query_sum(tr[u].r,mid + 1,r,L,R);
	}
	return ans;
}

void solve(ll x){
	double l = 0,r = 1e15;
	while(r - l >= eps){
        double mid = (l + r) / 2;
        if(mid >= mx) {
        	if(tr[1].cnt * mid >= tr[1].sum * 1.0 + x) r = mid;
        	else l = mid;
        }
        else{
        	// cout << l << ' ' << r << ' ' << mid << endl;
        	if(query_cnt(1,0,mx,0,mid) * mid >= query_sum(1,0,mx,0,mid) * 1.0 + x) r = mid;
        	else l = mid;
        	// cout << query_cnt(1,0,mx,0,mid) << ' ' <<  query_sum(1,0,mx,0,mid) * 1.0 << endl;
        }
    }
    printf("%lf\n",l);
}

int main() {
	read(n),read(m);
	idx = 1;;
	for(int i = 1;i <= n;i++) read(a[i]),modify(1,0,mx,a[i],1);
	while(m--){
		int op,x;
		ll val;
		read(op);
		if(op == 1){
			read(x),read(val);
			modify(1,0,mx,a[x],0);
			a[x] = val;
			modify(1,0,mx,a[x],1);
		}
		else{	
			read(val);
			solve(val);
		}	
	}
}