結果
問題 | No.1349 Subset Product Queries |
ユーザー |
![]() |
提出日時 | 2021-01-13 19:34:16 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,932 bytes |
コンパイル時間 | 19,448 ms |
コンパイル使用メモリ | 292,984 KB |
最終ジャッジ日時 | 2025-01-17 17:32:36 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | WA * 1 |
other | AC * 1 WA * 29 |
ソースコード
// TLE code#pragma GCC target("avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(long long i=0;i<(long long)(n);i++)#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)#define all(a) a.begin(),a.end()#define rsort(a) {sort(all(a));reverse(all(a));}#define pb emplace_back#define eb emplace_back#define lb(v,k) (lower_bound(all(v),(k))-v.begin())#define ub(v,k) (upper_bound(all(v),(k))-v.begin())#define fi first#define se second#define pi M_PI#define PQ(T) priority_queue<T>#define SPQ(T) priority_queue<T,vector<T>,greater<T>>#define dame(a) {out(a);return 0;}#define decimal cout<<fixed<<setprecision(15);#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}typedef long long ll;typedef pair<ll,ll> P;typedef tuple<ll,ll,ll> PP;typedef tuple<ll,ll,ll,ll> PPP;typedef multiset<ll> S;using vi=vector<ll>;using vvi=vector<vi>;using vvvi=vector<vvi>;using vvvvi=vector<vvvi>;using vp=vector<P>;using vvp=vector<vp>;using vb=vector<bool>;using vvb=vector<vb>;const ll inf=1001001001001001001;const ll INF=1001001001;const ll mod=1000000007;const double eps=1e-10;template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}template<class T> void out(T a){cout<<a<<'\n';}template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}template<class T> void yesno(T b){if(b)out("yes");else out("no");}template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}template<class T> void noyes(T b){if(b)out("no");else out("yes");}template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}inline ll readll() {ll x = 0;char ch = getchar_unlocked();while (ch < '0' || ch > '9') ch = getchar_unlocked();while (ch >= '0' && ch <= '9'){x = (x << 3) + (x << 1) + ch - '0';ch = getchar_unlocked();}return x;}void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}const ll B=10;int main(){ll n=readll(),q=readll();vvp query(n);vi idx(n);vi v(n);rep(i,n)v[i]=readll();vi K(q);vi ans(q,-1);rep(i,q){ll l=readll(),r=readll();K[i]=readll();l--;r--;if(r-l<=100){bitset<5001> dp;dp.set(0);REP(j,l,r+1){dp|=dp<<v[j];if(dp.test(K[i])){ans[i]=1;break;}}if(ans[i]==-1)ans[i]=0;}// else if(K[i]>=mx)ans[i]=true;else query[r].pb(l,i);}rep(i,n)sort(all(query[i]));for(int i=0;i<n;i+=B){bitset<5001> dp;dp.set(0);REP(j,i,n){dp|=dp<<v[j];while(idx[j]<query[j].size()&&query[j][idx[j]].fi<i){auto x=query[j][idx[j]];bitset<5001> ndp=dp;for(int t=i-1;t>=x.fi;t--){ndp|=ndp<<v[t];if(ndp.test(K[x.se])){ans[x.se]=1;break;}}if(ans[x.se]==-1)ans[x.se]=0;idx[j]++;}}}for(ll x:ans)YesNo(x);}