题意:
在一段线段上涂色,新涂的颜色会覆盖旧的,问最后每种颜色各有多少段。
思路:
线段树区间覆盖,最后dfs查询一遍把每个位置的颜色查询出来,再扫一遍统计有多少段。
代码:
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <cctype>
#include <cstdio>
#include <string>
#include <bitset>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#define X first
#define Y second
#define lch (o<<1)
#define rch (o<<1|1)
#define pb push_back
#define lowbit(x) (x&-x)
#define pii pair<int,int>
#define sd(n) scanf("%d",&n)
#define sf(n) scanf("%lf",&n)
#define cout1(x) cout<<x<<endl
#define pdd pair<double,double>
#define ALL(x) x.begin(),x.end()
#define sdd(n,m) scanf("%d%d",&n,&m)
#define INS(x) inserter(x,x.begin())
#define mst(a,b) memset(a,b,sizeof(a))
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define cout2(x,y) cout<<x<<" "<<y<<endl
#define qclear(a) while(!a.empty())a.pop()
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define IOS std::ios::sync_with_stdio(false)
#define SRAND srand((unsigned int)(time(0)))
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define cout3(x,y,z) cout<<x<<" "<<y<<" "<<z<<endl
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
using namespace std;
const double PI=acos(-1.0);
const int INF=0x3f3f3f3f;
const double eps=1e-3;
const ll mod=1e8+7;
const int maxn=8005;
const int maxm=100005;
int n;
int setv[maxn<<2];
void pushdown(int o){
if(setv[o]!=-1){
setv[lch]=setv[rch]=setv[o];
setv[o]=-1;
}
return ;
}
void update(int o,int l,int r,int ql,int qr,int val){
if(ql<=l&&r<=qr){
setv[o]=val;
}else{
pushdown(o);
int mid=(l+r)>>1;
if(ql<=mid)update(lch,l,mid,ql,qr,val);
if(mid<qr)update(rch,mid+1,r,ql,qr,val);
}
return ;
}
int a[maxn];
int cnt[maxn];
void query(int o,int l,int r){
if(l==r){
a[l]=setv[o];
}else{
pushdown(o);
int mid=(l+r)>>1;
query(lch,l,mid);
query(rch,mid+1,r);
}
return ;
}
void solve() {
while(~sd(n)){
mst(setv,-1);
int lim=8003;
for(int i=0;i<n;i++){
int l,r,c;
sddd(l,r,c);
l+=2,r++;
update(1,1,lim,l,r,c);
}
query(1,1,lim);
mst(cnt,0);
for(int i=1;i<lim;i++){
if(a[i]!=-1&&a[i]!=a[i+1]){
cnt[a[i]]++;
}
}
for(int i=0;i<lim;i++){
if(cnt[i]){
printf("%d %d\n",i,cnt[i]);
}
}
printf("\n");
}
return ;
}
int main() {
#ifdef LOCAL
freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
#else
// freopen("","r",stdin);
// freopen("","w",stdout);
#endif
solve();
return 0;
}