結果

問題 No.385 カップ麺生活
ユーザー uwiuwi
提出日時 2016-07-01 22:39:48
言語 Java21
(openjdk 21)
結果
AC  
実行時間 73 ms / 2,000 ms
コード長 4,664 bytes
コンパイル時間 3,598 ms
コンパイル使用メモリ 83,984 KB
実行使用メモリ 51,628 KB
最終ジャッジ日時 2024-10-04 22:23:53
合計ジャッジ時間 6,630 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
50,556 KB
testcase_01 AC 55 ms
50,408 KB
testcase_02 AC 56 ms
50,356 KB
testcase_03 AC 54 ms
50,900 KB
testcase_04 AC 58 ms
50,764 KB
testcase_05 AC 56 ms
50,700 KB
testcase_06 AC 61 ms
50,592 KB
testcase_07 AC 61 ms
51,152 KB
testcase_08 AC 59 ms
50,728 KB
testcase_09 AC 55 ms
50,924 KB
testcase_10 AC 73 ms
51,628 KB
testcase_11 AC 54 ms
50,592 KB
testcase_12 AC 59 ms
50,804 KB
testcase_13 AC 62 ms
50,800 KB
testcase_14 AC 66 ms
50,916 KB
testcase_15 AC 63 ms
50,924 KB
testcase_16 AC 54 ms
50,596 KB
testcase_17 AC 69 ms
51,476 KB
testcase_18 AC 59 ms
51,120 KB
testcase_19 AC 56 ms
50,948 KB
testcase_20 AC 62 ms
51,120 KB
testcase_21 AC 68 ms
51,460 KB
testcase_22 AC 64 ms
51,152 KB
testcase_23 AC 70 ms
51,300 KB
testcase_24 AC 66 ms
51,028 KB
testcase_25 AC 56 ms
50,716 KB
testcase_26 AC 58 ms
50,744 KB
testcase_27 AC 65 ms
50,980 KB
testcase_28 AC 64 ms
51,180 KB
testcase_29 AC 59 ms
50,688 KB
testcase_30 AC 66 ms
51,032 KB
testcase_31 AC 58 ms
50,856 KB
testcase_32 AC 59 ms
50,956 KB
testcase_33 AC 66 ms
50,924 KB
testcase_34 AC 60 ms
50,976 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class N385 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int[] primes = sieveEratosthenes(30000);
		
		int m = ni();
		int n = ni();
		int[] a = na(n);
		int[] dp = new int[m+1];
		Arrays.fill(dp, -999999);
		dp[0] = 0;
		for(int i = 0;i < n;i++){
			for(int j = 0;j <= m-a[i];j++){
				dp[j+a[i]] = Math.max(dp[j+a[i]], dp[j] + 1);
			}
		}
		int ret = 0;
		for(int i = 1;i <= m;i++){
			if(dp[i] >= 0 && Arrays.binarySearch(primes, m-i) >= 0){
				ret += dp[i];
			}
		}
		ret += Arrays.stream(dp).max().getAsInt();
		out.println(ret);
	}
	
	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 N385().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))){ // 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 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