結果
問題 | No.854 公平なりんご分配 |
ユーザー |
![]() |
提出日時 | 2019-02-22 19:22:32 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
MLE
|
実行時間 | - |
コード長 | 6,178 bytes |
コンパイル時間 | 2,164 ms |
コンパイル使用メモリ | 219,872 KB |
実行使用メモリ | 814,732 KB |
最終ジャッジ日時 | 2024-11-25 10:20:24 |
合計ジャッジ時間 | 82,456 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,820 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 2 ms
6,816 KB |
testcase_04 | AC | 2 ms
6,820 KB |
testcase_05 | AC | 2 ms
6,820 KB |
testcase_06 | AC | 2 ms
6,820 KB |
testcase_07 | AC | 2 ms
6,820 KB |
testcase_08 | AC | 2 ms
6,820 KB |
testcase_09 | AC | 2 ms
6,816 KB |
testcase_10 | AC | 2 ms
6,816 KB |
testcase_11 | AC | 2 ms
6,816 KB |
testcase_12 | AC | 2 ms
6,816 KB |
testcase_13 | AC | 2 ms
6,816 KB |
testcase_14 | AC | 2 ms
6,820 KB |
testcase_15 | AC | 2 ms
6,816 KB |
testcase_16 | AC | 2 ms
6,816 KB |
testcase_17 | AC | 2 ms
6,820 KB |
testcase_18 | AC | 2 ms
6,820 KB |
testcase_19 | AC | 1 ms
6,816 KB |
testcase_20 | AC | 1 ms
6,816 KB |
testcase_21 | AC | 2 ms
6,816 KB |
testcase_22 | AC | 8 ms
6,816 KB |
testcase_23 | AC | 12 ms
6,816 KB |
testcase_24 | AC | 28 ms
8,832 KB |
testcase_25 | AC | 9 ms
6,816 KB |
testcase_26 | AC | 30 ms
9,088 KB |
testcase_27 | AC | 23 ms
8,960 KB |
testcase_28 | AC | 7 ms
6,820 KB |
testcase_29 | AC | 4 ms
6,820 KB |
testcase_30 | AC | 9 ms
6,820 KB |
testcase_31 | AC | 25 ms
7,808 KB |
testcase_32 | AC | 887 ms
279,680 KB |
testcase_33 | AC | 752 ms
140,672 KB |
testcase_34 | MLE | - |
testcase_35 | AC | 1,090 ms
300,032 KB |
testcase_36 | AC | 295 ms
12,288 KB |
testcase_37 | AC | 831 ms
258,432 KB |
testcase_38 | AC | 741 ms
208,000 KB |
testcase_39 | MLE | - |
testcase_40 | AC | 766 ms
119,680 KB |
testcase_41 | AC | 992 ms
238,592 KB |
testcase_42 | MLE | - |
testcase_43 | AC | 1,338 ms
250,368 KB |
testcase_44 | MLE | - |
testcase_45 | AC | 968 ms
54,656 KB |
testcase_46 | MLE | - |
testcase_47 | AC | 840 ms
188,544 KB |
testcase_48 | MLE | - |
testcase_49 | MLE | - |
testcase_50 | AC | 784 ms
256,256 KB |
testcase_51 | MLE | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | WA | - |
testcase_62 | WA | - |
testcase_63 | WA | - |
testcase_64 | WA | - |
testcase_65 | MLE | - |
testcase_66 | WA | - |
testcase_67 | WA | - |
testcase_68 | WA | - |
testcase_69 | MLE | - |
testcase_70 | WA | - |
testcase_71 | WA | - |
testcase_72 | WA | - |
testcase_73 | WA | - |
testcase_74 | MLE | - |
testcase_75 | WA | - |
testcase_76 | WA | - |
testcase_77 | MLE | - |
testcase_78 | WA | - |
testcase_79 | WA | - |
testcase_80 | WA | - |
testcase_81 | WA | - |
testcase_82 | MLE | - |
testcase_83 | MLE | - |
testcase_84 | MLE | - |
testcase_85 | AC | 353 ms
23,536 KB |
testcase_86 | WA | - |
testcase_87 | MLE | - |
testcase_88 | MLE | - |
testcase_89 | MLE | - |
testcase_90 | MLE | - |
testcase_91 | MLE | - |
testcase_92 | MLE | - |
testcase_93 | MLE | - |
ソースコード
#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)...);} unordered_map<ll,ll>factor(ll a){ unordered_map<ll,ll>ans; if(!a){ ans[0]=1; return ans; } for(ll i=2;i*i<=a;i++)while(a%i==0){ ans[i]++; a/=i; } if(a!=1)ans[a]++; return ans; } signed main(){ LL(n); VEC(ll,a,n); vector<unordered_map<ll,ll>>s(n+1); rep(n)s[i+1]=factor(a[i]); rep(n)each(j,s[i])s[i+1][j.first]+=j.second; LL(q); rep(q){ LL(p,l,r); l--; auto b=factor(p); auto c=s[r]; each(i,s[l])c[i.first]-=i.second; if(c[0]){ out("NO"); continue; } each(i,b)if(c[i.first]<i.second){ out("NO"); goto br; } out("Yes"); br:; } }