結果
問題 | No.1349 Subset Product Queries |
ユーザー | heno239 |
提出日時 | 2021-01-16 14:33:43 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 5,141 bytes |
コンパイル時間 | 2,528 ms |
コンパイル使用メモリ | 157,172 KB |
実行使用メモリ | 441,920 KB |
最終ジャッジ日時 | 2024-11-27 16:21:50 |
合計ジャッジ時間 | 57,433 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 21 ms
31,396 KB |
testcase_01 | AC | 19 ms
439,820 KB |
testcase_02 | AC | 21 ms
30,784 KB |
testcase_03 | AC | 21 ms
441,216 KB |
testcase_04 | AC | 22 ms
33,804 KB |
testcase_05 | AC | 22 ms
441,920 KB |
testcase_06 | AC | 21 ms
33,276 KB |
testcase_07 | AC | 22 ms
362,128 KB |
testcase_08 | AC | 19 ms
32,916 KB |
testcase_09 | AC | 21 ms
439,276 KB |
testcase_10 | AC | 19 ms
31,200 KB |
testcase_11 | TLE | - |
testcase_12 | TLE | - |
testcase_13 | TLE | - |
testcase_14 | TLE | - |
testcase_15 | TLE | - |
testcase_16 | TLE | - |
testcase_17 | TLE | - |
testcase_18 | AC | 137 ms
66,164 KB |
testcase_19 | AC | 121 ms
234,980 KB |
testcase_20 | TLE | - |
testcase_21 | TLE | - |
testcase_22 | TLE | - |
testcase_23 | TLE | - |
testcase_24 | AC | 1,945 ms
164,224 KB |
testcase_25 | TLE | - |
testcase_26 | TLE | - |
testcase_27 | TLE | - |
testcase_28 | TLE | - |
testcase_29 | TLE | - |
testcase_30 | TLE | - |
ソースコード
#pragma GCC optimize("Ofast") //#pragma GCC target ("sse4") #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> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 998244353; const ll INF = mod * mod; typedef pair<int, int>P; #define stop char nyaa;cin>>nyaa; #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; typedef double ld; typedef pair<ld, ld> LDP; const ld eps = 1e-12; const ld pi = acosl(-1.0); 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; ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return 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 -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += 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]; } int calc[5000][5000]; bool ldp[5001][5000]; bool rdp[5001][5000]; void solve() { int n, q, p; cin >> n >> q >> p; vector<int> a(n); rep(i, n)cin >> a[i]; vector<vector<P>> qs(n); vector<int> l(q), r(q), k(q); rep(i, q) { cin >> l[i] >> r[i] >> k[i]; l[i]--; r[i]--; qs[l[i]].push_back({ r[i],i }); } rep(i, n)sort(all(qs[i])); vector<bool> ans(q); vector<vector<P>> ch(p); rep(i, p)rep(j, p) { calc[i][j] = i * j % p; ch[(i * j) % p].push_back({ i,j }); } //[le,ri) function<void(int, int)> yaru = [&](int le, int ri) { vector<int> ids; if (le + 1 == ri) { int lid = lower_bound(all(qs[le]), P{ le,-1 }) - qs[le].begin(); while (lid < qs[le].size() && qs[le][lid].first < ri) { ids.push_back(qs[le][lid].second); lid++; } for (int id : ids) { if (a[le] == k[id])ans[id] = true; } return; } int m = (le + ri) / 2; yaru(le, m); yaru(m, ri); for (int j = m; j < ri; j++) { rep(k, p) { rdp[j - m + 1][k] = false; } } for (int j = m - 1; j >= le; j--) { rep(k, p) { ldp[m - j][k] = false; } } for (int j = m; j < ri; j++) { rep(k, p) { if (rdp[j - m][k]) { rdp[j - m + 1][k] = true; rdp[j - m + 1][calc[k][a[j]]] = true; } } rdp[j - m + 1][a[j]] = true; } for (int j = m - 1; j >= le; j--) { rep(k, p) { if (ldp[m - 1 - j][k]) { ldp[m - j][k] = true; ldp[m - j][calc[k][a[j]]] = true; } } ldp[m - j][a[j]] = true; } for (int j = le; j < m; j++) { int id = lower_bound(all(qs[j]), P{ m,-1 }) - qs[j].begin(); while (id < qs[j].size() && qs[j][id].first < ri) { ids.push_back(qs[j][id].second); id++; } } for (int id : ids) { int lid = m - l[id]; int rid = r[id] - m + 1; for (P p : ch[k[id]]) { if (ldp[lid][p.first] && rdp[rid][p.second]) { ans[id] = true; break; } } if (ldp[lid][k[id]])ans[id] = true; if (rdp[rid][k[id]])ans[id] = true; } }; yaru(0, n); rep(i, q) { if (ans[i])cout << "Yes\n"; else cout << "No\n"; } } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(15); init_f(); //init(); //expr(); //int t; cin >> t; rep(i,t) solve(); return 0; }