結果
問題 | No.854 公平なりんご分配 |
ユーザー |
![]() |
提出日時 | 2019-08-03 13:39:10 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 377 ms / 3,153 ms |
コード長 | 2,485 bytes |
コンパイル時間 | 663 ms |
コンパイル使用メモリ | 85,452 KB |
実行使用メモリ | 124,928 KB |
最終ジャッジ日時 | 2024-07-05 17:37:47 |
合計ジャッジ時間 | 10,020 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 1 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 1 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 1 ms
5,376 KB |
testcase_10 | AC | 1 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 1 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 1 ms
5,376 KB |
testcase_16 | AC | 1 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 1 ms
5,376 KB |
testcase_19 | AC | 1 ms
5,376 KB |
testcase_20 | AC | 1 ms
5,376 KB |
testcase_21 | AC | 1 ms
5,376 KB |
testcase_22 | AC | 3 ms
5,376 KB |
testcase_23 | AC | 3 ms
5,376 KB |
testcase_24 | AC | 5 ms
5,376 KB |
testcase_25 | AC | 2 ms
5,376 KB |
testcase_26 | AC | 4 ms
5,376 KB |
testcase_27 | AC | 4 ms
5,376 KB |
testcase_28 | AC | 2 ms
5,376 KB |
testcase_29 | AC | 2 ms
5,376 KB |
testcase_30 | AC | 3 ms
5,376 KB |
testcase_31 | AC | 4 ms
5,376 KB |
testcase_32 | AC | 46 ms
29,184 KB |
testcase_33 | AC | 40 ms
17,152 KB |
testcase_34 | AC | 81 ms
38,912 KB |
testcase_35 | AC | 59 ms
31,232 KB |
testcase_36 | AC | 26 ms
5,376 KB |
testcase_37 | AC | 43 ms
27,776 KB |
testcase_38 | AC | 34 ms
23,040 KB |
testcase_39 | AC | 111 ms
41,088 KB |
testcase_40 | AC | 42 ms
15,232 KB |
testcase_41 | AC | 53 ms
25,728 KB |
testcase_42 | AC | 73 ms
38,272 KB |
testcase_43 | AC | 74 ms
26,752 KB |
testcase_44 | AC | 83 ms
35,712 KB |
testcase_45 | AC | 60 ms
9,472 KB |
testcase_46 | AC | 101 ms
35,200 KB |
testcase_47 | AC | 41 ms
20,992 KB |
testcase_48 | AC | 68 ms
37,888 KB |
testcase_49 | AC | 67 ms
38,528 KB |
testcase_50 | AC | 42 ms
27,392 KB |
testcase_51 | AC | 101 ms
36,736 KB |
testcase_52 | AC | 53 ms
18,048 KB |
testcase_53 | AC | 32 ms
17,792 KB |
testcase_54 | AC | 54 ms
20,736 KB |
testcase_55 | AC | 26 ms
17,792 KB |
testcase_56 | AC | 26 ms
18,560 KB |
testcase_57 | AC | 32 ms
15,488 KB |
testcase_58 | AC | 51 ms
8,320 KB |
testcase_59 | AC | 20 ms
14,080 KB |
testcase_60 | AC | 38 ms
15,744 KB |
testcase_61 | AC | 16 ms
5,760 KB |
testcase_62 | AC | 42 ms
13,696 KB |
testcase_63 | AC | 31 ms
14,336 KB |
testcase_64 | AC | 14 ms
7,424 KB |
testcase_65 | AC | 55 ms
33,920 KB |
testcase_66 | AC | 27 ms
11,136 KB |
testcase_67 | AC | 48 ms
23,040 KB |
testcase_68 | AC | 38 ms
11,648 KB |
testcase_69 | AC | 60 ms
41,216 KB |
testcase_70 | AC | 23 ms
15,360 KB |
testcase_71 | AC | 25 ms
16,512 KB |
testcase_72 | AC | 34 ms
5,376 KB |
testcase_73 | AC | 42 ms
27,776 KB |
testcase_74 | AC | 66 ms
33,408 KB |
testcase_75 | AC | 34 ms
16,640 KB |
testcase_76 | AC | 47 ms
26,752 KB |
testcase_77 | AC | 63 ms
37,632 KB |
testcase_78 | AC | 53 ms
12,672 KB |
testcase_79 | AC | 55 ms
23,552 KB |
testcase_80 | AC | 55 ms
24,832 KB |
testcase_81 | AC | 44 ms
25,728 KB |
testcase_82 | AC | 218 ms
124,928 KB |
testcase_83 | AC | 350 ms
124,928 KB |
testcase_84 | AC | 356 ms
124,928 KB |
testcase_85 | AC | 377 ms
124,928 KB |
testcase_86 | AC | 108 ms
124,928 KB |
testcase_87 | AC | 228 ms
124,928 KB |
testcase_88 | AC | 217 ms
124,928 KB |
testcase_89 | AC | 217 ms
124,800 KB |
testcase_90 | AC | 217 ms
124,800 KB |
testcase_91 | AC | 218 ms
124,928 KB |
testcase_92 | AC | 371 ms
124,928 KB |
testcase_93 | AC | 372 ms
124,928 KB |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:94:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 94 | scanf("%d", &n); | ~~~~~^~~~~~~~~~ main.cpp:101:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 101 | scanf("%d", &ai); | ~~~~~^~~~~~~~~~~ main.cpp:115:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 115 | scanf("%d", &q); | ~~~~~^~~~~~~~~~ main.cpp:119:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 119 | scanf("%d%d%d", &p, &l, &r); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~
ソースコード
/* -*- coding: utf-8 -*- * * 854.cc: No.854 公平なりんご分配 - yukicoder */ #include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<iostream> #include<string> #include<vector> #include<map> #include<set> #include<stack> #include<list> #include<queue> #include<deque> #include<algorithm> #include<numeric> #include<utility> #include<complex> #include<functional> using namespace std; /* constant */ const int MAX_N = 100000; const int MAX_E2 = 1 << 18; // 262144 const int MAX_P = 2000; const int PN = 310; /* typedef */ typedef int vec[PN]; /* global variables */ bool primes[MAX_P + 1]; vec pnums, afss[MAX_N + 1]; int zss[MAX_N + 1]; /* subroutines */ int gen_primes(int maxp, vec pnums) { memset(primes, true, sizeof(primes)); primes[0] = primes[1] = false; int p, pn = 0; for (p = 2; p * p <= maxp; p++) if (primes[p]) { pnums[pn++] = p; for (int q = p * p; q <= maxp; q += p) primes[q] = false; } for (; p <= maxp; p++) if (primes[p]) pnums[pn++] = p; return pn; } bool prime_decomp(int n, int pn, vec pnums, vec fs) { for (int i = 0; i < pn; i++) { int &pi = pnums[i]; fs[i] = 0; while (n % pi == 0) n /= pi, fs[i]++; } return (n == 1); } void copyvec(int n, vec c, vec a) { copy(a, a + n, c); } void addvec(int n, vec c, vec a, vec b) { for (int i = 0; i < n; i++) c[i] = a[i] + b[i]; } void subvec(int n, vec c, vec a, vec b) { for (int i = 0; i < n; i++) c[i] = a[i] - b[i]; } bool cmpvec(int n, vec a, vec b) { bool ok = true; for (int i = 0; ok && i < n; i++) ok = (a[i] >= b[i]); return ok; } /* main */ int main() { int pn = gen_primes(MAX_P, pnums); //printf("pn=%d\n", pn); return 0; int n; scanf("%d", &n); memset(afss[0], 0, sizeof(vec)); zss[0] = 0; for (int i = 0; i < n; i++) { int ai; scanf("%d", &ai); if (ai == 0) { copyvec(pn, afss[i + 1], afss[i]); zss[i + 1] = zss[i] + 1; } else { vec fs; prime_decomp(ai, pn, pnums, fs); addvec(pn, afss[i + 1], afss[i], fs); zss[i + 1] = zss[i]; } } int q; scanf("%d", &q); while (q--) { int p, l, r; scanf("%d%d%d", &p, &l, &r); l--; if (zss[r] > zss[l]) puts("Yes"); else { vec fs, pfs; if (! prime_decomp(p, pn, pnums, pfs)) puts("NO"); else { subvec(pn, fs, afss[r], afss[l]); if (cmpvec(pn, fs, pfs)) puts("Yes"); else puts("NO"); } } } return 0; }