从后往前维护最大值的单调队列,所以单调队列中的元素从走到右递增,且左边没比他大的元素在队列中,所以队列中元素个数就是count的个数。
注意q*i爆int,wa了我好久。
//#include <bits/stdc++.h>
#pragma GCC optimize(2)
#include<stdio.h>
#include<string.h>
#include<string>
#include<math.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<stdlib.h>
#include<time.h>
#include <iomanip>
#define lowbit(x) (x&(-x))
#define inf 0x7fffffff
#define linf 0x7fffffffffffffff
#define mem(x,y) memset(x,y,sizeof(x))
#define fup(i,x,y) for(int i=(x);i<=(y);i++)
#define fdn(i,x,y) for(int i=(x);i>=(y);i--)
#define sp(x) setprecision(x)
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define sc(n) scanf("%s",n)
#define pf(x) printf("%d\n",x)
#define pfl(x) printf("%lld\n",x)
#define pff(x) printf("%lf\n",x)
#define debug printf("!!\n");
#define N 10000005
#define M 4000009
#define pi acos(-1)
#define eps 1e-2
//cout.setf(ios::fixed);
//freopen("out.txt","w",stdout);// freopen("in.txt","r",stdin);
using namespace std;
typedef long long ll;
typedef double db;
ll a[N],que[N];
int main()
{
int n,m,k,p,q,r,mod;
int t;
sd(t);
while(t--)
{
sddd(n,m,k);
sddd(p,q,r);
sd(mod);
fup(i,1,k)
sld(a[i]);
fup(i,k+1,n)
a[i]=(p*a[i-1]+1ll*q*i+r)%mod;
int head=1,tail=0;
ll a1=0,b1=0;
// que[0]=0;
fdn(i,n,1)
{
if(head<=tail&&que[head]>=i+m) head++;
while(head<=tail&&a[que[tail]]<=a[i]) tail--;
que[++tail]=i;
if(i<=n-m+1)
{
a1+=(a[que[head]]^i);
b1+=(tail-head+1)^i;
}
}
printf("%lld %lld\n",a1,b1);
}
}