結果
問題 | No.854 公平なりんご分配 |
ユーザー | hide1214 |
提出日時 | 2019-07-26 22:15:22 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,599 bytes |
コンパイル時間 | 1,212 ms |
コンパイル使用メモリ | 119,884 KB |
実行使用メモリ | 271,020 KB |
最終ジャッジ日時 | 2024-07-02 07:37:54 |
合計ジャッジ時間 | 10,120 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
13,764 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 2 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 3 ms
6,940 KB |
testcase_10 | AC | 2 ms
6,940 KB |
testcase_11 | AC | 3 ms
6,940 KB |
testcase_12 | AC | 3 ms
6,944 KB |
testcase_13 | AC | 2 ms
6,940 KB |
testcase_14 | AC | 2 ms
6,944 KB |
testcase_15 | AC | 2 ms
6,944 KB |
testcase_16 | AC | 2 ms
6,944 KB |
testcase_17 | AC | 2 ms
6,940 KB |
testcase_18 | AC | 2 ms
6,944 KB |
testcase_19 | AC | 2 ms
6,944 KB |
testcase_20 | AC | 2 ms
6,940 KB |
testcase_21 | AC | 2 ms
6,940 KB |
testcase_22 | AC | 3 ms
6,944 KB |
testcase_23 | AC | 3 ms
6,940 KB |
testcase_24 | AC | 4 ms
6,940 KB |
testcase_25 | AC | 3 ms
6,944 KB |
testcase_26 | AC | 4 ms
6,940 KB |
testcase_27 | AC | 4 ms
7,556 KB |
testcase_28 | AC | 3 ms
6,944 KB |
testcase_29 | AC | 3 ms
6,944 KB |
testcase_30 | AC | 3 ms
6,940 KB |
testcase_31 | AC | 4 ms
6,940 KB |
testcase_32 | AC | 33 ms
59,732 KB |
testcase_33 | AC | 28 ms
34,168 KB |
testcase_34 | AC | 53 ms
79,776 KB |
testcase_35 | AC | 40 ms
65,204 KB |
testcase_36 | AC | 17 ms
7,692 KB |
testcase_37 | AC | 31 ms
56,012 KB |
testcase_38 | AC | 24 ms
46,556 KB |
testcase_39 | AC | 70 ms
84,544 KB |
testcase_40 | AC | 29 ms
30,256 KB |
testcase_41 | AC | 37 ms
52,604 KB |
testcase_42 | AC | 50 ms
79,816 KB |
testcase_43 | AC | 49 ms
54,936 KB |
testcase_44 | AC | 55 ms
73,424 KB |
testcase_45 | AC | 42 ms
17,960 KB |
testcase_46 | AC | 64 ms
71,796 KB |
testcase_47 | AC | 30 ms
43,064 KB |
testcase_48 | AC | 46 ms
77,600 KB |
testcase_49 | AC | 46 ms
79,456 KB |
testcase_50 | AC | 30 ms
56,756 KB |
testcase_51 | AC | 67 ms
75,456 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<iostream>#include<vector>#include<string>#include<cmath>#include<algorithm>#include<functional>#include<numeric>#include<queue>#include<stack>#include<map>#include<unordered_map>#include<set>#include<bitset>#include<random>#pragma regionusing namespace std;#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)#define rep(i,n) FOR(i,0LL,n)#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)#define rrep(i,n) RFOR(i,0LL,n)#define all(x) x.begin(),x.end()#define rall(x) x.rbegin(),x.rend()#define COUNT(a,y,x) upper_bound(all(a), y) - lower_bound(all(a), x)#define UNIQUE(a) sort(all(a)); a.erase(unique(all(a)), a.end())#define pb push_backtypedef long long int ll;typedef vector<ll> vll;typedef vector<vll> vvll;typedef pair<ll, ll> pll;typedef vector<pll> vpll;typedef vector<string> vs;typedef map<ll, ll> MAP;const ll inf = 1LL << 61;const ll mod = 1000000007LL;//const ll mod = 998244353LL;ll n = 0, m = 0, ans = 0, tmp = 0, ma = -inf, mi = inf;string s;ll dx[9] = { 0,1,0,-1,0,1,1,-1,-1 }, dy[9] = { 0,0,1,0,-1,1,-1,1,-1 };#define endl '\n'#pragma endregion#define MAX 222222ll sum[MAX / 2][333], a[MAX / 2];vll pr;bool is[MAX + 1];void AllPrime(ll x) {rep(i, x + 1) is[i] = true;is[0] = false;is[1] = false;rep(i, x + 1) {if (is[i]) {pr.pb(i);for (ll j = 2 * i; j <= x; j += i) is[j] = false;}}}vpll factorize(ll val) {vpll ret;for (ll i = 2; i*i <= val; i++) {if (!(val%i)) {ll fcnt = 0;while (!(val%i)) {val /= i;fcnt++;}ret.pb(make_pair(i, fcnt));}}if (val != 1) ret.pb(make_pair(val, 1));return ret;}int main(void) {ios::sync_with_stdio(false); cin.tie(0);AllPrime(2000);unordered_map<ll, ll> idx;cin >> n;FOR(i, 1, n + 1) cin >> a[i];rep(i, pr.size()) idx[pr[i]] = i;FOR(i, 1, n + 1) {vpll v = factorize(a[i]);rep(j, v.size()) {sum[i][idx[v[j].first]] += v[j].second;}}rep(i, n) {rep(j, pr.size()) {sum[i + 1][j] += sum[i][j];}}cin >> m;while (m--) {ll p, le, ri;cin >> p >> le >> ri;bool ok = true;vpll v = factorize(p);if (p == 1) {cout << "Yes" << endl;continue;}if (v[v.size() - 1].first > 2000) {cout << "NO" << endl;continue;}rep(i, v.size()) {ll id = idx[v[i].first];ll num = v[i].second;if (sum[ri][id] - sum[le - 1][id] < num) ok = false;}if (ok) cout << "Yes" << endl;else cout << "NO" << endl;}return 0;}