結果

問題 No.854 公平なりんご分配
ユーザー tatyamtatyam
提出日時 2019-02-22 23:30:49
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 814 ms / 3,153 ms
コード長 7,757 bytes
コンパイル時間 2,520 ms
コンパイル使用メモリ 211,520 KB
実行使用メモリ 249,600 KB
最終ジャッジ日時 2024-11-26 01:04:42
合計ジャッジ時間 21,553 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
8,064 KB
testcase_01 AC 6 ms
8,064 KB
testcase_02 AC 6 ms
8,064 KB
testcase_03 AC 6 ms
8,064 KB
testcase_04 AC 5 ms
8,064 KB
testcase_05 AC 6 ms
8,064 KB
testcase_06 AC 5 ms
8,192 KB
testcase_07 AC 6 ms
8,064 KB
testcase_08 AC 6 ms
8,064 KB
testcase_09 AC 6 ms
8,192 KB
testcase_10 AC 5 ms
8,064 KB
testcase_11 AC 5 ms
8,064 KB
testcase_12 AC 6 ms
8,320 KB
testcase_13 AC 6 ms
8,320 KB
testcase_14 AC 6 ms
8,192 KB
testcase_15 AC 6 ms
8,192 KB
testcase_16 AC 6 ms
8,320 KB
testcase_17 AC 6 ms
8,320 KB
testcase_18 AC 6 ms
8,192 KB
testcase_19 AC 6 ms
8,064 KB
testcase_20 AC 6 ms
8,064 KB
testcase_21 AC 6 ms
8,192 KB
testcase_22 AC 9 ms
8,576 KB
testcase_23 AC 9 ms
9,472 KB
testcase_24 AC 12 ms
10,368 KB
testcase_25 AC 8 ms
9,216 KB
testcase_26 AC 13 ms
10,496 KB
testcase_27 AC 10 ms
10,368 KB
testcase_28 AC 9 ms
8,576 KB
testcase_29 AC 7 ms
8,704 KB
testcase_30 AC 8 ms
9,088 KB
testcase_31 AC 11 ms
10,240 KB
testcase_32 AC 78 ms
59,136 KB
testcase_33 AC 86 ms
35,456 KB
testcase_34 AC 152 ms
78,592 KB
testcase_35 AC 109 ms
63,488 KB
testcase_36 AC 67 ms
11,392 KB
testcase_37 AC 73 ms
56,064 KB
testcase_38 AC 57 ms
46,848 KB
testcase_39 AC 231 ms
82,944 KB
testcase_40 AC 94 ms
31,360 KB
testcase_41 AC 106 ms
52,352 KB
testcase_42 AC 135 ms
77,312 KB
testcase_43 AC 162 ms
54,528 KB
testcase_44 AC 169 ms
72,192 KB
testcase_45 AC 158 ms
20,480 KB
testcase_46 AC 219 ms
71,296 KB
testcase_47 AC 84 ms
43,136 KB
testcase_48 AC 124 ms
76,160 KB
testcase_49 AC 118 ms
77,696 KB
testcase_50 AC 67 ms
55,808 KB
testcase_51 AC 222 ms
74,496 KB
testcase_52 AC 177 ms
36,864 KB
testcase_53 AC 98 ms
36,352 KB
testcase_54 AC 176 ms
42,368 KB
testcase_55 AC 66 ms
36,608 KB
testcase_56 AC 54 ms
37,888 KB
testcase_57 AC 86 ms
32,256 KB
testcase_58 AC 147 ms
17,792 KB
testcase_59 AC 47 ms
29,056 KB
testcase_60 AC 115 ms
32,128 KB
testcase_61 AC 57 ms
12,288 KB
testcase_62 AC 129 ms
28,416 KB
testcase_63 AC 120 ms
29,568 KB
testcase_64 AC 40 ms
16,256 KB
testcase_65 AC 102 ms
68,608 KB
testcase_66 AC 79 ms
23,296 KB
testcase_67 AC 150 ms
46,976 KB
testcase_68 AC 143 ms
24,448 KB
testcase_69 AC 94 ms
82,944 KB
testcase_70 AC 57 ms
31,616 KB
testcase_71 AC 66 ms
33,792 KB
testcase_72 AC 93 ms
11,520 KB
testcase_73 AC 89 ms
56,704 KB
testcase_74 AC 184 ms
67,584 KB
testcase_75 AC 91 ms
34,176 KB
testcase_76 AC 161 ms
54,272 KB
testcase_77 AC 164 ms
75,904 KB
testcase_78 AC 162 ms
26,368 KB
testcase_79 AC 177 ms
48,000 KB
testcase_80 AC 160 ms
50,304 KB
testcase_81 AC 130 ms
52,224 KB
testcase_82 AC 793 ms
249,472 KB
testcase_83 AC 506 ms
249,600 KB
testcase_84 AC 814 ms
249,600 KB
testcase_85 AC 535 ms
249,344 KB
testcase_86 AC 434 ms
249,472 KB
testcase_87 AC 749 ms
249,472 KB
testcase_88 AC 758 ms
249,472 KB
testcase_89 AC 753 ms
249,472 KB
testcase_90 AC 755 ms
249,472 KB
testcase_91 AC 753 ms
249,344 KB
testcase_92 AC 757 ms
249,600 KB
testcase_93 AC 756 ms
249,472 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using uint=unsigned int;
using pcc=pair<char,char>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using pdd=pair<double,double>;
using tuplis=pair<ll,pll>;
using tuplis2=pair<pll,ll>;
template<class T> using pq=priority_queue<T,vector<T>,greater<T>>;
const ll LINF=0x1fffffffffffffff;
const ll MOD=1000000007;
const ll MODD=0x3b800001;
const int INF=0x3fffffff;
const double DINF=numeric_limits<double>::infinity();
const vector<pii> four={{-1,0},{0,1},{1,0},{0,-1}};
#define _overload4(_1,_2,_3,_4,name,...) name
#define _overload3(_1,_2,_3,name,...) name
#define _rep1(n) _rep2(i,n)
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(ll i=a;i<b;++i)
#define _rep4(i,a,b,c) for(ll i=a;i<b;i+=c)
#define rep(...) _overload4(__VA_ARGS__,_rep4,_rep3,_rep2,_rep1)(__VA_ARGS__)
#define _rrep1(n) _rrep2(i,n)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(ll i=b-1;i>=a;i--)
#define _rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c)
#define rrep(...) _overload4(__VA_ARGS__,_rrep4,_rrep3,_rrep2,_rrep1)(__VA_ARGS__)
#define each(i,a) for(auto&& i:a)
#define sum(...) accumulate(range(__VA_ARGS__),0LL)
#define dsum(...) accumulate(range(__VA_ARGS__),double(0))
#define _range(i) (i).begin(),(i).end()
#define _range2(i,k) (i).begin(),(i).begin()+k
#define _range3(i,a,b) (i).begin()+a,(i).begin()+b
#define range(...) _overload3(__VA_ARGS__,_range3,_range2,_range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(),(i).rend()
#define _rrange2(i,k) (i).rbegin(),(i).rbegin()+k
#define _rrange3(i,a,b) (i).rbegin()+a,(i).rbegin()+b
#define rrange(...) _overload3(__VA_ARGS__,_rrange3,_rrange2,_rrange)(__VA_ARGS__)
#define yes(i) out(i?"yes":"no")
#define Yes(i) out(i?"Yes":"No")
#define YES(i) out(i?"YES":"NO")
#define Possible(i) out(i?"Possible":"Impossible")
#define elif else if
#define unless(a) if(!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define vec(type,name,...) vector<type> name(__VA_ARGS__)
#define VEC(type,name,size) vector<type> name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__));in(name)
#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
__attribute__((constructor)) void SETTINGS(){cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);};
inline constexpr ll gcd(ll a,ll b){if(!a||!b)return 0;if(a<b){ll c=a;a=b;b=c;}while(b){ll c=b;b=a%b;a=c;}return a;}
inline constexpr ll lcm(ll a,ll b){return a*b/gcd(a,b);}
template<class T>
inline constexpr T min(vector<T>& v){return *min_element(range(v));}
inline char min(string& v){return *min_element(range(v));}
template<class T>
inline constexpr T max(vector<T>& v){return *max_element(range(v));}
inline char max(string& v){return *max_element(range(v));}
inline ll pow(ll a,ll b){if(b==0)return 1;ll ans=pow(a,b/2);return ans*ans*(b&1?a:1);}
inline ll modpow(ll a,ll b,ll mod=MOD){if(b==0)return 1;ll ans=pow(a,b/2);return ans*ans*(b&1?a:1)%mod;}
template<typename T>
inline bool update_min(T& mn,const T& cnt){if(mn>cnt){mn=cnt;return 1;}else return 0;}
template<typename T>
inline bool update_max(T& mx,const T& cnt){if(mx<cnt){mx=cnt;return 1;}else return 0;}
inline void in() {}
template<class T>
istream& operator >> (istream& is, vector<T>& vec);
template<class T,size_t size>
istream& operator >> (istream& is, array<T,size>& vec);
template<class T,class L>
istream& operator >> (istream& is, pair<T,L>& p);
template<class T>
ostream& operator << (ostream& os, vector<T>& vec);
template<class T,class L>
ostream& operator << (ostream& os, pair<T,L>& p);
template<class T>
istream& operator >> (istream& is, vector<T>& vec){for(T& x: vec) is >> x;return is;}
template<class T,class L>
istream& operator >> (istream& is, pair<T,L>& p){is >> p.first;is >> p.second;return is;}
template<class T>
ostream& operator << (ostream& os, vector<T>& vec){os << vec[0];rep(i,1,vec.size()){os << ' ' << vec[i];}return os;}
template<class T>
ostream& operator << (ostream& os, deque<T>& deq){os << deq[0];rep(i,1,deq.size()){os << ' ' << deq[i];}return os;}
template<class T,class L>
ostream& operator << (ostream& os, pair<T,L>& p){os << p.first << " " << p.second;return os;}
template<class T,class L>
pair<T,L> operator + (pair<T,L> a, pair<T,L> b){return {a.first + b.first, a.second + b.second};}
template<class T,class L>
pair<T,L> operator +=(pair<T,L> a, pair<T,L> b){a.first += b.first; a.second += b.second; return a;}
template <class Head, class... Tail>
inline void in(Head&& head,Tail&&... tail){cin>>head;in(move(tail)...);}
template <class T>
inline bool out(T t){cout<<t<<'\n';return 0;}
inline bool out(){cout<<'\n';return 0;}
template <class Head, class... Tail>
inline bool out(Head head,Tail... tail){cout<<head<<' ';out(move(tail)...);return 0;}
template <class T>
inline void err(T t){cerr<<t<<'\n';}
inline void err(){cerr<<'\n';}
template <class Head, class... Tail>
inline void err(Head head,Tail... tail){cerr<<head<<' ';out(move(tail)...);}



