2019牛客暑期多校训练营（第五场）----C- generator 2

首先发出题目链接：
链接：https://ac.nowcoder.com/acm/contest/885/C
来源：牛客网
涉及：BSGS

点击这里回到2019牛客暑期多校训练营解题—目录贴

---

题目如下：





代码如下：

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
namespace Hash{
	struct Line{int u, v, next;}e[1000010];
	const int HashMod=100007;
	int h[HashMod], cnt;
	inline int Add(int u, int v, int w){e[++cnt] = (Line){w, v, h[u]}; h[u] = cnt;return v;}
	inline void clear(){memset(h, 0, sizeof(h)); cnt = 0;}
	inline void insert(int x, int k = 0){
		int s = x % HashMod;
		Add(s, k, x);
	}
	void updata(int x, int k = 0){
		int s = x % HashMod;
		for(int i = h[s]; i; i = e[i].next)
			if(e[i].u == x){
				e[i].v = k;
				return;
			} 
		Add(s, k, x);
	}
	inline int query(int x){
		int s = x % HashMod;
		for(int i = h[s]; i; i = e[i].next)
			if(e[i].u == x)	return e[i].v;
		return 0;
	}
	inline int count(int x){
		int s = x % HashMod;
		for(int i = h[s]; i; i = e[i].next)
			if(e[i].u == x)	return 1;
		return 0;
	}
	inline int add(int x)
	{
		int s = x % HashMod;
		for(int i = h[s]; i; i = e[i].next)
			if(e[i].u == x)	return e[i].v = e[i].v + 1;
		return Add(s, 1, x);
	}
	inline int sub(int x)
	{
		int s = x % HashMod;
		for(int i = h[s]; i; i = e[i].next)
			if(e[i].u == x)	return e[i].v = e[i].v - 1;
		return Add(s, -1, x);
	}
}

namespace BSGS{
	const int m = 1000;
	int ff, yy;
	inline ll qpow(ll a, ll b, ll p){
		int sum = 1;
		while(b){
			if(b & 1)	sum = sum * a % p;
			a = a * a % p;
			b >>= 1;
		}
		return sum;
	}
	inline void pre_bsgs(int a, int p) {
		Hash::clear();
	    int f = 1, y = ceil(1.0 * p / m);
	    ff = qpow(a, y, p); yy = y;
	    for(int i = 0; i < y; i++) {
	        Hash::insert(f, i);
	        f = 1LL * f * a % p;
	    }
	}
	inline int bsgs(int a, int b, int p) {
	    if(b == 1) return 0;
	    int f = ff, y = yy, tmp = f;
	    f = 1LL * f * qpow(b, p-2, p) % p;
	    for(int i = 1; i <= m; i++) {
	        if(Hash::count(f)) return i * y - Hash::query(f);
	        f = 1LL * f * tmp % p;
	    }
	    return -1;
	}
	inline int ex_BSGS(int y, int z, int p){
		if(z == 1)	return 0;
		int k = 0, a = 1;
		while(233){
			int d = __gcd(y,p);
			if(d == 1)	break;
			if(z % d)	return -1;
			z /= d; p /= d; ++k; a = 1ll*a*y/d % p;
			if(z == a)	return k;
		}
		Hash::clear();
		int m = sqrt(p) + 1;
		for(int i = 0, t = z; i < m; ++i, t = 1ll*t*y%p)	Hash::updata(t, i);
		for(int i = 1, tt = qpow(y, m, p), t = 1ll*a*tt % p; i <= m; ++i, t = 1ll*t*tt%p){
			int B = Hash::count(t);
			if(B == 0)	continue;
			B = Hash::query(t);
			return i * m - B + k;
		}
		return -1;
	}
}
int t;
ll n, x0, a, b, p;
ll qpow(ll a, ll b){
	ll sum = 1;
	while(b){
		if(b & 1)	sum = sum * a % p;
		a = a * a % p;
		b >>= 1;
	}
	return sum;
}
int main(){
	scanf("%d", &t);
	while(t--){
		int q;
		scanf("%lld%lld%lld%lld%lld", &n, &x0, &a, &b, &p);
		scanf("%d", &q);
		if(a == 1){
			while(q--){
				ll v;
				scanf("%lld", &v);
				v = ((v - x0) % p + p) % p;
				v = v * qpow(b, p-2) % p;
				if(v > n - 1)	printf("-1\n");
				else	printf("%lld\n", v);
			} 
		}else if(a == 0){
			while(q--){
				ll v;
				scanf("%lld", &v);
				if(x0 % p == v)	printf("0\n");
				else if(b % p == v && n >= 2)	printf("1\n");
				else	printf("-1\n");
			}
		}else{
			ll inva = qpow(a-1, p-2);
			ll cnt = (b * inva % p + x0 % p) % p;
			BSGS::pre_bsgs(a, p);
			while(q--){
				ll v;
				scanf("%lld", &v);
				v = (v + b * inva % p) % p;
				v = v * qpow(cnt, p-2) % p;
				int ans = BSGS::bsgs(a, v, p);
				if(ans == -1 || ans > n-1)	printf("-1\n");
				else	printf("%d\n", ans);
			}	
		}	
	}
}