結果

問題 No.1349 Subset Product Queries
ユーザー rniyarniya
提出日時 2021-01-17 13:19:11
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 875 ms / 2,000 ms
コード長 4,402 bytes
コンパイル時間 2,736 ms
コンパイル使用メモリ 214,776 KB
実行使用メモリ 156,928 KB
最終ジャッジ日時 2023-08-19 18:55:05
合計ジャッジ時間 17,005 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 2 ms
4,384 KB
testcase_04 AC 2 ms
4,384 KB
testcase_05 AC 1 ms
4,384 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 1 ms
4,380 KB
testcase_09 AC 2 ms
4,384 KB
testcase_10 AC 2 ms
4,384 KB
testcase_11 AC 866 ms
155,700 KB
testcase_12 AC 765 ms
138,672 KB
testcase_13 AC 761 ms
138,588 KB
testcase_14 AC 763 ms
117,832 KB
testcase_15 AC 812 ms
147,816 KB
testcase_16 AC 875 ms
156,928 KB
testcase_17 AC 564 ms
84,464 KB
testcase_18 AC 230 ms
14,100 KB
testcase_19 AC 208 ms
8,784 KB
testcase_20 AC 732 ms
116,276 KB
testcase_21 AC 611 ms
106,388 KB
testcase_22 AC 476 ms
78,724 KB
testcase_23 AC 655 ms
98,704 KB
testcase_24 AC 491 ms
63,516 KB
testcase_25 AC 541 ms
85,936 KB
testcase_26 AC 639 ms
112,284 KB
testcase_27 AC 503 ms
77,324 KB
testcase_28 AC 487 ms
72,520 KB
testcase_29 AC 506 ms
79,608 KB
testcase_30 AC 526 ms
81,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
const long long MOD=1000000007;
// const long long MOD=998244353;
#define LOCAL
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(),(x).end()
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U,typename V>
ostream&operator<<(ostream &os,const tuple<T,U,V> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template<typename T,typename U,typename V,typename W>
ostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const unordered_map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const multiset<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const unordered_set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();){
        os << *itr;
        if (++itr!=s.end()) os << ',';
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const deque<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
    if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
    if (a<b){a=b; return true;} return false;
}
#pragma endregion

const int MAX_N=5010;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,Q,P; cin >> N >> Q >> P;
    vector<int> A(N);
    for (int i=0;i<N;++i) cin >> A[i];

    vector<vector<bool>> check(N,vector<bool>(P,false));
    vector<vector<int>> Max(N,vector<int>(P,-1));
    vector<vector<int>> dp(N),cur(N);
    auto update=[&](int i,int j,int x){
        if (check[i][x]) return;
        check[i][x]=true;
        dp[j].emplace_back(x);
        Max[i][x]=j;
    };

    for (int i=0;i<N;++i){
        vector<bool> check(P,false);
        update(i,i,A[i]);
        for (int j=i-1;j>=0;--j){
            for (int x:cur[j]){
                update(i,j,x);
                update(i,j,x*A[i]%P);
            }
        }
        cur=dp;
        for (int j=0;j<N;++j) dp[j].clear();
    }

    for (;Q--;){
        int L,R,K; cin >> L >> R >> K;
        cout << (Max[--R][K]>=--L?"Yes":"No") << '\n';
    }
}
0