​​http://www.elijahqi.win/archives/889​​

其实就是很单纯的模拟

#include<cstdio>
#include<queue>
#define N 110000
std::queue<int> q;
std::priority_queue<int> q1;
int n,m,a,b,tmp1,tmp2;
bool flag[N];
int main(){
    //freopen("lunch.in","r",stdin);
    //freopen("lunch.out","w",stdout);
    scanf("%d%d",&n,&m);
    scanf("%d%d",&a,&b);
    scanf("%d%d",&tmp2,&tmp1);int size=n>>1;q.push(tmp2);
    q.push(tmp1);flag[tmp1]=true;flag[tmp2]=true;
    for (int i=3;i<=m;++i){
        int tmp=((long long)a*tmp1+(long long)b*tmp2)%n;
        if (!flag[tmp]) {
            q.push(tmp),flag[tmp]=true;printf("%d ",tmp);
            if (q.size()>size) flag[q.front()]=false,q.pop(); tmp2=tmp1;tmp1=tmp;
            continue;
        }
        int l=tmp+1,r=n-1;
        while (l<=r){
            int mid=l+r>>1;
            if (flag[mid]) r=mid-1;else l=mid+1;    
        }
        while (flag[tmp]){(tmp+=1)%=n;}
        q.push(tmp),flag[tmp]=true;printf("%d ",tmp);tmp2=tmp1;tmp1=tmp;
        if (q.size()>size) flag[q.front()]=false,q.pop(); 
    }

    return 0;
}