結果

問題 No.854 公平なりんご分配
ユーザー ziitaziita
提出日時 2019-07-26 22:40:47
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 7,109 bytes
コンパイル時間 2,476 ms
コンパイル使用メモリ 86,684 KB
実行使用メモリ 326,772 KB
最終ジャッジ日時 2024-07-02 08:09:53
合計ジャッジ時間 23,816 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
50,112 KB
testcase_01 AC 49 ms
49,992 KB
testcase_02 AC 51 ms
50,072 KB
testcase_03 AC 48 ms
50,092 KB
testcase_04 AC 51 ms
50,240 KB
testcase_05 AC 51 ms
50,260 KB
testcase_06 AC 48 ms
49,992 KB
testcase_07 AC 48 ms
50,228 KB
testcase_08 AC 48 ms
50,184 KB
testcase_09 AC 51 ms
49,996 KB
testcase_10 AC 51 ms
50,016 KB
testcase_11 AC 51 ms
50,200 KB
testcase_12 AC 50 ms
50,224 KB
testcase_13 AC 50 ms
49,968 KB
testcase_14 AC 48 ms
50,164 KB
testcase_15 AC 49 ms
50,124 KB
testcase_16 AC 48 ms
50,016 KB
testcase_17 AC 49 ms
49,860 KB
testcase_18 AC 48 ms
50,212 KB
testcase_19 AC 50 ms
50,012 KB
testcase_20 AC 48 ms
49,824 KB
testcase_21 AC 48 ms
50,036 KB
testcase_22 AC 72 ms
50,640 KB
testcase_23 AC 74 ms
50,880 KB
testcase_24 AC 94 ms
54,220 KB
testcase_25 AC 73 ms
50,500 KB
testcase_26 AC 99 ms
54,452 KB
testcase_27 AC 91 ms
54,028 KB
testcase_28 AC 68 ms
50,844 KB
testcase_29 AC 62 ms
50,280 KB
testcase_30 AC 70 ms
50,884 KB
testcase_31 AC 92 ms
54,396 KB
testcase_32 AC 216 ms
107,724 KB
testcase_33 AC 223 ms
80,152 KB
testcase_34 AC 302 ms
121,504 KB
testcase_35 AC 243 ms
111,592 KB
testcase_36 AC 165 ms
58,464 KB
testcase_37 AC 208 ms
93,040 KB
testcase_38 AC 217 ms
86,452 KB
testcase_39 AC 339 ms
125,028 KB
testcase_40 AC 214 ms
79,260 KB
testcase_41 AC 251 ms
93,640 KB
testcase_42 AC 285 ms
120,148 KB
testcase_43 AC 275 ms
105,672 KB
testcase_44 AC 295 ms
116,640 KB
testcase_45 AC 296 ms
68,328 KB
testcase_46 AC 314 ms
119,056 KB
testcase_47 AC 231 ms
84,608 KB
testcase_48 AC 268 ms
115,816 KB
testcase_49 AC 243 ms
116,188 KB
testcase_50 AC 208 ms
93,076 KB
testcase_51 AC 343 ms
119,564 KB
testcase_52 RE -
testcase_53 RE -
testcase_54 RE -
testcase_55 RE -
testcase_56 RE -
testcase_57 RE -
testcase_58 RE -
testcase_59 RE -
testcase_60 RE -
testcase_61 RE -
testcase_62 RE -
testcase_63 RE -
testcase_64 RE -
testcase_65 RE -
testcase_66 RE -
testcase_67 RE -
testcase_68 RE -
testcase_69 RE -
testcase_70 RE -
testcase_71 RE -
testcase_72 RE -
testcase_73 RE -
testcase_74 RE -
testcase_75 RE -
testcase_76 RE -
testcase_77 RE -
testcase_78 RE -
testcase_79 RE -
testcase_80 RE -
testcase_81 RE -
testcase_82 RE -
testcase_83 MLE -
testcase_84 MLE -
testcase_85 MLE -
testcase_86 MLE -
testcase_87 RE -
testcase_88 RE -
testcase_89 RE -
testcase_90 RE -
testcase_91 RE -
testcase_92 MLE -
testcase_93 MLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    // static int mod = 1_000_000_007;
    int mod = 998244353;
    // long inf = Long.MAX_VALUE/2;
    int inf = Integer.MAX_VALUE/2;

    void solve(){
        int n = ni();
        int[] a = new int[n];
        for(int i = 0; i < n; i++){
            a[i] = ni();
        }
        int[] primes = sieveEratosthenes(3000);
        HashMap<Integer, Integer> map = new HashMap<>();
        for(int i = 0; i < primes.length; i++){
            // System.err.println(primes[i]);
            map.put(primes[i],i);
        }
        int[][] cum = new int[n+1][primes.length];
        int[] zeros = new int[n+1];
        for(int i = 0; i < n; i++){
            int[][] ret = factor(a[i],primes);
            for(int j = 0; j < primes.length; j++){
                cum[i+1][j] = cum[i][j];
            }
            zeros[i+1] = zeros[i];
            if(a[i]==0){
                zeros[i+1]++;
                continue;
            }
            for(int j = 0; j < ret.length; j++){
                cum[i+1][map.get(ret[j][0])] += ret[j][1];
                // out.println(ret[j][0]+" "+ret[j][1]+" "+cum[i+1][map.get(ret[j][0])]);
            }
        }
        int q = ni();
        outer:
        for(int i = 0; i < q; i++){
            int p = ni();
            int l = ni()-1;
            int r = ni()-1;
            int[][] tmp1 = factor(p,primes);
            for(int j = 0; j < tmp1.length; j++){
                int z = zeros[r+1] - zeros[l];
                if(tmp1[j][0]>=2000 && z==0){
                    out.println("NO");
                    continue outer;
                }
                int s = tmp1[j][1];
                int t = cum[r+1][map.get(tmp1[j][0])] - cum[l][map.get(tmp1[j][0])];
                // out.println(s+" "+t+" "+tmp1[j][0]);
                if(s>t && z==0){
                    out.println("NO");
                    continue outer;
                }
            }      
            out.println("Yes");      
        }
    }

    public static int[][] factor(int n, int[] primes)
    {
        int[][] ret = new int[10][2];
        int rp = 0;
        for(int p : primes){
            if(p * p > n)break;
            int i;
            for(i = 0;n % p == 0;n /= p, i++);
            if(i > 0){
                ret[rp][0] = p;
                ret[rp][1] = i;
                rp++;
            }
        }
        if(n != 1){
            ret[rp][0] = n;
            ret[rp][1] = 1;
            rp++;
        }
        return Arrays.copyOf(ret, rp);
    }

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);
	}

    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");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private 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) && 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 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[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, 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 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)); }
 
}
0