結果

問題 No.2592 おでぶなおばけさん 2
ユーザー heno239heno239
提出日時 2023-12-20 03:21:03
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 87 ms / 2,500 ms
コード長 7,316 bytes
コンパイル時間 2,491 ms
コンパイル使用メモリ 154,664 KB
実行使用メモリ 31,088 KB
最終ジャッジ日時 2024-09-27 09:41:50
合計ジャッジ時間 13,718 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
27,500 KB
testcase_01 AC 42 ms
28,784 KB
testcase_02 AC 47 ms
28,524 KB
testcase_03 AC 38 ms
27,752 KB
testcase_04 AC 39 ms
27,632 KB
testcase_05 AC 58 ms
30,956 KB
testcase_06 AC 49 ms
28,524 KB
testcase_07 AC 54 ms
28,396 KB
testcase_08 AC 53 ms
29,296 KB
testcase_09 AC 39 ms
27,884 KB
testcase_10 AC 43 ms
27,504 KB
testcase_11 AC 53 ms
29,296 KB
testcase_12 AC 35 ms
27,628 KB
testcase_13 AC 73 ms
29,548 KB
testcase_14 AC 74 ms
29,676 KB
testcase_15 AC 67 ms
28,776 KB
testcase_16 AC 74 ms
29,676 KB
testcase_17 AC 76 ms
29,932 KB
testcase_18 AC 65 ms
28,656 KB
testcase_19 AC 61 ms
28,268 KB
testcase_20 AC 61 ms
28,780 KB
testcase_21 AC 58 ms
28,264 KB
testcase_22 AC 66 ms
29,804 KB
testcase_23 AC 78 ms
30,064 KB
testcase_24 AC 70 ms
29,036 KB
testcase_25 AC 58 ms
27,884 KB
testcase_26 AC 58 ms
27,888 KB
testcase_27 AC 87 ms
31,084 KB
testcase_28 AC 85 ms
30,956 KB
testcase_29 AC 87 ms
31,088 KB
testcase_30 AC 87 ms
31,084 KB
testcase_31 AC 86 ms
30,960 KB
testcase_32 AC 86 ms
31,080 KB
testcase_33 AC 87 ms
31,084 KB
testcase_34 AC 86 ms
30,956 KB
testcase_35 AC 86 ms
31,084 KB
testcase_36 AC 85 ms
31,080 KB
testcase_37 AC 85 ms
31,084 KB
testcase_38 AC 87 ms
31,084 KB
testcase_39 AC 87 ms
31,080 KB
testcase_40 AC 87 ms
30,956 KB
testcase_41 AC 85 ms
31,084 KB
testcase_42 AC 84 ms
30,956 KB
testcase_43 AC 83 ms
31,080 KB
testcase_44 AC 86 ms
31,084 KB
testcase_45 AC 86 ms
31,080 KB
testcase_46 AC 85 ms
31,080 KB
testcase_47 AC 81 ms
31,080 KB
testcase_48 AC 80 ms
31,084 KB
testcase_49 AC 82 ms
31,084 KB
testcase_50 AC 78 ms
31,084 KB
testcase_51 AC 77 ms
31,084 KB
testcase_52 AC 86 ms
31,084 KB
testcase_53 AC 85 ms
30,960 KB
testcase_54 AC 83 ms
31,084 KB
testcase_55 AC 86 ms
31,080 KB
testcase_56 AC 84 ms
31,084 KB
testcase_57 AC 49 ms
30,956 KB
testcase_58 AC 86 ms
30,956 KB
testcase_59 AC 86 ms
31,080 KB
testcase_60 AC 85 ms
31,080 KB
testcase_61 AC 85 ms
31,084 KB
testcase_62 AC 86 ms
30,952 KB
testcase_63 AC 86 ms
31,080 KB
testcase_64 AC 85 ms
31,084 KB
testcase_65 AC 84 ms
31,088 KB
testcase_66 AC 82 ms
31,084 KB
testcase_67 AC 82 ms
31,080 KB
testcase_68 AC 82 ms
31,084 KB
testcase_69 AC 82 ms
31,080 KB
testcase_70 AC 82 ms
31,084 KB
testcase_71 AC 83 ms
31,088 KB
testcase_72 AC 83 ms
30,956 KB
testcase_73 AC 82 ms
31,084 KB
testcase_74 AC 32 ms
27,376 KB
testcase_75 AC 86 ms
30,956 KB
testcase_76 AC 85 ms
31,084 KB
testcase_77 AC 84 ms
31,088 KB
testcase_78 AC 86 ms
31,080 KB
testcase_79 AC 86 ms
31,084 KB
testcase_80 AC 85 ms
31,088 KB
testcase_81 AC 87 ms
30,956 KB
testcase_82 AC 86 ms
31,088 KB
testcase_83 AC 86 ms
31,080 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000009;
const int mod17 = 1000000007;
const ll INF = (ll)mod17 * mod17;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
	vector<T> res;
	int ida = 0, idb = 0;
	while (ida < a.size() || idb < b.size()) {
		if (idb == b.size()) {
			res.push_back(a[ida]); ida++;
		}
		else if (ida == a.size()) {
			res.push_back(b[idb]); idb++;
		}
		else {
			if (a[ida] < b[idb]) {
				res.push_back(a[ida]); ida++;
			}
			else {
				res.push_back(b[idb]); idb++;
			}
		}
	}
	return res;
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//------------------------------------
bool isp(int x) {
	if (x == 1)return false;
	for (int i = 2; i * i <= x; i++) {
		if (x % i == 0)return false;
	}
	return true;
}
//1.1*10^9だと2.2*10^9がintでoverflowする
mt19937 mtle(time(0));
uniform_int_distribution<> udle(900000000, 1000000000);
int findmodp() {
	int le = udle(mtle);
	while (!isp(le))le++;
	return le;
}
using ar = array<ll, 2>;

