結果

問題 No.1349 Subset Product Queries
ユーザー ningenMeningenMe
提出日時 2021-01-16 16:15:42
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 485 ms / 2,000 ms
コード長 3,461 bytes
コンパイル時間 2,264 ms
コンパイル使用メモリ 210,920 KB
実行使用メモリ 95,872 KB
最終ジャッジ日時 2024-05-05 19:07:15
合計ジャッジ時間 13,067 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 1 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 1 ms
5,376 KB
testcase_11 AC 462 ms
93,824 KB
testcase_12 AC 450 ms
83,840 KB
testcase_13 AC 472 ms
83,712 KB
testcase_14 AC 472 ms
87,552 KB
testcase_15 AC 472 ms
88,960 KB
testcase_16 AC 485 ms
94,592 KB
testcase_17 AC 409 ms
60,800 KB
testcase_18 AC 306 ms
9,472 KB
testcase_19 AC 293 ms
6,656 KB
testcase_20 AC 451 ms
73,856 KB
testcase_21 AC 466 ms
84,992 KB
testcase_22 AC 412 ms
59,264 KB
testcase_23 AC 448 ms
79,360 KB
testcase_24 AC 387 ms
49,408 KB
testcase_25 AC 428 ms
69,888 KB
testcase_26 AC 481 ms
95,872 KB
testcase_27 AC 405 ms
61,696 KB
testcase_28 AC 409 ms
61,696 KB
testcase_29 AC 399 ms
60,288 KB
testcase_30 AC 424 ms
63,488 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using int128  = __int128_t;
using int64   = long long;
using int32   = int;
using uint128 = __uint128_t;
using uint64  = unsigned long long;
using uint32  = unsigned int;

#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;

constexpr int64 MOD = 1'000'000'000LL + 7; //'
constexpr int64 MOD2 = 998244353;
constexpr int64 HIGHINF = 1'000'000'000'000'000'000LL;
constexpr int64 LOWINF = 1'000'000'000'000'000LL; //'
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const deque<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;}
inline constexpr int msb(int x) {return x?31-__builtin_clz(x):-1;}
inline constexpr int64 ceil_div(const int64 a,const int64 b) {return (a+(b-1))/b;}// return ceil(a/b)
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

/**
 * @url 
 * @est
 */ 
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];
    auto dp = multivector(N,P,-1);
    {
        chmax(dp[0][A[0]],0);
    }
    for(int i=1;i<N;++i) {
        chmax(dp[i][A[i]],i);
        for(int j=0;j<P;++j) {
            chmax(dp[i][j],dp[i-1][j]);
            chmax(dp[i][(j*A[i]) % P],dp[i-1][j]);
        }
    }
    while(Q--) {
        int l,r,k; cin >> l >> r >> k;
        l--,r--;
        Yn(dp[r][k]>=l);
    }
    return 0;
}
0