const vector<ll>primes={0,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,1381,1399,1409,1423,1427,1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,1487,1489,1493,1499,1511,1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,1601,1607,1609,1613,1619,1621,1627,1637,1657,1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,1823,1831,1847,1861,1867,1871,1873,1877,1879,1889,1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,1993,1997,1999};
vv(ll,factor,2001,primes.size());
signed main(){
    factor[0][0]=1;
    rep(i,1,primes.size()){
        ll a=1;
        while((a*=primes[i])<2001)for(ll j=a;j<2001;j+=a)factor[j][i]++;
    }
    LL(n);
    vector<vector<ll>>s(n+1);
    vector<ll>cnt(primes.size());
    s[0]=cnt;
    rep(n){
        LL(a);
        rep(primes.size())cnt[i]+=factor[a][i];
        s[i+1]=cnt;
    }
    LL(q);
    rep(q){
        LL(p,l,r);
        l--;
        vector<ll>b(primes.size());
        rep(i,1,primes.size()){
            if(p==1)break;
            while(p%primes[i]==0){
                b[i]++;
                p/=primes[i];
            }
        }
        auto c=s[r];
        rep(primes.size())c[i]-=s[l][i];
        if(c[0]){
            out("Yes");
            continue;
        }
        if(p!=1){
            out("NO");
            continue;
        }
        rep(primes.size())if(c[i]<b[i]){
            out("NO");
            goto br;
        }
        out("Yes");
    br:;
    }
}
0