题目大意
给你一系列灯泡,每个灯泡有自己亮和灭的时间,问你[1,m]中每个时间点最亮的灯泡的亮度。
思路
对于每一个t相同的灯泡,因为只考虑最大亮度的灯泡,那么只需要保留最大亮度的那个灯泡就可以了(用来优化的一个点)。然后对于每一个不同时间的灯泡(t=a1,a2,a3,a4,…an),如果进行暴力更新区间的话,时间复杂度是够的(大概算了下也不会超过1e7?),那么可以对于每一个灯泡亮的区间进行区间修改,这里我用到了线段树,然后就是区间查询输出每一个的结果即可。
代码
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <string>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#define sc_int(x) scanf("%d", &x)
#define sc_ll(x) scanf("%lld", &x)
#define pr_ll(x) printf("%lld", x)
#define pr_ll_n(x) printf("%lld\n", x)
#define pr_int_n(x) printf("%d\n", x)
#define ll long long
using namespace std;
const int N = 300000 + 100;
int n, m, h;
bool st = 0;
ll res = 0;
struct lk
{
int l, r;
int ma;
int lazy;
} tr[4 * N];
void pushup(lk &u, lk &l, lk &r) { u.ma = max(l.ma, r.ma); }
void pushup(int u) { pushup(tr[u], tr[u << 1], tr[u << 1 | 1]); }
void build(int u, int l, int r)
{
if (l == r)
{
tr[u].ma = 0;
return;
}
tr[u].l = l, tr[u].r = r, tr[u].lazy = 0;
int mid = l + r >> 1;
build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
pushup(u);
}
void pushdown(lk &u, lk &l, lk &r)
{
if (u.lazy)
{
l.lazy = max(l.lazy, u.lazy), l.ma = max(l.ma, u.lazy);
r.lazy = max(r.lazy, u.lazy), r.ma = max(r.ma, u.lazy);
u.lazy = 0;
}
}
void pushdown(int u) { pushdown(tr[u], tr[u << 1], tr[u << 1 | 1]); }
void modify(int u, int l, int r, int L, int R, int val)
{
// cout<<"?\n";
pushdown(u);
if (l >= L && r <= R)
{
tr[u].lazy = max(tr[u].lazy, val);
tr[u].ma = max(tr[u].ma, val);
}
else
{
int mid = l + r >> 1;
if (L <= mid)
modify(u << 1, l, mid, L, R, val);
if (R > mid)
modify(u << 1 | 1, mid + 1, r, L, R, val);
//cout << "?\n";
}
}
int query(int u, int l, int r, int x)
{
pushdown(u);
if (l == r)
return tr[u].ma;
int mid = l + r >> 1;
if (x <= mid)
return query(u << 1, l, mid, x);
else
return query(u << 1 | 1, mid + 1, r, x);
}
void slove(int op)
{
sc_int(n), sc_int(m);
map<int, int> q;
for (int i = 1; i <= n; i++)
{
int x, t;
cin >> t >> x;
if (!q[t])
q[t] = x;
else
q[t] = max(q[t], x);
}
build(1, 1, m);
// cout<<"?";
for (auto i : q)
{
int t = i.first, x = i.second;
int k = 0;
while (1)
{
int l = 2 * k * t+1, r = 2 * k * t + t;
r = min(m, r);
if(l>m)break;
modify(1, 1, m, l, r, x);
// cout<<l<<" "<<r<<endl;
if (r == m)
break;
k++;
}
}
printf("Case #%d: ",op);
for (int i = 1; i <= m; i++)
cout << query(1, 1, m, i) << " \n"[i == m];
}
int main()
{
int t;
sc_int(t);
for(int i =1;i<=t;i++)
slove(i);
return 0;
}
ps:前段时间看课然后打比赛然后摆烂摆烂摆烂去了(qwq),没来得及打卡,这几天多写几个把前面的卡补上