当前位置:网站首页>Codeforces round 684 (Div. 2) e - green shopping (line segment tree)
Codeforces round 684 (Div. 2) e - green shopping (line segment tree)
2022-07-05 08:52:00 【Qizi K】
I have time to fill in my thoughts or something qwq
#include <bits/stdc++.h>
#define rep(n) for(int i = 1; i <= (n); ++i)
#define ll long long
using namespace std;
const int N = 400010;
int n,m;
ll w[N];
struct node{
int l, r;
ll maxx, minn, sum, lazy;
}tr[4 * N];
void pushup(int u){
tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
tr[u].maxx = max(tr[u << 1].maxx, tr[u << 1 | 1].maxx);
tr[u].minn = min(tr[u << 1].minn, tr[u << 1 | 1].minn);
}
void pushdown(int u){
if(tr[u].lazy){
tr[u << 1].sum = tr[u].lazy * (tr[u << 1].r - tr[u << 1].l + 1);
tr[u << 1 | 1].sum = tr[u].lazy * (tr[u << 1 | 1].r - tr[u << 1 | 1].l + 1);
tr[u << 1].lazy = tr[u << 1].minn = tr[u << 1].maxx = tr[u].lazy;
tr[u << 1 | 1].lazy = tr[u << 1 | 1].minn = tr[u << 1 | 1].maxx = tr[u].lazy;
tr[u].lazy = 0;
}
}
void build(int u, int l, int r){
if(l == r) tr[u] = {
l,r,w[l],w[l],w[l],0};
else{
tr[u].l = l, tr[u].r = r;
int mid = l + r >> 1;
build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
pushup(u);
}
}
void modify(int u, int l, int r, ll val){
if(tr[u].minn >= val) return ;
if(tr[u].l >= l && tr[u].r <= r && tr[u].maxx <= val){
tr[u].sum = val * (tr[u].r - tr[u].l + 1);
tr[u].maxx = tr[u].minn = tr[u].lazy = val;
}else{
pushdown(u);
int mid = tr[u].l + tr[u].r >> 1;
if(l <= mid) modify(u << 1, l, r, val);
if(r > mid) modify(u << 1 | 1, l, r, val);
pushup(u);
}
}
ll query(int u, int l, int r, ll& val){
if(tr[u].minn > val) return 0;
if(tr[u].l >= l && tr[u].r <= r && tr[u].sum <= val){
val -= tr[u].sum;
return tr[u].r - tr[u].l + 1;
}else{
pushdown(u);
ll res = 0;
int mid = tr[u].l + tr[u].r >> 1;
if(l <= mid) res += query(u << 1, l, r, val);
if(r > mid) res += query(u << 1 | 1, l, r, val);
return res;
}
}
int main(){
cin >> n >> m;
rep(n) scanf("%lld", &w[i]);
build(1,1,n);
rep(m){
int op, x;
ll y;
scanf("%d%d%lld",&op,&x,&y);
if(op == 1) modify(1,1,x,y);
else printf("%lld\n", query(1,x,n,y));
}
return 0;
}
边栏推荐
- Guess riddles (2)
- C# LINQ源码分析之Count
- Redis implements a high-performance full-text search engine -- redisearch
- Adaboost使用
- File server migration scheme of a company
- 我从技术到产品经理的几点体会
- Halcon snap, get the area and position of coins
- Solution to the problems of the 17th Zhejiang University City College Program Design Competition (synchronized competition)
- 图解八道经典指针笔试题
- 猜谜语啦(6)
猜你喜欢
C [essential skills] use of configurationmanager class (use of file app.config)
It cold knowledge (updating ing~)
Yolov4 target detection backbone
Business modeling of software model | object modeling
Programming implementation of ROS learning 6 -service node
Business modeling of software model | vision
Ros-11 common visualization tools
Solutions of ordinary differential equations (2) examples
Halcon color recognition_ fuses. hdev:classify fuses by color
C# LINQ源码分析之Count
随机推荐
Guess riddles (11)
猜谜语啦(6)
轮子1:QCustomPlot初始化模板
Halcon shape_ trans
ABC#237 C
Bit operation related operations
TypeScript手把手教程,简单易懂
Use arm neon operation to improve memory copy speed
Halcon blob analysis (ball.hdev)
Search data in geo database
Tips 1: Web video playback code
Programming implementation of ROS learning 2 publisher node
Reasons for the insecurity of C language standard function scanf
Halcon wood texture recognition
Mengxin summary of LCs (longest identical subsequence) topics
Basic number theory - fast power
Codeworks round 639 (Div. 2) cute new problem solution
Meta tag details
皮尔森相关系数
Ecmascript6 introduction and environment construction