結果
問題 | No.854 公平なりんご分配 |
ユーザー | uwi |
提出日時 | 2019-07-26 22:07:08 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,705 ms / 3,153 ms |
コード長 | 7,802 bytes |
コンパイル時間 | 5,943 ms |
コンパイル使用メモリ | 80,664 KB |
実行使用メモリ | 131,216 KB |
最終ジャッジ日時 | 2023-09-15 01:39:15 |
合計ジャッジ時間 | 39,552 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
49,664 KB |
testcase_01 | AC | 42 ms
49,508 KB |
testcase_02 | AC | 43 ms
49,392 KB |
testcase_03 | AC | 43 ms
49,384 KB |
testcase_04 | AC | 43 ms
49,536 KB |
testcase_05 | AC | 43 ms
49,488 KB |
testcase_06 | AC | 43 ms
49,504 KB |
testcase_07 | AC | 43 ms
49,300 KB |
testcase_08 | AC | 43 ms
49,488 KB |
testcase_09 | AC | 44 ms
49,492 KB |
testcase_10 | AC | 43 ms
49,304 KB |
testcase_11 | AC | 44 ms
49,836 KB |
testcase_12 | AC | 44 ms
49,432 KB |
testcase_13 | AC | 43 ms
49,628 KB |
testcase_14 | AC | 43 ms
49,464 KB |
testcase_15 | AC | 42 ms
49,448 KB |
testcase_16 | AC | 43 ms
49,564 KB |
testcase_17 | AC | 44 ms
49,460 KB |
testcase_18 | AC | 44 ms
49,544 KB |
testcase_19 | AC | 44 ms
49,732 KB |
testcase_20 | AC | 44 ms
49,596 KB |
testcase_21 | AC | 44 ms
49,796 KB |
testcase_22 | AC | 75 ms
51,304 KB |
testcase_23 | AC | 59 ms
51,824 KB |
testcase_24 | AC | 92 ms
51,140 KB |
testcase_25 | AC | 55 ms
51,664 KB |
testcase_26 | AC | 82 ms
51,176 KB |
testcase_27 | AC | 76 ms
49,716 KB |
testcase_28 | AC | 79 ms
51,624 KB |
testcase_29 | AC | 51 ms
47,820 KB |
testcase_30 | AC | 57 ms
51,132 KB |
testcase_31 | AC | 90 ms
51,476 KB |
testcase_32 | AC | 234 ms
57,560 KB |
testcase_33 | AC | 242 ms
58,400 KB |
testcase_34 | AC | 355 ms
60,168 KB |
testcase_35 | AC | 286 ms
60,644 KB |
testcase_36 | AC | 235 ms
57,008 KB |
testcase_37 | AC | 222 ms
57,740 KB |
testcase_38 | AC | 176 ms
57,956 KB |
testcase_39 | AC | 447 ms
65,200 KB |
testcase_40 | AC | 255 ms
58,120 KB |
testcase_41 | AC | 266 ms
58,244 KB |
testcase_42 | AC | 324 ms
60,900 KB |
testcase_43 | AC | 386 ms
62,692 KB |
testcase_44 | AC | 371 ms
60,796 KB |
testcase_45 | AC | 387 ms
60,256 KB |
testcase_46 | AC | 430 ms
64,712 KB |
testcase_47 | AC | 231 ms
58,228 KB |
testcase_48 | AC | 287 ms
60,564 KB |
testcase_49 | AC | 340 ms
60,944 KB |
testcase_50 | AC | 197 ms
57,400 KB |
testcase_51 | AC | 460 ms
64,940 KB |
testcase_52 | AC | 408 ms
63,652 KB |
testcase_53 | AC | 277 ms
58,284 KB |
testcase_54 | AC | 406 ms
62,584 KB |
testcase_55 | AC | 234 ms
60,776 KB |
testcase_56 | AC | 187 ms
57,976 KB |
testcase_57 | AC | 250 ms
60,016 KB |
testcase_58 | AC | 381 ms
60,020 KB |
testcase_59 | AC | 186 ms
57,344 KB |
testcase_60 | AC | 292 ms
58,704 KB |
testcase_61 | AC | 216 ms
57,896 KB |
testcase_62 | AC | 351 ms
60,248 KB |
testcase_63 | AC | 310 ms
60,244 KB |
testcase_64 | AC | 178 ms
57,548 KB |
testcase_65 | AC | 280 ms
60,160 KB |
testcase_66 | AC | 243 ms
58,120 KB |
testcase_67 | AC | 357 ms
60,760 KB |
testcase_68 | AC | 348 ms
60,624 KB |
testcase_69 | AC | 223 ms
60,868 KB |
testcase_70 | AC | 221 ms
58,260 KB |
testcase_71 | AC | 217 ms
57,848 KB |
testcase_72 | AC | 287 ms
60,176 KB |
testcase_73 | AC | 283 ms
58,196 KB |
testcase_74 | AC | 421 ms
62,652 KB |
testcase_75 | AC | 253 ms
57,992 KB |
testcase_76 | AC | 385 ms
62,400 KB |
testcase_77 | AC | 335 ms
60,936 KB |
testcase_78 | AC | 406 ms
60,296 KB |
testcase_79 | AC | 421 ms
62,352 KB |
testcase_80 | AC | 391 ms
62,176 KB |
testcase_81 | AC | 305 ms
60,700 KB |
testcase_82 | AC | 713 ms
68,008 KB |
testcase_83 | AC | 1,705 ms
131,216 KB |
testcase_84 | AC | 1,145 ms
93,612 KB |
testcase_85 | AC | 561 ms
67,596 KB |
testcase_86 | AC | 342 ms
62,076 KB |
testcase_87 | AC | 1,276 ms
90,024 KB |
testcase_88 | AC | 1,232 ms
90,036 KB |
testcase_89 | AC | 1,236 ms
89,456 KB |
testcase_90 | AC | 1,189 ms
89,804 KB |
testcase_91 | AC | 1,291 ms
89,192 KB |
testcase_92 | AC | 1,058 ms
88,552 KB |
testcase_93 | AC | 1,320 ms
89,632 KB |
ソースコード
package contest190726; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.Comparator; import java.util.InputMismatchException; // クソデカため息 public class D { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[] a = na(n); int Q = ni(); int[][] qs = new int[Q*13][]; int[] lpf = enumLowestPrimeFactors(2001); int[] zero = new int[n+5]; for(int i = 0;i < n;i++) { if(a[i] == 0) { addFenwick(zero, i, 1); } } boolean[] anss = new boolean[Q]; Arrays.fill(anss, true); int[] primes = sieveEratosthenes(2001); int o = 0; for(int i = 0;i < Q;i++) { int val = ni(); int l = ni()-1; int r = ni()-1; for(int p : primes) { int e = 0; while(val % p == 0) { val /= p; e++; } if(e > 0) { qs[o++] = new int[] {p, e, l, r, i}; } } if(val != 1 && sumFenwick(zero, r) - sumFenwick(zero, l-1) == 0)anss[i] = false; } qs = Arrays.copyOf(qs, o); Arrays.sort(qs, new Comparator<int[]>() { public int compare(int[] a, int[] b) { return a[0] - b[0]; } }); int[][] ss = new int[n*7][]; int p = 0; for(int i = 0;i <n;i++) { if(a[i] == 0)continue; int[][] ff = factorFast(a[i], lpf); for(int[] f : ff) { ss[p++] = new int[] {f[0], f[1], i}; } } ss = Arrays.copyOf(ss, p); Arrays.sort(ss, new Comparator<int[]>() { public int compare(int[] a, int[] b) { return a[0] - b[0]; } }); int sp = 0, qp = 0; int[] ft = new int[n+5]; for(int i = 0;i < n;i++) { if(a[i] == 0) { addFenwick(ft, i, 99); } } for(int i = 1;i <= 2000;i++) { while(sp < p && ss[sp][0] < i)sp++; int nsp = sp; while(nsp < p && ss[nsp][0] == i) { addFenwick(ft, ss[nsp][2], ss[nsp][1]); nsp++; } while(qp < qs.length && qs[qp][0] == i) { int s = sumFenwick(ft, qs[qp][3]) - sumFenwick(ft, qs[qp][2]-1); if(s < qs[qp][1]) { anss[qs[qp][4]] = false; } qp++; } while(sp < nsp) { addFenwick(ft, ss[sp][2], -ss[sp][1]); sp++; } } for(boolean b : anss) { out.println(b ? "Yes" : "NO"); } } public static int[] sieveEratosthenes(int n) { if (n <= 32) { int[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 }; for (int i = 0; i < primes.length; i++) { if (n < primes[i]) { return Arrays.copyOf(primes, i); } } return primes; } int u = n + 32; double lu = Math.log(u); int[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)]; ret[0] = 2; int pos = 1; int[] isnp = new int[(n + 1) / 32 / 2 + 1]; int sup = (n + 1) / 32 / 2 + 1; int[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 }; for (int tp : tprimes) { ret[pos++] = tp; int[] ptn = new int[tp]; for (int i = (tp - 3) / 2; i < tp << 5; i += tp) ptn[i >> 5] |= 1 << (i & 31); for (int j = 0; j < sup; j += tp) { for (int i = 0; i < tp && i + j < sup; i++) { isnp[j + i] |= ptn[i]; } } } // 3,5,7 // 2x+3=n int[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17, 9, 6, 16, 5, 15, 14 }; int h = n / 2; for (int i = 0; i < sup; i++) { for (int j = ~isnp[i]; j != 0; j &= j - 1) { int pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27]; int p = 2 * pp + 3; if (p > n) break; ret[pos++] = p; if ((long) p * p > n) continue; for (int q = (p * p - 3) / 2; q <= h; q += p) isnp[q >> 5] |= 1 << q; } } return Arrays.copyOf(ret, pos); } public static int[][] factorFast(int n, int[] lpf) { int[][] f = new int[9][]; int q = 0; while(lpf[n] > 0){ int p = lpf[n]; if(q == 0 || p != f[q-1][0]){ f[q++] = new int[]{p, 1}; }else{ f[q-1][1]++; } n /= p; } if(n > 1){ // big prime return new int[][]{{n, 1}}; } return Arrays.copyOf(f, q); } public static int sumFenwick(int[] ft, int i) { int sum = 0; for(i++;i > 0;i -= i&-i)sum += ft[i]; return sum; } public static void addFenwick(int[] ft, int i, int v) { if(v == 0 || i < 0)return; int n = ft.length; for(i++;i < n;i += i&-i)ft[i] += v; } public static int[] enumDivisorsFast(int n, int[] lpf) { int[] divs = {1}; while(lpf[n] > 0){ int p = lpf[n]; int e = 0; for(;p == lpf[n];e++, n /= p); int olen = divs.length; divs = Arrays.copyOf(divs, olen*(e+1)); for(int i = olen;i < divs.length;i++)divs[i] = divs[i-olen] * p; } return divs; } public static int[] enumLowestPrimeFactors(int n) { int tot = 0; int[] lpf = new int[n + 1]; int u = n + 32; double lu = Math.log(u); int[] primes = new int[(int) (u / lu + u / lu / lu * 1.5)]; for (int i = 2; i <= n; i++) lpf[i] = i; for (int p = 2; p <= n; p++) { if (lpf[p] == p) primes[tot++] = p; int tmp; for (int i = 0; i < tot && primes[i] <= lpf[p] && (tmp = primes[i] * p) <= n; i++) { lpf[tmp] = primes[i]; } } return lpf; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new D().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }