loj541

七曜圣贤

sol：我标算还没写过，似乎分块就可以过（因为数据是随机的），我写个set可以有70~80分

//C++
#include<bits/stdc++.h>

using namespace std;

namespace IO
{
    int c;
    unsigned int seed;
    unsigned int randnum()
    {
        seed^=seed<<;
        seed^=seed>>;
        seed^=seed<<;
        return seed;
    }

    inline int read(int &x)
    {
        scanf("%d",&x);
        return x;
    }
    inline void init_case(int &m,int &a,int &b,int &d,int p[])
    {
        scanf("%d%u%d%d%d%d",&m,&seed,&a,&b,&c,&d);
        for(int i=; i<=m; i++)
        {
            if(randnum()%c==)p[i]=-;
            else p[i]=randnum()%b;
        }
    }

    inline void update_ans(unsigned int &ans_sum,unsigned int cur_ans,int no)
    {
//        cout << no << ' ' << cur_ans << endl;
        const static unsigned int mod=;
        ans_sum^=(long long)no*(no+)%mod*cur_ans%mod;
    }
}
using IO::read;
using IO::init_case;
using IO::update_ans;
/*
Ò»¿ªÊ¼Çëµ÷ÓÃread(T)¶ÁÈëÊý¾Ý×éÊýT
½ÓÏÂÀ´Ã¿×éÊý¾Ý¿ªÊ¼Ê±Çëµ÷ÓÃinit_case(m,a,b,d,p)¶ÁÈëm,a,b,d,p[]
ÿ×éÊý¾Ý¿ªÊ¼Ê±ÇëÓÃÒ»¸ö³õʼ»¯Îª0µÄ32λÎÞ·ûºÅÕûÐαäÁ¿ans_sum´æ´¢´ð°¸£¬È»ºó¶ÔÓÚÿ¸öi£¬
ÓÃ32λÎÞ·ûºÅÕûÐαäÁ¿cur_ans´æ´¢µÚi´Î´ð°¸£¬²¢µ÷ÓÃupdate_ans(ans_sum,cur_ans,i)¸üС£×îºóÊä³öans_sum¼´¿É¡£
*/

//ʾÀý´úÂ룺
const int N=;
int m,a,b,d;
int p[N];
bool Bo[N];
bool Used[N];
deque<int>dq;
set<int>mex;
set<int>::iterator it;
unsigned int ans_sum=,cur_ans=;

inline void setSolve(int i)
{
    if((p[i]==-)&&d)
    {
        if(dq.empty()) return;
        int tmp=dq.front(); dq.pop_front(); Bo[tmp]=;
        mex.erase(tmp);
//        it=mex.lower_bound(tmp); mex.erase(it);
    }
    else if((Bo[p[i]])&&d)
    {
        dq.push_back(p[i]); Bo[p[i]]=;
        mex.insert(p[i]);
    }
    else if((!Bo[p[i]])&&(!Used[p[i]]))
    {
        Used[p[i]]=; Bo[p[i]]=;
        mex.erase(p[i]);
//        it=mex.lower_bound(p[i]); mex.erase(it);
    }
    else if(d)
    {
        if(dq.empty()) return;
        int tmp=dq.front(); dq.pop_front(); Bo[tmp]=;
        mex.erase(tmp);
//        it=mex.lower_bound(tmp); mex.erase(it);
    }
    cur_ans=*mex.begin();
    update_ans(ans_sum,cur_ans,i);
}
inline void playset()
{
    int i;
    for(i=;i<=a;i++) Bo[i]=Used[i]=;
    mex.clear(); for(i=a+;i<=max(b,a+);i++) Bo[i]=Used[i]=,mex.insert(i);
    dq.clear();
    for(i=;i+<=m;i+=)
    {
        setSolve(i); setSolve(i+); setSolve(i+); setSolve(i+); setSolve(i+);
        setSolve(i+); setSolve(i+); setSolve(i+); setSolve(i+); setSolve(i+);
    }
    for(;i<=m;i++) setSolve(i);
    printf("%u\n",ans_sum);
}
int main()
{
    freopen("mex.in","r",stdin);
    freopen("mex.out","w",stdout);
    int T,i;
    read(T);
    while(T--)
    {
        ans_sum=cur_ans=;
        init_case(m,a,b,d,p); d^=;
        playset();
    }
    return ;
}
/*
input
1
100000 866153523 100000 10 2 0
output
892635735
*/

set