[BZOJ]2054: 疯狂的馒头

数据太大，我们考虑对于一个馒头，最后一次染的色就是最后的颜色，然后就倒着来搞，加上并查集优化就好了

#include <cstdio>#include <algorithm>using namespace std;inline char tc(void){    static char fl[1000000],*A=fl,*B=fl;    return A==B&&(B=(A=fl)+fread(fl,1,1000000,stdin),A==B)?EOF:*A++;}inline int read(void){    int a=0;static char c;    while((c=tc())<'0'||c>'9');    while(c>='0'&&c<='9')        a=a*10+c-'0',c=tc();    return a;}int n,m,p,q,f[1001002],c[1001002];int Find(int x)  {      if(!f[x]||f[x]==x)          return f[x]=x;      return f[x]=Find(f[x]);  }  int main(void){    register int i,x,y;    n=read(),m=read(),p=read(),q=read();    for (i=m;i;--i)    {        x=((long long)i*p+q)%n+1,y=((long long)i*q+p)%n+1;        if(x>y) swap(x,y);        for (x=Find(x);x<=y;x=Find(x))            c[x]=i,f[x]=x+1;    }    for (i=1;i<=n;++i)        printf("%d\n",c[i]);    return 0;}