結果
| 問題 |
No.854 公平なりんご分配
|
| コンテスト | |
| ユーザー |
 uwi
|
| 提出日時 | 2019-07-26 22:07:08 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 1,636 ms / 3,153 ms |
| コード長 | 7,802 bytes |
| コンパイル時間 | 4,591 ms |
| コンパイル使用メモリ | 83,676 KB |
| 実行使用メモリ | 131,352 KB |
| 最終ジャッジ日時 | 2024-07-02 07:26:28 |
| 合計ジャッジ時間 | 36,914 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 92 |
ソースコード
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)); }
}