結果
問題 | No.854 公平なりんご分配 |
ユーザー | hide1214 |
提出日時 | 2019-07-26 22:45:48 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 588 ms / 3,153 ms |
コード長 | 2,630 bytes |
コンパイル時間 | 1,055 ms |
コンパイル使用メモリ | 117,444 KB |
実行使用メモリ | 266,396 KB |
最終ジャッジ日時 | 2023-09-15 03:19:59 |
合計ジャッジ時間 | 11,985 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,492 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
5,516 KB |
testcase_03 | AC | 2 ms
5,516 KB |
testcase_04 | AC | 2 ms
5,516 KB |
testcase_05 | AC | 2 ms
5,532 KB |
testcase_06 | AC | 2 ms
5,536 KB |
testcase_07 | AC | 2 ms
5,744 KB |
testcase_08 | AC | 2 ms
5,568 KB |
testcase_09 | AC | 2 ms
5,508 KB |
testcase_10 | AC | 2 ms
5,536 KB |
testcase_11 | AC | 2 ms
5,496 KB |
testcase_12 | AC | 2 ms
5,508 KB |
testcase_13 | AC | 2 ms
5,528 KB |
testcase_14 | AC | 2 ms
5,532 KB |
testcase_15 | AC | 2 ms
5,464 KB |
testcase_16 | AC | 2 ms
5,592 KB |
testcase_17 | AC | 2 ms
5,508 KB |
testcase_18 | AC | 2 ms
5,472 KB |
testcase_19 | AC | 2 ms
5,708 KB |
testcase_20 | AC | 2 ms
5,468 KB |
testcase_21 | AC | 2 ms
5,672 KB |
testcase_22 | AC | 5 ms
7,620 KB |
testcase_23 | AC | 4 ms
7,580 KB |
testcase_24 | AC | 6 ms
7,584 KB |
testcase_25 | AC | 4 ms
7,532 KB |
testcase_26 | AC | 7 ms
9,644 KB |
testcase_27 | AC | 5 ms
9,592 KB |
testcase_28 | AC | 5 ms
7,516 KB |
testcase_29 | AC | 3 ms
7,516 KB |
testcase_30 | AC | 4 ms
7,560 KB |
testcase_31 | AC | 6 ms
7,540 KB |
testcase_32 | AC | 42 ms
61,200 KB |
testcase_33 | AC | 61 ms
36,416 KB |
testcase_34 | AC | 100 ms
81,600 KB |
testcase_35 | AC | 68 ms
65,292 KB |
testcase_36 | AC | 64 ms
9,640 KB |
testcase_37 | AC | 42 ms
59,016 KB |
testcase_38 | AC | 32 ms
48,684 KB |
testcase_39 | AC | 165 ms
87,728 KB |
testcase_40 | AC | 73 ms
32,240 KB |
testcase_41 | AC | 72 ms
54,856 KB |
testcase_42 | AC | 84 ms
81,556 KB |
testcase_43 | AC | 122 ms
56,956 KB |
testcase_44 | AC | 119 ms
75,576 KB |
testcase_45 | AC | 142 ms
20,168 KB |
testcase_46 | AC | 161 ms
75,508 KB |
testcase_47 | AC | 54 ms
44,584 KB |
testcase_48 | AC | 76 ms
79,496 KB |
testcase_49 | AC | 68 ms
81,560 KB |
testcase_50 | AC | 36 ms
56,912 KB |
testcase_51 | AC | 157 ms
77,440 KB |
testcase_52 | AC | 87 ms
36,360 KB |
testcase_53 | AC | 41 ms
36,464 KB |
testcase_54 | AC | 86 ms
42,536 KB |
testcase_55 | AC | 25 ms
36,396 KB |
testcase_56 | AC | 25 ms
38,416 KB |
testcase_57 | AC | 48 ms
32,252 KB |
testcase_58 | AC | 118 ms
15,776 KB |
testcase_59 | AC | 22 ms
28,124 KB |
testcase_60 | AC | 63 ms
32,376 KB |
testcase_61 | AC | 34 ms
11,648 KB |
testcase_62 | AC | 81 ms
28,256 KB |
testcase_63 | AC | 43 ms
30,184 KB |
testcase_64 | AC | 23 ms
16,008 KB |
testcase_65 | AC | 49 ms
71,316 KB |
testcase_66 | AC | 44 ms
21,968 KB |
testcase_67 | AC | 61 ms
48,684 KB |
testcase_68 | AC | 69 ms
24,072 KB |
testcase_69 | AC | 43 ms
87,716 KB |
testcase_70 | AC | 23 ms
32,264 KB |
testcase_71 | AC | 27 ms
34,300 KB |
testcase_72 | AC | 83 ms
9,588 KB |
testcase_73 | AC | 35 ms
59,016 KB |
testcase_74 | AC | 75 ms
71,328 KB |
testcase_75 | AC | 47 ms
34,300 KB |
testcase_76 | AC | 49 ms
56,900 KB |
testcase_77 | AC | 58 ms
79,504 KB |
testcase_78 | AC | 109 ms
26,116 KB |
testcase_79 | AC | 76 ms
48,716 KB |
testcase_80 | AC | 74 ms
52,896 KB |
testcase_81 | AC | 47 ms
54,852 KB |
testcase_82 | AC | 180 ms
266,276 KB |
testcase_83 | AC | 570 ms
266,104 KB |
testcase_84 | AC | 543 ms
266,152 KB |
testcase_85 | AC | 588 ms
266,156 KB |
testcase_86 | AC | 111 ms
266,160 KB |
testcase_87 | AC | 161 ms
266,168 KB |
testcase_88 | AC | 161 ms
266,396 KB |
testcase_89 | AC | 161 ms
266,112 KB |
testcase_90 | AC | 160 ms
266,396 KB |
testcase_91 | AC | 160 ms
266,228 KB |
testcase_92 | AC | 558 ms
266,292 KB |
testcase_93 | AC | 552 ms
266,108 KB |
ソースコード
#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 region using 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_back typedef 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 222222 ll sum[MAX / 2][333], a[MAX], zero[MAX]; 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) { if (a[i] == 0) { zero[i]++; continue; } vpll v = factorize(a[i]); rep(j, v.size()) { sum[i][idx[v[j].first]] = v[j].second; } } rep(i, n) { zero[i + 1] += zero[i]; 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; if (zero[ri] - zero[le - 1]) { cout << "Yes" << endl; continue; } rep(i, pr.size()) { ll num = 0; while (p%pr[i] == 0) { num++; p /= pr[i]; } if (sum[ri][i] - sum[le - 1][i] < num) ok = false; } if (ok&&p == 1) cout << "Yes" << endl; else cout << "NO" << endl; } return 0; }