#362781 (Java21) No.854 公平なりんご分配

提出ソース

結果

問題	No.854 公平なりんご分配
ユーザー	ziita
提出日時	2019-07-26 22:45:16
言語	Java21 (openjdk 21)
結果	MLE (最新) AC (最初)
実行時間	-
コード長	7,124 bytes
コンパイル時間	2,411 ms
コンパイル使用メモリ	84,004 KB
実行使用メモリ	326,160 KB
最終ジャッジ日時	2024-07-02 08:41:11
合計ジャッジ時間	28,369 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	51 ms 49,836 KB
testcase_01	AC	50 ms 50,196 KB
testcase_02	AC	51 ms 50,156 KB
testcase_03	AC	50 ms 50,084 KB
testcase_04	AC	51 ms 50,136 KB
testcase_05	AC	51 ms 49,904 KB
testcase_06	AC	52 ms 50,256 KB
testcase_07	AC	53 ms 49,848 KB
testcase_08	AC	53 ms 50,328 KB
testcase_09	AC	53 ms 50,264 KB
testcase_10	AC	55 ms 50,324 KB
testcase_11	AC	52 ms 49,812 KB
testcase_12	AC	54 ms 50,304 KB
testcase_13	AC	53 ms 50,016 KB
testcase_14	AC	54 ms 50,408 KB
testcase_15	AC	52 ms 50,252 KB
testcase_16	AC	53 ms 50,348 KB
testcase_17	AC	53 ms 50,224 KB
testcase_18	AC	54 ms 49,896 KB
testcase_19	AC	53 ms 50,252 KB
testcase_20	AC	54 ms 49,856 KB
testcase_21	AC	53 ms 50,400 KB
testcase_22	AC	78 ms 50,884 KB
testcase_23	AC	76 ms 51,888 KB
testcase_24	AC	98 ms 54,260 KB
testcase_25	AC	61 ms 50,440 KB
testcase_26	AC	100 ms 54,092 KB
testcase_27	AC	94 ms 54,324 KB
testcase_28	AC	67 ms 50,228 KB
testcase_29	AC	57 ms 50,244 KB
testcase_30	AC	73 ms 50,384 KB
testcase_31	AC	99 ms 54,404 KB
testcase_32	AC	228 ms 107,656 KB
testcase_33	AC	250 ms 80,552 KB
testcase_34	AC	324 ms 121,768 KB
testcase_35	AC	260 ms 111,840 KB
testcase_36	AC	182 ms 59,400 KB
testcase_37	AC	219 ms 93,236 KB
testcase_38	AC	209 ms 86,716 KB
testcase_39	AC	365 ms 125,176 KB
testcase_40	AC	232 ms 79,348 KB
testcase_41	AC	250 ms 92,420 KB
testcase_42	AC	304 ms 120,152 KB
testcase_43	AC	301 ms 105,960 KB
testcase_44	AC	314 ms 116,296 KB
testcase_45	AC	264 ms 71,180 KB
testcase_46	AC	348 ms 118,540 KB
testcase_47	AC	234 ms 84,884 KB
testcase_48	AC	284 ms 115,868 KB
testcase_49	AC	281 ms 116,016 KB
testcase_50	AC	210 ms 92,928 KB
testcase_51	AC	360 ms 119,492 KB
testcase_52	AC	308 ms 83,296 KB
testcase_53	AC	251 ms 80,480 KB
testcase_54	AC	298 ms 89,400 KB
testcase_55	AC	212 ms 77,640 KB
testcase_56	AC	207 ms 78,840 KB
testcase_57	AC	225 ms 79,568 KB
testcase_58	AC	255 ms 63,788 KB
testcase_59	AC	186 ms 76,560 KB
testcase_60	AC	251 ms 81,580 KB
testcase_61	AC	160 ms 59,420 KB
testcase_62	AC	250 ms 74,164 KB
testcase_63	AC	243 ms 79,332 KB
testcase_64	AC	186 ms 60,696 KB
testcase_65	AC	294 ms 116,432 KB
testcase_66	AC	211 ms 70,184 KB
testcase_67	AC	305 ms 94,636 KB
testcase_68	AC	245 ms 70,652 KB
testcase_69	AC	316 ms 124,544 KB
testcase_70	AC	199 ms 77,008 KB
testcase_71	AC	206 ms 79,088 KB
testcase_72	AC	214 ms 59,468 KB
testcase_73	AC	290 ms 106,700 KB
testcase_74	AC	385 ms 114,896 KB
testcase_75	AC	220 ms 80,712 KB
testcase_76	AC	333 ms 108,648 KB
testcase_77	AC	378 ms 119,948 KB
testcase_78	AC	276 ms 79,692 KB
testcase_79	AC	315 ms 97,716 KB
testcase_80	AC	305 ms 102,452 KB
testcase_81	AC	286 ms 95,980 KB
testcase_82	MLE	-
testcase_83	MLE	-
testcase_84	MLE	-
testcase_85	MLE	-
testcase_86	MLE	-
testcase_87	MLE	-
testcase_88	MLE	-
testcase_89	MLE	-
testcase_90	MLE	-
testcase_91	MLE	-
testcase_92	MLE	-
testcase_93	MLE	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

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(z>0) break;
                if(tmp1[j][0]>=2000){
                    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){
                    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)); }
 
}

yukicoder

結果

テストケース

ソースコード