結果
問題 | No.854 公平なりんご分配 |
ユーザー | ei1333333 |
提出日時 | 2019-07-26 22:15:32 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,855 bytes |
コンパイル時間 | 2,324 ms |
コンパイル使用メモリ | 213,876 KB |
実行使用メモリ | 130,212 KB |
最終ジャッジ日時 | 2024-07-02 07:38:20 |
合計ジャッジ時間 | 12,192 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
13,764 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 3 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 2 ms
6,944 KB |
testcase_10 | AC | 2 ms
6,940 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 2 ms
6,944 KB |
testcase_13 | AC | 2 ms
6,944 KB |
testcase_14 | AC | 2 ms
6,944 KB |
testcase_15 | AC | 2 ms
6,940 KB |
testcase_16 | AC | 2 ms
6,940 KB |
testcase_17 | AC | 2 ms
6,940 KB |
testcase_18 | AC | 3 ms
6,944 KB |
testcase_19 | AC | 2 ms
6,944 KB |
testcase_20 | AC | 2 ms
6,944 KB |
testcase_21 | AC | 2 ms
6,940 KB |
testcase_22 | AC | 4 ms
6,940 KB |
testcase_23 | AC | 4 ms
6,944 KB |
testcase_24 | AC | 5 ms
6,940 KB |
testcase_25 | AC | 4 ms
6,944 KB |
testcase_26 | AC | 6 ms
6,940 KB |
testcase_27 | AC | 4 ms
6,944 KB |
testcase_28 | AC | 4 ms
6,944 KB |
testcase_29 | AC | 3 ms
6,940 KB |
testcase_30 | AC | 4 ms
6,944 KB |
testcase_31 | AC | 5 ms
6,944 KB |
testcase_32 | AC | 45 ms
28,544 KB |
testcase_33 | AC | 47 ms
16,896 KB |
testcase_34 | AC | 86 ms
38,272 KB |
testcase_35 | AC | 60 ms
30,848 KB |
testcase_36 | AC | 39 ms
6,944 KB |
testcase_37 | AC | 43 ms
27,136 KB |
testcase_38 | AC | 33 ms
22,656 KB |
testcase_39 | AC | 125 ms
40,448 KB |
testcase_40 | AC | 52 ms
14,976 KB |
testcase_41 | AC | 59 ms
25,216 KB |
testcase_42 | AC | 76 ms
37,632 KB |
testcase_43 | AC | 88 ms
26,368 KB |
testcase_44 | AC | 94 ms
35,072 KB |
testcase_45 | AC | 87 ms
9,472 KB |
testcase_46 | AC | 118 ms
34,560 KB |
testcase_47 | AC | 46 ms
20,608 KB |
testcase_48 | AC | 70 ms
36,992 KB |
testcase_49 | AC | 67 ms
38,016 KB |
testcase_50 | AC | 40 ms
27,008 KB |
testcase_51 | AC | 117 ms
36,352 KB |
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 | WA | - |
testcase_66 | WA | - |
testcase_67 | WA | - |
testcase_68 | WA | - |
testcase_69 | WA | - |
testcase_70 | WA | - |
testcase_71 | WA | - |
testcase_72 | WA | - |
testcase_73 | WA | - |
testcase_74 | WA | - |
testcase_75 | WA | - |
testcase_76 | WA | - |
testcase_77 | WA | - |
testcase_78 | WA | - |
testcase_79 | WA | - |
testcase_80 | WA | - |
testcase_81 | WA | - |
testcase_82 | TLE | - |
testcase_83 | -- | - |
testcase_84 | -- | - |
testcase_85 | -- | - |
testcase_86 | -- | - |
testcase_87 | -- | - |
testcase_88 | -- | - |
testcase_89 | -- | - |
testcase_90 | -- | - |
testcase_91 | -- | - |
testcase_92 | -- | - |
testcase_93 | -- | - |
ソースコード
#include <bits/stdc++.h>using namespace std;using int64 = long long;const int mod = 1e9 + 7;const int64 infll = (1LL << 62) - 1;const int inf = (1 << 30) - 1;struct IoSetup {IoSetup() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(10);cerr << fixed << setprecision(10);}} iosetup;template< typename T1, typename T2 >ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {os << p.first << " " << p.second;return os;}template< typename T1, typename T2 >istream &operator>>(istream &is, pair< T1, T2 > &p) {is >> p.first >> p.second;return is;}template< typename T >ostream &operator<<(ostream &os, const vector< T > &v) {for(int i = 0; i < (int) v.size(); i++) {os << v[i] << (i + 1 != v.size() ? " " : "");}return os;}template< typename T >istream &operator>>(istream &is, vector< T > &v) {for(T &in : v) is >> in;return is;}template< typename T1, typename T2 >inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }template< typename T1, typename T2 >inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }template< typename T = int64 >vector< T > make_v(size_t a) {return vector< T >(a);}template< typename T, typename... Ts >auto make_v(size_t a, Ts... ts) {return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));}template< typename T, typename V >typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {t = v;}template< typename T, typename V >typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {for(auto &e : t) fill_v(e, v);}template< typename F >struct FixPoint : F {FixPoint(F &&f) : F(forward< F >(f)) {}template< typename... Args >decltype(auto) operator()(Args &&... args) const {return F::operator()(*this, forward< Args >(args)...);}};template< typename F >inline decltype(auto) MFP(F &&f) {return FixPoint< F >{forward< F >(f)};}std::vector< int > eratosthenes_sieve(int n) {std::vector< int > ps(n + 1);std::iota(ps.begin() + 2, ps.end(), 2);for(int i = 2; i * i <= n; ++i)if(ps[i])for(int j = i * i; j <= n; j += i) ps[j] = 0;return ps;}std::vector< int > make_primes(int n) {std::vector< int > ps = eratosthenes_sieve(n);ps.erase(std::remove(ps.begin(), ps.end(), 0), ps.end());return ps;}std::pair< std::vector< int64 >, std::vector< int64 > > prime_factor_decomp_fast(int64 n) {static const auto ps = make_primes(32000); // sqrt(10^9)std::vector< int64 > p, e;int64 m = n;for(auto &i : ps) {if(i * i > n) break;if(m % i != 0) continue;int c = 0;while(m % i == 0) c++, m /= i;p.push_back(i);e.push_back(c);}if(m > 1) {p.push_back(m);e.push_back(1);}return std::make_pair(p, e);}int main() {int N;cin >> N;vector< int64 > A(N);cin >> A;auto ret = make_primes(2001);vector< int > id(2020, -1);int ptr = 0;for(auto &p : ret) id[p] = ptr++;vector< vector< int > > sum(ret.size(), vector< int >(N + 1));for(int i = 0; i < N; i++) {auto p = prime_factor_decomp_fast(A[i]);for(int j = 0; j < p.first.size(); j++) {sum[id[p.first[j]]][i + 1] += p.second[j];}}for(auto &vs : sum) {for(int i = 1; i < vs.size(); i++) vs[i] += vs[i - 1];}int Q;cin >> Q;for(int i = 0; i < Q; i++) {int p, l, r;cin >> p >> l >> r;--l;auto tap = prime_factor_decomp_fast(p);bool flag = true;for(int j = 0; j < tap.first.size(); j++) {if(tap.first[j] > 2000) {flag = false;} else {auto &vs = sum[id[tap.first[j]]];flag &= vs[r] - vs[l] >= tap.second[j];}}if(flag) cout << "Yes" << endl;else cout << "NO" << endl;}}