HDU 1698 Just a Hook
题意:给你T组数据,N个数(初始时每个数的值为1),M个操作,每个操作把区间[a,b]里的数更新为c,问最后这N个数的和是多少
题解:懒标记维护下即可
#include<bits/stdc++.h>
#include <unordered_map>
using namespace std;
template<class...Args>
void debug(Args... args) {//Parameter pack
auto tmp = { (cout << args << ' ', 0)... };
cout << "\n";
}
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll>pll;
typedef pair<int, int>pii;
const ll N = 5e5 + 5;
const ll INF = 0x7fffffff;
const ll MOD = 998244353;
struct node {
int l, r;
int sum;
int lazy_tag;
}tree[N<<2];
void push_up(int root) {
tree[root].sum = tree[root << 1].sum + tree[root << 1 | 1].sum;
}
void build(int root, int l, int r) {
if (l == r)tree[root] = { l,r,1,0 };
else {
tree[root] = { l,r};
int mid = l + r >> 1;
build(root << 1, l, mid);
build(root << 1 | 1, mid + 1, r);
push_up(root);
}
}
void push_down(int root) {
auto& Root = tree[root], & left = tree[root << 1], & right = tree[root << 1 | 1];
if (Root.lazy_tag) {
left.lazy_tag = Root.lazy_tag;
right.lazy_tag = Root.lazy_tag;
left.sum = (left.r - left.l + 1) * Root.lazy_tag;
right.sum = (right.r - right.l + 1) * Root.lazy_tag;
Root.lazy_tag = 0;
}
}
void modify(int root,int l,int r,int k){//自顶向下
if (l <= tree[root].l && tree[root].r <= r) {
tree[root].lazy_tag = k;
tree[root].sum = (tree[root].r - tree[root].l + 1) * k;
}
else {
push_down(root);
int mid = tree[root].l + tree[root].r >> 1;
if (l <= mid)modify(root << 1, l, r, k);
if (r > mid)modify(root << 1 | 1, l, r, k);
push_up(root);
}
}
int query(int root, int l, int r) {
if (l <= tree[root].l && tree[root].r <= r)return tree[root].sum;
push_down(root);
int mid = tree[root].l + tree[root].r >> 1;
if (r <= mid)return query(root << 1, l, r);
else if (r > mid)return query(root << 1 | 1, l, r);
else {
int ans = query(root << 1, l, r) + query(root << 1 | 1, l, r);
return ans;
}
}
int Case;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int t;
cin >> t;
while(t--){
int n;
cin >> n;
build(1, 1, n);
int q;
cin >> q;
while (q--) {
int tt;
int l, r, k;
cin >> l >> r >> k;
modify(1, l, r, k);
}
cout <<"Case "<<++Case<<": The total value of the hook is "<< query(1, 1, n) << ".\n";
}
return 0;
}