ar ms;
ar ts;

ar rhs[1000005];
void init() {
	rep(i, 2) {
		ms[i] = findmodp();
		ts[i] = findmodp();
		while (ts[i] % ms[i] == 0) {
			ts[i] = findmodp();
		}
		ts[i] %= ms[i];
	}
	rhs[0] = { 1,1 };
	rep(i, 1000004) {
		rep(j, 2) {
			rhs[i + 1][j] = rhs[i][j] * ts[j] % ms[j];
		}
	}
}

ar operator*(ar a, ll v) {
	rep(j, 2) {
		ll adv = v % ms[j];
		if (adv < 0)adv += ms[j];
		a[j] *= adv; a[j] %= ms[j];
	}
	return a;
}
ar operator*(ar a, ar b) {
	rep(j, 2) {
		(a[j] *= b[j]) %= ms[j];
	}
	return a;
}
ar operator+(ar a, ar b) {
	rep(j, 2) {
		a[j] += b[j]; if (a[j] >= ms[j])a[j] -= ms[j];
	}
	return a;
}
ar operator-(ar a, ar b) {
	rep(j, 2) {
		a[j] -= b[j]; if (a[j] < 0)a[j] += ms[j];
	}
	return a;
}
void solve() {
	int n, q; ll k; cin >> n >> q >> k;
	vector<ll> a(n);
	rep(i, n) {
		cin >> a[i];
	}
	vector<ar> rk(n + 1);
	rk[0] = { 1,1 };
	rep(i, n) {
		rep(j, 2) {
			rk[i + 1][j] = rk[i][j] * (k % ms[j]) % ms[j];
		}
	}
	vector<ar> rval(n + 1);
	rval[n] = { 0,0 };
	per(i, n) {
		rep(j, 2) {
			rval[i][j] = (rval[i + 1][j] * (k % ms[j]) + a[i]) % ms[j];
			if (rval[i][j] < 0)rval[i][j] += ms[j];
		}
	}
	auto query = [&](int l, int r) {
		ar res = rval[l] - rval[r] * rk[r - l];
		return res != ar{0, 0};
	};
	rep(i, q) {
		int l, r; cin >> l >> r; l--;
		if (query(l, r)) {
			cout << "Yes\n";
		}
		else {
			cout << "No\n";
		}
	}
}



signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed<<setprecision(10);
	//init_f();
	init();
	//while(true)
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0