题意:给定n个灯泡,那个灯泡排列在电路板上,然后每个灯泡给定你一个t和x,这个灯泡会在[2kt + 1,2kt + t],k=(0,1,2…)的时间区间内发出亮度为x的光,其他时间内不发光,然后给定你一个m问你:从第一秒到第m秒每一秒时亮度最大的灯的亮度为多少
思路:按亮度对时间排序,枚举发光区间,线段树修改,枚举完所有区间后单点查询
#include<iostream>
#include<algorithm>
#include<cstring>
#define TL f << 1
#define TR f << 1 | 1
using namespace std;
typedef pair<int, int> PII;
const int N = 1e5 + 7;
int tr[4 * N], tag[4 * N];
bool vis[N];
int t, n, m;
PII a[N];
bool cmp(PII a, PII b)
{
return a.second == b.second ? a.first > b.first : a.second > b.second;
}
void init()
{
memset(tr, 0, sizeof tr);
memset(tag, 0, sizeof tag);
memset(vis, 0, sizeof vis);
}
void pushdown(int f)
{
if (!tag[f]) return;
if (!tr[TL])
tag[TL] = tr[TL] = max(tag[f], tr[TL]);
if (!tr[TR])
tag[TR] = tr[TR] = max(tag[f], tr[TR]);
tag[f] = 0;
}
void modify(int f, int tl, int tR, int l, int r, int k)
{
if (l <= tl && r >= tR)
{
if (!tr[f])
{
tr[f] = tag[f] = k;
}
}
else
{
pushdown(f);
int mid = tl + tR >> 1;
if (l <= mid) modify(TL, tl, mid, l, r, k);
if (r > mid) modify(TR, mid + 1, tR, l, r, k);
}
}
int query(int f, int l, int r, int k)
{
int ans;
if (l == r)
{
return tr[f];
}
else
{
pushdown(f);
int mid = l + r >> 1;
if (k <= mid) ans = query(TL, l, mid, k);
else ans = query(TR, mid + 1, r, k);
}
return ans;
}
int main()
{
cin >> t;
for (int cas = 1; cas <= t; cas++)
{
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
{
scanf("%d%d", &a[i].first, &a[i].second);
}
sort(a, a + n, cmp);
init();
for (int i = 0; i < n; i++)
{
if (vis[a[i].first])continue;
vis[a[i].first] = true;
for (int j = 0; j * a[i].first + 1 <= m; j += 2)
{
int l = j * a[i].first + 1, r = (j + 1) * a[i].first;
modify(1, 1, m, l, min(r, m), a[i].second);
}
}
printf("Case #%d:", cas);
for (int i = 1; i <= m; i++)
{
int ans = query(1, 1, m, i);
printf(" %d", ans);
}
printf("\n");
}
return 0;
}