結果

問題 No.854 公平なりんご分配
ユーザー hitonanode
提出日時 2019-07-26 22:08:50
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,342 bytes
コンパイル時間 1,882 ms
コンパイル使用メモリ 183,908 KB
実行使用メモリ 40,320 KB
最終ジャッジ日時 2024-07-02 07:28:22
合計ジャッジ時間 8,869 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 20 WA * 30 TLE * 1 -- * 41
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx")

using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////


vector<int> makePrimeLst(int N)
{
    vector<int> ans;
    vector<int> alive(N+1, 1);
    lint now = 2;
    for (; now * now <= N; now++)
    {
        if (alive[now]) ans.push_back(now);
        for (int t = now; t <= N; t += now) alive[t] = 0;
    }
    for (; now <= N; now++) if (alive[now]) ans.push_back(now);
    return ans;
}

// 素因数分解
unordered_map<int, int> primeFactorize(int N, const vector<int> &primeLst)
{
    unordered_map<int, int> ans;
    for (auto v : primeLst)
    {
        int n = 0;
        while (!(N % v))
        {
            N /= v;
            n++;
        }
        if (n) ans[v] = n;
        if (N == 1) return ans;
    }
    ans[N]++;
    return ans;
}

int main()
{
    vector<int> primes = makePrimeLst(45);
    int N;
    cin >> N;
    vector<int> A(N);
    cin >> A;
    vector<vector<int>> rc(2000);
    REP(i, N)
    {
        auto v = primeFactorize(A[i], primes);
        for (auto pa : v)
        {
            if (rc[pa.first].size() == 0) rc[pa.first].resize(N + 1);
            rc[pa.first][i + 1] += pa.second;
        }
    }
    REP(d, 2000) if (rc[d].size())
    {
        REP(i, N) rc[d][i + 1] += rc[d][i];
    }

    int Q;
    cin >> Q;
    REP(_, Q)
    {
        int P, L, R;
        cin >> P >> L >> R;
        REP(d, 45) if (rc[d].size())
        {
            if (P < d) break;
            int n = rc[d][R] - rc[d][L - 1];
            while (n and P % d == 0)
            {
                n--;
                P /= d;
            }
        }
        if (P == 1)
        {
            puts("Yes");
            continue;
        }
        if (P > 2000 or rc[P].size() == 0 or P < 45 or rc[P][R] - rc[P][L - 1] == 0)
        {
            puts("NO");
            continue;
        }
        puts("Yes");

        // unordered_map<int, int> p = primeFactorize(P, primes);
        // bool flg = true;
        // for (auto pa : p)
        // {
        //     if (pa.first > 2000 or rc[pa.first].size() == 0 or rc[pa.first][R] - rc[pa.first][L - 1] < pa.second)
        //     {
        //         flg = false;
        //         break;
        //     }
        // }
        // if (P == 1) puts("Yes");
        // else puts("NO");
    }
}
0