結果

問題 No.854 公平なりんご分配
ユーザー 👑 hitonanodehitonanode
提出日時 2019-07-26 22:16:45
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 4,932 bytes
コンパイル時間 1,756 ms
コンパイル使用メモリ 185,104 KB
実行使用メモリ 40,240 KB
最終ジャッジ日時 2023-09-15 01:57:37
合計ジャッジ時間 9,862 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 1 ms
4,376 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 AC 2 ms
4,376 KB
testcase_11 AC 2 ms
4,380 KB
testcase_12 AC 1 ms
4,380 KB
testcase_13 AC 2 ms
4,380 KB
testcase_14 AC 1 ms
4,376 KB
testcase_15 AC 2 ms
4,380 KB
testcase_16 AC 1 ms
4,376 KB
testcase_17 AC 1 ms
4,376 KB
testcase_18 AC 1 ms
4,380 KB
testcase_19 AC 1 ms
4,376 KB
testcase_20 AC 1 ms
4,376 KB
testcase_21 AC 1 ms
4,376 KB
testcase_22 AC 2 ms
4,376 KB
testcase_23 AC 2 ms
4,376 KB
testcase_24 AC 3 ms
4,384 KB
testcase_25 AC 2 ms
4,380 KB
testcase_26 AC 4 ms
4,376 KB
testcase_27 AC 3 ms
4,500 KB
testcase_28 AC 2 ms
4,376 KB
testcase_29 AC 2 ms
4,376 KB
testcase_30 AC 2 ms
4,380 KB
testcase_31 AC 3 ms
4,376 KB
testcase_32 AC 45 ms
28,604 KB
testcase_33 AC 48 ms
16,876 KB
testcase_34 AC 109 ms
38,108 KB
testcase_35 AC 73 ms
30,796 KB
testcase_36 AC 29 ms
4,644 KB
testcase_37 AC 44 ms
27,020 KB
testcase_38 AC 33 ms
22,672 KB
testcase_39 AC 179 ms
40,240 KB
testcase_40 AC 55 ms
14,932 KB
testcase_41 AC 70 ms
25,312 KB
testcase_42 AC 94 ms
37,492 KB
testcase_43 AC 134 ms
26,356 KB
testcase_44 AC 139 ms
34,964 KB
testcase_45 AC 84 ms
9,524 KB
testcase_46 AC 186 ms
34,552 KB
testcase_47 AC 55 ms
20,736 KB
testcase_48 AC 86 ms
36,968 KB
testcase_49 AC 78 ms
37,712 KB
testcase_50 AC 41 ms
26,896 KB
testcase_51 AC 181 ms
36,344 KB
testcase_52 TLE -
testcase_53 -- -
testcase_54 -- -
testcase_55 -- -
testcase_56 -- -
testcase_57 -- -
testcase_58 -- -
testcase_59 -- -
testcase_60 -- -
testcase_61 -- -
testcase_62 -- -
testcase_63 -- -
testcase_64 -- -
testcase_65 -- -
testcase_66 -- -
testcase_67 -- -
testcase_68 -- -
testcase_69 -- -
testcase_70 -- -
testcase_71 -- -
testcase_72 -- -
testcase_73 -- -
testcase_74 -- -
testcase_75 -- -
testcase_76 -- -
testcase_77 -- -
testcase_78 -- -
testcase_79 -- -
testcase_80 -- -
testcase_81 -- -
testcase_82 -- -
testcase_83 -- -
testcase_84 -- -
testcase_85 -- -
testcase_86 -- -
testcase_87 -- -
testcase_88 -- -
testcase_89 -- -
testcase_90 -- -
testcase_91 -- -
testcase_92 -- -
testcase_93 -- -
権限があれば一括ダウンロードができます

ソースコード

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 /////



// 素因数分解
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{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43};
    int N;
    cin >> N;
    vector<int> A(N);
    cin >> A;
    vector<vector<int>> rc(2000);
    set<int> ps;
    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);
                ps.insert(pa.first);
            }
            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;
        bool flg = true;
        for (auto d : ps)
        {
            if (P < d) break;
            int n = rc[d][R] - rc[d][L - 1];
            while (P % d == 0)
            {
                if (n) n--;
                else
                {
                    flg = false;
                    break;
                }
                P /= d;
            }
        }
        if (!flg)
        {
            puts("NO");
            continue;
        }
        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");
    }
}
0