結果
問題 | No.854 公平なりんご分配 |
ユーザー |
![]() |
提出日時 | 2019-07-26 23:03:25 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,823 bytes |
コンパイル時間 | 678 ms |
コンパイル使用メモリ | 75,108 KB |
実行使用メモリ | 252,032 KB |
最終ジャッジ日時 | 2024-07-02 09:05:41 |
合計ジャッジ時間 | 21,900 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 13 ms
8,448 KB |
testcase_01 | AC | 12 ms
8,448 KB |
testcase_02 | AC | 13 ms
8,576 KB |
testcase_03 | AC | 13 ms
8,576 KB |
testcase_04 | AC | 12 ms
8,448 KB |
testcase_05 | AC | 13 ms
8,448 KB |
testcase_06 | AC | 12 ms
8,448 KB |
testcase_07 | AC | 12 ms
8,448 KB |
testcase_08 | AC | 12 ms
8,448 KB |
testcase_09 | AC | 13 ms
8,448 KB |
testcase_10 | AC | 13 ms
8,448 KB |
testcase_11 | AC | 12 ms
8,448 KB |
testcase_12 | AC | 13 ms
8,576 KB |
testcase_13 | AC | 12 ms
8,576 KB |
testcase_14 | AC | 12 ms
8,448 KB |
testcase_15 | AC | 13 ms
8,448 KB |
testcase_16 | AC | 12 ms
8,576 KB |
testcase_17 | AC | 13 ms
8,576 KB |
testcase_18 | AC | 12 ms
8,576 KB |
testcase_19 | AC | 12 ms
8,448 KB |
testcase_20 | AC | 13 ms
8,576 KB |
testcase_21 | AC | 12 ms
8,576 KB |
testcase_22 | AC | 18 ms
8,960 KB |
testcase_23 | AC | 15 ms
9,856 KB |
testcase_24 | AC | 19 ms
10,624 KB |
testcase_25 | AC | 15 ms
9,472 KB |
testcase_26 | AC | 20 ms
10,752 KB |
testcase_27 | AC | 17 ms
10,752 KB |
testcase_28 | AC | 18 ms
8,832 KB |
testcase_29 | AC | 15 ms
8,960 KB |
testcase_30 | AC | 17 ms
9,472 KB |
testcase_31 | AC | 19 ms
10,496 KB |
testcase_32 | AC | 86 ms
59,776 KB |
testcase_33 | AC | 110 ms
35,840 KB |
testcase_34 | AC | 179 ms
79,360 KB |
testcase_35 | AC | 124 ms
64,128 KB |
testcase_36 | AC | 105 ms
11,648 KB |
testcase_37 | AC | 83 ms
56,576 KB |
testcase_38 | AC | 63 ms
47,360 KB |
testcase_39 | AC | 277 ms
83,712 KB |
testcase_40 | AC | 126 ms
31,804 KB |
testcase_41 | AC | 128 ms
52,992 KB |
testcase_42 | AC | 154 ms
78,208 KB |
testcase_43 | AC | 204 ms
55,040 KB |
testcase_44 | AC | 201 ms
72,832 KB |
testcase_45 | AC | 229 ms
20,736 KB |
testcase_46 | AC | 267 ms
72,064 KB |
testcase_47 | AC | 103 ms
43,520 KB |
testcase_48 | AC | 140 ms
76,928 KB |
testcase_49 | AC | 126 ms
78,464 KB |
testcase_50 | AC | 70 ms
56,320 KB |
testcase_51 | AC | 255 ms
75,264 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 | AC | 821 ms
252,032 KB |
testcase_83 | AC | 851 ms
251,904 KB |
testcase_84 | AC | 848 ms
251,904 KB |
testcase_85 | AC | 865 ms
251,908 KB |
testcase_86 | AC | 782 ms
251,832 KB |
testcase_87 | WA | - |
testcase_88 | WA | - |
testcase_89 | WA | - |
testcase_90 | WA | - |
testcase_91 | WA | - |
testcase_92 | AC | 904 ms
251,904 KB |
testcase_93 | AC | 898 ms
251,904 KB |
ソースコード
#include <iostream> #include <vector> #define int long long using namespace std; int PRIME_SIZE; int MAX_APPLE = 2019; signed main() { vector<int> prime; for (int i = 2; i <= MAX_APPLE; i++) { bool flag = true; for (auto x:prime) { if (x * x > i)break; if (i % x == 0)flag = false; } if (flag)prime.push_back(i); } PRIME_SIZE = prime.size(); vector<vector<int>> factoring(MAX_APPLE + 1, vector<int>(PRIME_SIZE)); for (int i = 1; i <= MAX_APPLE; i++) { int x = i; for (int j = 0; j < PRIME_SIZE; j++) { while (x % prime[j] == 0) { x /= prime[j]; factoring[i][j]++; } } } int n; cin >> n; vector<vector<int>> cumulative_sum(n + 1, vector<int>(PRIME_SIZE)); int zero_count[n + 1]; for (int i = 1; i <= n; i++) { int now; cin >> now; for (int j = 0; j < PRIME_SIZE; j++) cumulative_sum[i][j] = cumulative_sum[i - 1][j] + factoring[now][j]; zero_count[i] = zero_count[i - 1] + (now == 0); } int q; cin >> q; for (int i = 0; i < q; i++) { int p, l, r; cin >> p >> l >> r; vector<int> needed(PRIME_SIZE); for (int j = 0; j < PRIME_SIZE; j++) { while (p % prime[j] == 0) { p /= prime[j]; needed[j]++; } } if (p != 1) { cout << (zero_count[r] - zero_count[l - 1] ? "Yes" : "NO") << endl; continue; } bool ret = true; for (int j = 0; j < PRIME_SIZE; j++) { if (cumulative_sum[r][j] - cumulative_sum[l - 1][j] < needed[j]) ret = false; } cout << (ret ? "Yes" : "NO") << endl; } return 0; }