【bzoj2054】 疯狂的馒头 并查集

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#define maxn 1000100

using namespace std;

int f[maxn],a[maxn];
int n,m,p,q;

int find(int x)
{
	if (f[x]==x) return x;
	else return f[x]=find(f[x]);
}

int main()
{
	scanf("%d%d%d%d",&n,&m,&p,&q);
	for (int i=1;i<=n+1;i++) f[i]=i;
	for (int i=m;i>=1;i--)
	{
		int x=((long long)i*p+q)%n+1,y=((long long)i*q+p)%n+1;
		if (x>y) swap(x,y);
		for (int j=find(x);j<=y;j=find(j)) a[j]=i,f[j]=j+1;
	}
	for (int i=1;i<=n;i++) printf("%d\n",a[i]);
	return 0;
}