結果
問題 | No.854 公平なりんご分配 |
ユーザー | ミドリムシ |
提出日時 | 2019-07-26 21:54:31 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 493 ms / 3,153 ms |
コード長 | 4,407 bytes |
コンパイル時間 | 1,909 ms |
コンパイル使用メモリ | 175,356 KB |
実行使用メモリ | 128,852 KB |
最終ジャッジ日時 | 2023-09-15 01:15:01 |
合計ジャッジ時間 | 13,827 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,384 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,376 KB |
testcase_13 | AC | 2 ms
4,376 KB |
testcase_14 | AC | 2 ms
4,380 KB |
testcase_15 | AC | 1 ms
4,380 KB |
testcase_16 | AC | 2 ms
4,376 KB |
testcase_17 | AC | 2 ms
4,380 KB |
testcase_18 | AC | 2 ms
4,384 KB |
testcase_19 | AC | 2 ms
4,380 KB |
testcase_20 | AC | 2 ms
4,380 KB |
testcase_21 | AC | 1 ms
4,384 KB |
testcase_22 | AC | 4 ms
4,384 KB |
testcase_23 | AC | 3 ms
4,380 KB |
testcase_24 | AC | 5 ms
4,380 KB |
testcase_25 | AC | 3 ms
4,380 KB |
testcase_26 | AC | 5 ms
4,380 KB |
testcase_27 | AC | 4 ms
4,376 KB |
testcase_28 | AC | 4 ms
4,380 KB |
testcase_29 | AC | 2 ms
4,380 KB |
testcase_30 | AC | 3 ms
4,376 KB |
testcase_31 | AC | 5 ms
4,380 KB |
testcase_32 | AC | 41 ms
29,748 KB |
testcase_33 | AC | 54 ms
17,416 KB |
testcase_34 | AC | 91 ms
39,764 KB |
testcase_35 | AC | 63 ms
31,964 KB |
testcase_36 | AC | 47 ms
4,580 KB |
testcase_37 | AC | 39 ms
28,168 KB |
testcase_38 | AC | 29 ms
23,516 KB |
testcase_39 | AC | 146 ms
42,032 KB |
testcase_40 | AC | 63 ms
15,408 KB |
testcase_41 | AC | 65 ms
26,216 KB |
testcase_42 | AC | 78 ms
39,160 KB |
testcase_43 | AC | 105 ms
27,272 KB |
testcase_44 | AC | 106 ms
36,476 KB |
testcase_45 | AC | 118 ms
9,556 KB |
testcase_46 | AC | 141 ms
36,016 KB |
testcase_47 | AC | 50 ms
21,728 KB |
testcase_48 | AC | 70 ms
38,500 KB |
testcase_49 | AC | 64 ms
39,432 KB |
testcase_50 | AC | 34 ms
27,948 KB |
testcase_51 | AC | 139 ms
37,820 KB |
testcase_52 | AC | 102 ms
18,484 KB |
testcase_53 | AC | 53 ms
18,080 KB |
testcase_54 | AC | 101 ms
21,020 KB |
testcase_55 | AC | 33 ms
18,036 KB |
testcase_56 | AC | 27 ms
18,912 KB |
testcase_57 | AC | 51 ms
15,860 KB |
testcase_58 | AC | 106 ms
8,316 KB |
testcase_59 | AC | 25 ms
14,180 KB |
testcase_60 | AC | 68 ms
15,828 KB |
testcase_61 | AC | 36 ms
5,292 KB |
testcase_62 | AC | 82 ms
13,700 KB |
testcase_63 | AC | 64 ms
14,448 KB |
testcase_64 | AC | 23 ms
7,212 KB |
testcase_65 | AC | 51 ms
34,724 KB |
testcase_66 | AC | 48 ms
11,068 KB |
testcase_67 | AC | 79 ms
23,592 KB |
testcase_68 | AC | 85 ms
11,880 KB |
testcase_69 | AC | 46 ms
42,384 KB |
testcase_70 | AC | 29 ms
15,632 KB |
testcase_71 | AC | 34 ms
16,696 KB |
testcase_72 | AC | 65 ms
4,720 KB |
testcase_73 | AC | 44 ms
28,512 KB |
testcase_74 | AC | 97 ms
34,232 KB |
testcase_75 | AC | 52 ms
16,684 KB |
testcase_76 | AC | 80 ms
27,248 KB |
testcase_77 | AC | 79 ms
38,396 KB |
testcase_78 | AC | 108 ms
12,892 KB |
testcase_79 | AC | 98 ms
23,968 KB |
testcase_80 | AC | 89 ms
25,212 KB |
testcase_81 | AC | 66 ms
26,168 KB |
testcase_82 | AC | 343 ms
128,672 KB |
testcase_83 | AC | 475 ms
128,852 KB |
testcase_84 | AC | 464 ms
128,640 KB |
testcase_85 | AC | 324 ms
17,832 KB |
testcase_86 | AC | 202 ms
6,156 KB |
testcase_87 | AC | 341 ms
128,732 KB |
testcase_88 | AC | 335 ms
128,840 KB |
testcase_89 | AC | 337 ms
128,668 KB |
testcase_90 | AC | 343 ms
128,752 KB |
testcase_91 | AC | 345 ms
128,712 KB |
testcase_92 | AC | 493 ms
128,488 KB |
testcase_93 | AC | 493 ms
128,740 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using lint = long long; const lint mod = 1e9 + 7; #define all(x) (x).begin(), (x).end() #define bitcount(n) __builtin_popcountl((lint)(n)) #define fcout cout << fixed << setprecision(15) #define highest(x) (63 - __builtin_clzl(x)) template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; } template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; } template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; } lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }} struct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); } template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; } template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; } template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } } template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; } struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } }; template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; } int main(){ int N; cin >> N; vector<int> prime; vector<int> factor[N]; int is_0[N + 1]; for(int i = 0; i < N; i++){ int A; cin >> A; if(A == 0){ is_0[i + 1] = 1; continue; } is_0[i + 1] = 0; for(int j = 2; j * j <= A; ){ if(A % j){ j++; }else{ A /= j; factor[i].push_back(j); prime.push_back(j); } } if(A != 1){ factor[i].push_back(A); prime.push_back(A); } } sort(all(prime)); prime.erase(unique(all(prime)), prime.end()); int table[prime.size()][N + 1]; for(int i = 0; i < prime.size(); i++){ for(int j = 0; j < N; j++){ table[i][j + 1] = 0; } } for(int i = 0; i < N; i++){ for(int j: factor[i]){ int pos = int(lower_bound(all(prime), j) - prime.begin()); table[pos][i + 1]++; } } for(int i = 0; i < prime.size(); i++){ for(int j = 0; j < N; j++){ table[i][j + 1] += table[i][j]; } } for(int i = 0; i < N; i++){ is_0[i + 1] += is_0[i]; } int Q; cin >> Q; for(int i = 0; i < Q; i++){ int P, L, R; cin >> P >> L >> R; L--; if(is_0[R] - is_0[L]){ cout << "Yes" << endl; goto next; } for(int j: prime){ int divide = 0; while(P % j == 0){ P /= j; divide++; } if(divide){ int pos = int(lower_bound(all(prime), j) - prime.begin()); if(table[pos][R] - table[pos][L] < divide){ cout << "NO" << endl; goto next; } } } if(P != 1){ cout << "NO" << endl; }else{ cout << "Yes" << endl; } next:; } }