#845022 (C++14) No.854 公平なりんご分配

• 問題: No.854 公平なりんご分配
• ユーザー: daddy
• 提出日時: 2023-03-02 14:30:52
• 言語: C++14 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,182 ms / 3,153 ms
• コード長: 3,053 bytes
• コンパイル時間: 1,826 ms
• コンパイル使用メモリ: 174,448 KB
• 実行使用メモリ: 246,360 KB
• 最終ジャッジ日時: 2023-10-17 11:33:27
• 合計ジャッジ時間: 37,155 ms
• ジャッジサーバーID （参考情報）: judge12 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	171 ms; 246,360 KB
testcase_01	AC	172 ms; 246,360 KB
testcase_02	AC	170 ms; 246,360 KB
testcase_03	AC	171 ms; 246,360 KB
testcase_04	AC	173 ms; 246,360 KB
testcase_05	AC	171 ms; 246,360 KB
testcase_06	AC	171 ms; 246,360 KB
testcase_07	AC	173 ms; 246,360 KB
testcase_08	AC	173 ms; 246,360 KB
testcase_09	AC	171 ms; 246,360 KB
testcase_10	AC	170 ms; 246,360 KB
testcase_11	AC	170 ms; 246,360 KB
testcase_12	AC	172 ms; 246,360 KB
testcase_13	AC	173 ms; 246,360 KB
testcase_14	AC	172 ms; 246,360 KB
testcase_15	AC	173 ms; 246,360 KB
testcase_16	AC	174 ms; 246,360 KB
testcase_17	AC	172 ms; 246,360 KB
testcase_18	AC	170 ms; 246,360 KB
testcase_19	AC	169 ms; 246,360 KB
testcase_20	AC	172 ms; 246,360 KB
testcase_21	AC	172 ms; 246,360 KB
testcase_22	AC	174 ms; 246,360 KB
testcase_23	AC	176 ms; 246,360 KB
testcase_24	AC	181 ms; 246,360 KB
testcase_25	AC	176 ms; 246,360 KB
testcase_26	AC	178 ms; 246,360 KB
testcase_27	AC	178 ms; 246,360 KB
testcase_28	AC	176 ms; 246,360 KB
testcase_29	AC	173 ms; 246,360 KB
testcase_30	AC	174 ms; 246,360 KB
testcase_31	AC	181 ms; 246,360 KB
testcase_32	AC	266 ms; 246,360 KB
testcase_33	AC	280 ms; 246,360 KB
testcase_34	AC	364 ms; 246,360 KB
testcase_35	AC	308 ms; 246,360 KB
testcase_36	AC	257 ms; 246,360 KB
testcase_37	AC	263 ms; 246,360 KB
testcase_38	AC	242 ms; 246,360 KB
testcase_39	AC	467 ms; 246,360 KB
testcase_40	AC	294 ms; 246,360 KB
testcase_41	AC	306 ms; 246,360 KB
testcase_42	AC	343 ms; 246,360 KB
testcase_43	AC	382 ms; 246,360 KB
testcase_44	AC	391 ms; 246,360 KB
testcase_45	AC	381 ms; 246,360 KB
testcase_46	AC	456 ms; 246,360 KB
testcase_47	AC	276 ms; 246,360 KB
testcase_48	AC	327 ms; 246,360 KB
testcase_49	AC	319 ms; 246,360 KB
testcase_50	AC	256 ms; 246,360 KB
testcase_51	AC	449 ms; 246,360 KB
testcase_52	AC	347 ms; 246,360 KB
testcase_53	AC	263 ms; 246,360 KB
testcase_54	AC	347 ms; 246,360 KB
testcase_55	AC	234 ms; 246,360 KB
testcase_56	AC	227 ms; 246,360 KB
testcase_57	AC	260 ms; 246,360 KB
testcase_58	AC	350 ms; 246,360 KB
testcase_59	AC	220 ms; 246,360 KB
testcase_60	AC	292 ms; 246,360 KB
testcase_61	AC	226 ms; 246,360 KB
testcase_62	AC	316 ms; 246,360 KB
testcase_63	AC	272 ms; 246,360 KB
testcase_64	AC	208 ms; 246,360 KB
testcase_65	AC	289 ms; 246,360 KB
testcase_66	AC	254 ms; 246,360 KB
testcase_67	AC	312 ms; 246,360 KB
testcase_68	AC	306 ms; 246,360 KB
testcase_69	AC	286 ms; 246,360 KB
testcase_70	AC	227 ms; 246,360 KB
testcase_71	AC	235 ms; 246,360 KB
testcase_72	AC	285 ms; 246,360 KB
testcase_73	AC	262 ms; 246,360 KB
testcase_74	AC	349 ms; 246,360 KB
testcase_75	AC	268 ms; 246,360 KB
testcase_76	AC	308 ms; 246,360 KB
testcase_77	AC	326 ms; 246,360 KB
testcase_78	AC	352 ms; 246,360 KB
testcase_79	AC	339 ms; 246,360 KB
testcase_80	AC	331 ms; 246,360 KB
testcase_81	AC	289 ms; 246,360 KB
testcase_82	AC	744 ms; 246,360 KB
testcase_83	AC	1,116 ms; 246,360 KB
testcase_84	AC	1,120 ms; 246,360 KB
testcase_85	AC	1,181 ms; 246,360 KB
testcase_86	AC	415 ms; 246,360 KB
testcase_87	AC	746 ms; 246,360 KB
testcase_88	AC	742 ms; 246,360 KB
testcase_89	AC	749 ms; 246,360 KB
testcase_90	AC	748 ms; 246,360 KB
testcase_91	AC	746 ms; 246,360 KB
testcase_92	AC	1,178 ms; 246,360 KB
testcase_93	AC	1,182 ms; 246,360 KB

