L i n k Link Link
S S L O J SSLOJ SSLOJ 2646 2646 2646
D e s c r i p t i o n Description Description
给定一条长度为m的线段,有n个操作,每个操作有3个数字x,y,z表示把区间[x,y]染成颜色z,询问染完色之后,这条长度为m的线段一共有几种颜色。规定:线段的颜色可以相同。连续的相同颜色被视作一段。问x轴被分成多少段。
I n p u t Input Input
4 20
10 19 1
2 9 2
5 13 3
15 17 4
O u t p u t Output Output
7
H i n t Hint Hint
数据规模
N <= 10000
M <= 1000000
T r a i n Train Train o f of of T h o u g h t Thought Thought
用线段树做啦
定义一个参数Colorx,其实和线段树二一样的。。(除了统计部分),统计部分就两个子节点合并起来看是否同色,就好了
C o d e Code Code
#include<iostream>
#include<cstdio>
using namespace std;
int n, m, sum;
struct Tree
{
int l, r, colorx;
}tree[4500125];
void Build(int x, int L, int R)
{
tree[x].l = L; tree[x].r = R;
int mid = (L + R) >> 1;
if (L + 1 >= R) return;
Build(x * 2, L, mid);
Build(x * 2 + 1, mid, R);
}//建树
void Ins(int x, int L, int R, int color)
{
if (tree[x].l == tree[x].r || L > R) return;//加退出条件,要不然会x刷到很大很大很大很大很大很大很大很大很大很大很大
if (L == tree[x].l && R == tree[x].r)
{tree[x].colorx = color; return;}
else {
if (tree[x].colorx >= 0)
{
tree[x * 2].colorx = tree[x * 2 + 1].colorx = tree[x].colorx;
tree[x].colorx = -1;
}
int mid = (tree[x].l + tree[x].r) >> 1;
if (R <= mid) Ins(x * 2, L, R, color);
else if (L >= mid) Ins(x * 2 + 1, L, R, color);
else {
Ins(x * 2, L, mid, color);
Ins(x * 2 + 1, mid, R, color);
}
}
}//插入基本不变
void Count(int x, int &L, int &R)
{
int ll = 0,rr = 0;
if (tree[x].colorx >= 0)
{
sum++;
L = R = tree[x].colorx;//记录当前区间的左右端点的颜色
return;
}
if (tree[x].r == tree[x].l + 1) return;
Count(x * 2, L, ll);
Count(x * 2 + 1, rr, R);
if (ll == rr && ll) sum--;
return ;
}
int main()
{
scanf("%d", &m);
scanf("%d", &n);//很奇妙的换位。。。不换就WA
Build(1, 1, n);
for (int i = 1; i <= m; ++i)
{
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
Ins(1, x, y, z);
}
int c, d;
Count(1, c, d);
printf("%d", sum);
return 0;
}