結果
問題 | No.2592 おでぶなおばけさん 2 |
ユーザー | karinohito |
提出日時 | 2023-12-25 03:06:44 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 256 ms / 2,500 ms |
コード長 | 3,749 bytes |
コンパイル時間 | 3,547 ms |
コンパイル使用メモリ | 209,728 KB |
実行使用メモリ | 10,240 KB |
最終ジャッジ日時 | 2023-12-25 03:07:14 |
合計ジャッジ時間 | 29,940 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,676 KB |
testcase_01 | AC | 27 ms
6,676 KB |
testcase_02 | AC | 81 ms
6,676 KB |
testcase_03 | AC | 34 ms
6,676 KB |
testcase_04 | AC | 46 ms
6,676 KB |
testcase_05 | AC | 83 ms
10,112 KB |
testcase_06 | AC | 78 ms
6,676 KB |
testcase_07 | AC | 113 ms
6,676 KB |
testcase_08 | AC | 77 ms
6,912 KB |
testcase_09 | AC | 29 ms
6,676 KB |
testcase_10 | AC | 70 ms
6,676 KB |
testcase_11 | AC | 75 ms
7,040 KB |
testcase_12 | AC | 20 ms
6,676 KB |
testcase_13 | AC | 192 ms
7,552 KB |
testcase_14 | AC | 195 ms
7,680 KB |
testcase_15 | AC | 182 ms
6,676 KB |
testcase_16 | AC | 193 ms
7,680 KB |
testcase_17 | AC | 201 ms
8,448 KB |
testcase_18 | AC | 177 ms
6,676 KB |
testcase_19 | AC | 168 ms
6,676 KB |
testcase_20 | AC | 189 ms
6,676 KB |
testcase_21 | AC | 161 ms
6,676 KB |
testcase_22 | AC | 189 ms
7,936 KB |
testcase_23 | AC | 202 ms
8,576 KB |
testcase_24 | AC | 187 ms
6,784 KB |
testcase_25 | AC | 159 ms
6,676 KB |
testcase_26 | AC | 165 ms
6,676 KB |
testcase_27 | AC | 214 ms
10,240 KB |
testcase_28 | AC | 214 ms
10,240 KB |
testcase_29 | AC | 219 ms
10,240 KB |
testcase_30 | AC | 219 ms
10,240 KB |
testcase_31 | AC | 256 ms
10,240 KB |
testcase_32 | AC | 219 ms
10,240 KB |
testcase_33 | AC | 218 ms
10,240 KB |
testcase_34 | AC | 216 ms
10,240 KB |
testcase_35 | AC | 219 ms
10,240 KB |
testcase_36 | AC | 225 ms
10,240 KB |
testcase_37 | AC | 217 ms
10,240 KB |
testcase_38 | AC | 216 ms
10,240 KB |
testcase_39 | AC | 216 ms
10,240 KB |
testcase_40 | AC | 218 ms
10,240 KB |
testcase_41 | AC | 226 ms
10,240 KB |
testcase_42 | AC | 217 ms
10,240 KB |
testcase_43 | AC | 215 ms
10,240 KB |
testcase_44 | AC | 215 ms
10,240 KB |
testcase_45 | AC | 213 ms
10,240 KB |
testcase_46 | AC | 243 ms
10,240 KB |
testcase_47 | AC | 204 ms
10,240 KB |
testcase_48 | AC | 208 ms
10,240 KB |
testcase_49 | AC | 208 ms
10,240 KB |
testcase_50 | AC | 208 ms
10,240 KB |
testcase_51 | AC | 234 ms
10,240 KB |
testcase_52 | AC | 215 ms
10,240 KB |
testcase_53 | AC | 216 ms
10,240 KB |
testcase_54 | AC | 214 ms
10,240 KB |
testcase_55 | AC | 214 ms
10,240 KB |
testcase_56 | AC | 244 ms
10,240 KB |
testcase_57 | AC | 44 ms
10,240 KB |
testcase_58 | AC | 216 ms
10,240 KB |
testcase_59 | AC | 216 ms
10,240 KB |
testcase_60 | AC | 216 ms
10,240 KB |
testcase_61 | AC | 217 ms
10,240 KB |
testcase_62 | AC | 242 ms
10,240 KB |
testcase_63 | AC | 214 ms
10,240 KB |
testcase_64 | AC | 214 ms
10,240 KB |
testcase_65 | AC | 210 ms
10,240 KB |
testcase_66 | AC | 212 ms
10,240 KB |
testcase_67 | AC | 235 ms
10,240 KB |
testcase_68 | AC | 211 ms
10,240 KB |
testcase_69 | AC | 211 ms
10,240 KB |
testcase_70 | AC | 207 ms
10,240 KB |
testcase_71 | AC | 209 ms
10,240 KB |
testcase_72 | AC | 239 ms
10,240 KB |
testcase_73 | AC | 210 ms
10,240 KB |
testcase_74 | AC | 2 ms
6,676 KB |
testcase_75 | AC | 219 ms
10,240 KB |
testcase_76 | AC | 217 ms
10,240 KB |
testcase_77 | AC | 215 ms
10,240 KB |
testcase_78 | AC | 241 ms
10,240 KB |
testcase_79 | AC | 218 ms
10,240 KB |
testcase_80 | AC | 215 ms
10,240 KB |
testcase_81 | AC | 216 ms
10,240 KB |
testcase_82 | AC | 214 ms
10,240 KB |
testcase_83 | AC | 244 ms
10,240 KB |
ソースコード
#include <bits/stdc++.h> //#include<atcoder/fenwicktree> //using namespace atcoder; using namespace std; using ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using vvvll = vector<vvll>; using vd = vector<double>; using vvd = vector<vd>; using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>; #define all(A) A.begin(),A.end() #define rep(i, n) for (ll i = 0; i < (ll) (n); i++) template<class T> bool chmax(T& p, T q, bool C = 1) { if (C == 0 && p == q) { return 1; } if (p < q) { p = q; return 1; } else { return 0; } } template<class T> bool chmin(T& p, T q, bool C = 1) { if (C == 0 && p == q) { return 1; } if (p > q) { p = q; return 1; } else { return 0; } } ll modPow(long long a, long long n, long long p) { if (n == 0) return 1; // 0乗にも対応する場合 if (n == 1) return a % p; if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p; long long t = modPow(a, n / 2, p); return (t * t) % p; } ll gcd(ll(a), ll(b)) { if (a == 0)return b; if (b == 0)return a; ll c = a; while (a % b != 0) { c = a % b; a = b; b = c; } return b; } ll sqrtz(ll N) { ll L = 0; ll R = sqrt(N) + 10000; while (abs(R - L) > 1) { ll mid = (R + L) / 2; if (mid * mid <= N)L = mid; else R = mid; } return L; } /* using mint = modint998244353; using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; vector<mint> fact, factinv, inv; const ll mod = 998244353; void prenCkModp(ll n) { fact.resize(n + 5); factinv.resize(n + 5); inv.resize(n + 5); fact[0] = fact[1] = 1; factinv[0] = factinv[1] = 1; inv[1] = 1; for (ll i = 2; i < n + 5; i++) { fact[i] = (fact[i - 1] * i); inv[i] = (mod - ((inv[mod % i] * (mod / i)))); factinv[i] = (factinv[i - 1] * inv[i]); } } mint nCk(ll n, ll k) { if (n < k || k < 0) return 0; return (fact[n] * ((factinv[k] * factinv[n - k]))); } vvm mul(vvm A, vvm B) { ll n = A.size(); vvm res(n, vm(n, 0)); rep(i, n)rep(j, n)rep(k, n)res[i][j] += A[i][k] * B[k][j]; return res; } */ bool DEB = 0; using i128=__int128_t; i128 pow_mod_128(i128 A, i128 N, i128 M) { i128 res = 1 % M; A %= M; while (N>0) { if (N%2==1) res = (res * A) % M; A = (A * A) % M; N/=2; } return res; } bool is_prime(ll N) { if (N <= 1) return 0; if (N == 2) return 1; if (N % 2 == 0) return 0; vll A = {2,325,9375,28178,450775,9780504,1795265022}; ll s = 0, d = N - 1; while (d % 2 == 0) { s++; d/=2; } for (auto a : A) { if (a % N == 0) return 1; ll t, x = pow_mod_128(a, d, N); if (x != 1) { for (t = 0; t < s; ++t) { if (x == N - 1) break; x = (i128(x) * x) % N; } if (t == s) return 0; } } return 1; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll N,Q,K; cin>>N>>Q>>K; ll PN=5; vll P; rep(i,PN){ ll p=1; while(p<1e8||!is_prime(p))p=rand()%ll(1e9); P.push_back(p); } vvll D(N+1,vll(5,0)); vll KP(PN,1); rep(i,N){ ll A; cin>>A; rep(j,PN){ D[i+1][j]=(D[i][j]+(A%P[j])*KP[j])%P[j]; if(D[i+1][j]<0)D[i+1][j]+=P[j]; KP[j]*=(K%P[j]); KP[j]%=P[j]; } } rep(q,Q){ ll L,R; cin>>L>>R; L--; bool OK=1; rep(j,PN)if(D[R][j]!=D[L][j])OK=0; cout<<(OK?"No":"Yes")<<endl; } }