ソースコード

#pragma GCC optimization ("O3")

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
using dvec = vector<double>;
using dmat = vector<dvec>;

#define INF (1LL<<61)
#define MOD 1000000007LL 
//#define MOD 998244353LL

#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORE(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((ll)(x).size())
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) {ASC((x)); REV((x));}
#define BIT(s,i) (((s)>>(i))&1)
#define pb push_back
#define fi first
#define se second

template<class T> inline int chmin(T& a, T b) {if(a>b) {a=b; return 1;} return 0;}
template<class T> inline int chmax(T& a, T b) {if(a<b) {a=b; return 1;} return 0;}

class mint {
public:
    ll x;
    mint(ll x=0) : x((x%MOD+MOD)%MOD) {}
    mint operator-() const {return mint(-x);}
    mint& operator+=(const mint& a) {if((x+=a.x)>=MOD) x-=MOD; return *this;}
    mint& operator-=(const mint& a) {if((x+=MOD-a.x)>=MOD) x-=MOD; return *this;}
    mint& operator*=(const mint& a) {(x*=a.x)%=MOD; return *this;}
    mint operator+(const mint& a) const {mint b(*this); return b+=a;}
    mint operator-(const mint& a) const {mint b(*this); return b-=a;}
    mint operator*(const mint& a) const {mint b(*this); return b*=a;}
    mint pow(ll t) const {if(!t) return 1; mint a=pow(t>>1); return (t&1?*this*a:a)*a;}
    mint inv() const {return pow(MOD-2);}
    mint& operator/=(const mint& a) {return *this*=a.inv();}
    mint operator/(const mint& a) const {mint b(*this); return b/=a;}
};
istream &operator>>(istream& is, mint& a) {ll t; is>>t; a=t; return is;}
ostream &operator<<(ostream& os, const mint& a) {return os<<a.x;}
using mvec = vector<mint>;
using mmat = vector<mvec>;

ll N, Q, p, l, r, M = 2000;
vec A(100010), Z(100010), P, D(2000);
mat S(100010, vec(305));

void prime()
{
    for(ll i=2; i<M; ++i) {
        if(D[i] == 0) {
            P.pb(i);
            for(ll j=i*i; j<M; j+=i) {
                if(D[j] == 0) D[j] = i;
            }
        }
    }
}

int main()
{
    ll N;
    cin >> N;

    prime();
    REP(i,0,N) {
        ll x;
        cin >> x;
        REP(j,0,SZ(P)) {
            S[i+1][j] = S[i][j];
            if(x) {
                while(x%P[j] == 0) {
                    ++S[i+1][j];
                    x /= P[j];
                }
            }
        }
        Z[i+1] = Z[i];
        if(x == 0) ++Z[i+1];
    }

    cin >> Q;
    while(Q--) {
        cin >> p >> l >> r;
        --l;
        if(Z[r]-Z[l]) {
            PR("Yes");
            continue;
        }
        ll i;
        for(i=0; i<SZ(P); ++i) {
            ll x = 0;
            while(p%P[i] == 0) {
                p /= P[i];
                ++x;
            }
            if(S[r][i]-S[l][i] < x) break;
        }
        if(i != SZ(P) || p != 1) PR("NO");
        else PR("Yes");
    }

    return 0;
}

/*



*/