Maximum Element In A Stack Gym - 102222A

 https://cn.vjudge.net/problem/Gym-102222A

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------

const int maxn=1e5+9;
const int mod=1e9+7;

int n, p, q, m;
unsigned int SA, SB, SC;

unsigned int rng61()
{
    SA ^= SA << 16;
    SA ^= SA >> 5;
    SA ^= SA << 1;
    unsigned int t = SA;
    SA = SB;
    SB = SC;
    SC ^= t ^ SA;
    return SC;
}



stack<unsigned int>s,ss;
ll ans=0;
void gen()
{
    scanf("%d%d%d%d%u%u%u", &n, &p, &q, &m, &SA, &SB, &SC);
    for(int i = 1; i <= n; i++)
    {
        if(rng61() % (p + q) < p)
        {
            uint k=rng61() % m + 1;
            s.push(k);

            if(ss.empty()) ss.push(k);
            else if(ss.top()<k) ss.push(k);
            else ss.push(ss.top());

            if(!ss.empty()) ans^=(ll)i*ss.top();
            else ans^=i*0;

        }
        else
        {
            if(!s.empty())
            {
                s.pop();
                ss.pop();
            }
            if(!ss.empty()) ans^=(ll)i*ss.top();
            else
            {
                ans^=i*0;
            }
        }


    }
}

int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int cas=0;
    int T;
    scanf("%d",&T);
    while(T--)
    {
        ans=0;
        while(!s.empty())s.pop();
        while(!ss.empty())ss.pop();
        gen();

        printf("Case #%d: ",++cas);
        printf("%lld\n",ans);
    }



    return 0;
}