标签:线段树+调和级数(或 并查集思想+暴力)
题意:给你n个灯,每个灯的开关都遵循一个周期:2 * k * ti + 1 —— 2 * k * ti + ti 开灯,2 * k * ti + ti + 1 —— 2 * k * ti + 2 * ti关灯。每个灯都有一个亮度xi,问你在m秒内每秒钟亮度最高的灯的亮度是多少?n,ti,xi,m都由题目给出。按1~m秒顺序输出。
题解:
线段树:直接暴力线段树完事(雾)。因为每个区间的非连续性,导致直接使用线段树一个区间一个区间的去维护的话时间复杂度直接炸天。但是我们通过观察发现,时间变化周期最多只有m种,即:1~1,2,3..m,那么我们可以发现每个变化周期的区间个数只有m/1,m/2,m/3...m/m个。因此我们可以根据调和级数求和可知:区间个数最多只有mlogm个,因此,我们对每个区间只取亮度最高的灯,然后对这些区间直接维护一个线段树即可。复杂度:mlogmlogm
并查集:这种解法思想很简单,我们只需要先把区间去重,然后按亮度从大到小排序,之后按从大到小的顺序给答案数组赋值,同时记录一下,如果下次再访问到已赋值的位置,就可以直接跳到该位置的最右端(这里要使用并查集的思想查找区间的右端点),然后继续赋值,直至结束。最后直接以此输出答案即可。
代码:
//线段树
# include<iostream>
# include<algorithm>
# define endl "\n"
using namespace std;
const int maxn = 1e5 + 5;
struct node{
int value;
int lazy;
}tree[maxn << 2];
struct VAL{
int lig;
int t;
}arr[maxn], temp[maxn];
bool cmp(VAL a, VAL b){
if(a.t == b.t)
return a.lig > b.lig;
return a.t < b.t;
}
void pushup(int rt){
tree[rt << 1].lazy = tree[rt << 1 | 1].lazy = tree[rt].lazy = false;
tree[rt << 1].value = tree[rt << 1 | 1].value = tree[rt].value = 0;
}
void pushdown(int rt){
if(tree[rt].lazy){
tree[rt << 1].lazy = tree[rt << 1 | 1].lazy = true;
tree[rt << 1].value = max(tree[rt << 1].value, tree[rt].value);
tree[rt << 1 | 1].value = max(tree[rt << 1 | 1].value, tree[rt].value);
tree[rt].lazy = false;
}
}
void updata(int rt, int l, int r, int L, int R, int x){
if(L <= l && R >= r){
tree[rt].value = max(tree[rt].value, x);
tree[rt].lazy = true;
return;
}
if(tree[rt].lazy)
pushdown(rt);
int mid = (l + r) >> 1;
if(L <= mid)
updata(rt << 1, l, mid, L, R, x);
if(R > mid)
updata(rt << 1 | 1, mid + 1, r, L, R, x);
return;
}
void build_tree(int rt, int l, int r){
if(l == r){
tree[rt].value = 0;
tree[rt].lazy = false;
return;
}
int mid = (l + r) >> 1;
build_tree(rt << 1, l, mid);
build_tree(rt << 1 | 1, mid + 1, r);
pushup(rt);
}
int query(int rt, int l, int r, int L, int R){
if(L <= l && R >= r)
return tree[rt].value;
if(tree[rt].lazy)
pushdown(rt);
int mid = (l + r) >> 1;
int ans = 0;
if(L <= mid)
ans = max(ans, query(rt << 1, l, mid, L, R));
if(R > mid)
ans = max(ans, query(rt << 1 | 1, mid + 1, r, L ,R));
return ans;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int T;
int c = 0;
cin >> T;
while(T--){
int n, m;
cin >> n >> m;
for(int i = 1; i <= n; i++)
cin >> arr[i].t >> arr[i].lig;
sort(arr + 1, arr + n + 1, cmp);
int cnt = 0;
int tp = -1;
build_tree(1, 1, m);
for(int i = 1; i <= n; i++){
if(tp != arr[i].t){
temp[++cnt] = arr[i];
tp = arr[i].t;
}
}
for(int i = 1; i <= cnt; i++){
for(int k = 0; ; k++){
int l = 2 * k * temp[i].t + 1;
int r = 2 * k * temp[i].t + temp[i].t;
r = min(r, m);
updata(1, 1, m, l, r, temp[i].lig);
if(r >= m)
break;
}
}
cout << "Case #" << ++c << ": ";
for(int i = 1; i <= m; i++){
if(i != 1)
cout << " ";
cout << query(1, 1, m, i, i);
}
cout << endl;
}
return 0;
}
//并查集+暴力
# include<iostream>
# include<cstring>
# include<algorithm>
# define endl "\n"
using namespace std;
const int maxn = 3e5 + 5;
int jump[maxn];
int ans[maxn];
struct node{
int value;
int t;
}arr[maxn], temp[maxn];
bool cmp(node a, node b){
if(a.t == b.t)
return a.value > b.value;
return a.t > b.t;
}
bool cmp1(node a, node b){
return a.value > b.value;
}
int find(int x){
if(jump[x] == x)
return x;
return jump[x] = find(jump[x]);
}
int main(){
int t;
int c = 0;
cin >> t;
while(t--){
int n, m;
cin >> n >> m;
memset(ans, 0, sizeof(ans));
for(int i = 1; i <= m; i++)
jump[i] = i;
for(int i = 1; i <= n; i++)
cin >> arr[i].t >> arr[i].value;
sort(arr + 1, arr + n + 1, cmp);
int tp = -1;
int cnt = 0;
for(int i = 1; i <= n; i++){
if(tp != arr[i].t){
temp[++cnt] = arr[i];
tp = arr[i].t;
}
}
sort(temp + 1, temp + cnt + 1, cmp1);
for(int i = 1; i <= cnt; i++){
for(int k = 0; ; k++){
int l = 2 * k * temp[i].t + 1;
int r = 2 * k * temp[i].t + temp[i].t;
r = min(r, m);
for(int j = l; j <= r; j++){
if(ans[j])
j = find(j);
else{
ans[j] = temp[i].value;
jump[j - 1] = j;
}
}
if(r >= m)
break;
}
}
cout << "Case #" << ++c << ":";
for(int i = 1; i <= m; i++)
cout << " " << ans[i];
cout << endl;
}
return 0;
}