[字符串Hash 线段树] AOJ 2734 Donut Decoration

考虑把每个点看成一个可以在后面加字符的字符串
每次区间加一个字符串 相当于对区间的hash值做一次运算
这个直接线段树就行了

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef unsigned int uint;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=200005;
const uint seed=233333;
struct abcd{
  uint a,b;
  abcd(uint a=1,uint b=0):a(a),b(b) { }
  bool one() { return a==1 && b==0; }
  void add(abcd B){
    uint _a=a,_b=b;
    a=B.a*_a; b=B.a*_b+B.b;
  }
}T[N<<2];

inline void modify(int x,int l,int r,int ql,int qr,abcd t){
  if (ql<=l && r<=qr){
    T[x].add(t);
    return;
  }
  if (!T[x].one())
    T[x<<1].add(T[x]),T[x<<1|1].add(T[x]),T[x]=abcd();
  int mid=(l+r)>>1;
  if (ql<=mid) modify(x<<1,l,mid,ql,qr,t);
  if (qr>mid) modify(x<<1|1,mid+1,r,ql,qr,t);
}
uint Hash[N];
inline void query(int x,int l,int r){
  if (l==r){
    Hash[l]=T[x].b;
    return;
  }
  if (!T[x].one())
    T[x<<1].add(T[x]),T[x<<1|1].add(T[x]),T[x]=abcd();
  int mid=(l+r)>>1;
  query(x<<1,l,mid);
  query(x<<1|1,mid+1,r);
}

int n,K;

int main(){
  int T,l,r,x;
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n); read(K);
  read(T);
  while (T--){
    read(l); read(r); read(x);
    modify(1,1,n,l,r,abcd(seed,x));
  }
  query(1,1,n);
  uint h=0;
  for (int i=1;i<=K;i++) h=h*seed+i;
  int ans=0;
  for (int i=1;i<=n;i++)
    if (Hash[i]==h)
      ans++;
  printf("%d\n",ans);
  return 0;
}

比赛时 狗急跳墙的xjb做法 竟然过了

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <time.h>
#include <stdlib.h>
#include <string>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack>
#include <iomanip>
using namespace std;

inline char nc(){  
  static char buf[100000],*p1=buf,*p2=buf;  
  if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }  
  return *p1++;  
}  

inline void read(int &x){  
  char c=nc(),b=1;  
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;  
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;  
}

const int N=200005;

struct abcd{
  int l,r;
  abcd(int l=-1,int r=-1):l(l),r(r) { }
  bool operator == (const abcd &B) const{
    return l==B.l && r==B.r;
  }
}T[N<<2];

bool Jud(abcd L,abcd R){
  return L.r+1==R.l;
}

inline void Push(int x,abcd u){
  if (T[x]==abcd(-1,-1)) { T[x]=u; return; }
  if (T[x]==abcd(-2,-2)) return;
  if (u==abcd(-2,-2)) { T[x]=u; return; }
  if (Jud(T[x],u) || T[x]==abcd(-1,-1)) T[x].r=u.r;
  else T[x]=abcd(-2,-2);
}

inline void Modify(int x,int l,int r,int ql,int qr,abcd u){
  int mid=(l+r)>>1;
  if (!(T[x]==abcd(-1,-1)) && l!=r) Push(x<<1,T[x]),Push(x<<1|1,T[x]),T[x]=abcd(-1,-1);
  if (ql<=l && r<=qr){
    Push(x,u);
    return;
  }
  if (ql<=mid) Modify(x<<1,l,mid,ql,qr,u);
  if (mid<qr) Modify(x<<1|1,mid+1,r,ql,qr,u);
}

int n,K;
int cnt=0;

inline void Query(int x,int l,int r){
  if (l==r){
    if (T[x]==abcd(0,K))
      cnt++;
    return;
  }
  if (!(T[x]==abcd(-1,-1)) && l!=r) Push(x<<1,T[x]),Push(x<<1|1,T[x]),T[x]=abcd(-1,-1);
  int mid=(l+r)>>1;
  Query(x<<1,l,mid);
  Query(x<<1|1,mid+1,r);
}


int main(){
  int Q; int l,r,c;
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n); read(K);
  T[1]=abcd(0,0);
  read(Q);
  while (Q--){
    read(l); read(r); read(c);
    Modify(1,1,n,l,r,abcd(c,c));
  }
  Query(1,1,n);
  printf("%d\n",cnt);
  return 0;
}