結果

問題 No.626 Randomized 01 Knapsack
ユーザー uwiuwi
提出日時 2017-12-16 00:56:58
言語 Java21
(openjdk 21)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,150 bytes
コンパイル時間 4,130 ms
コンパイル使用メモリ 81,484 KB
実行使用メモリ 445,616 KB
最終ジャッジ日時 2023-08-22 03:38:32
合計ジャッジ時間 30,975 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 401 ms
445,616 KB
testcase_01 AC 1,187 ms
431,892 KB
testcase_02 AC 1,300 ms
242,580 KB
testcase_03 AC 407 ms
129,368 KB
testcase_04 AC 1,151 ms
129,724 KB
testcase_05 AC 191 ms
92,304 KB
testcase_06 TLE -
testcase_07 AC 641 ms
63,824 KB
testcase_08 AC 1,843 ms
63,988 KB
testcase_09 AC 505 ms
56,484 KB
testcase_10 AC 1,198 ms
56,808 KB
testcase_11 AC 1,694 ms
55,144 KB
testcase_12 AC 1,065 ms
54,884 KB
testcase_13 AC 136 ms
54,764 KB
testcase_14 AC 444 ms
54,744 KB
testcase_15 WA -
testcase_16 AC 1,005 ms
54,716 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 1,136 ms
52,928 KB
testcase_21 AC 138 ms
54,612 KB
testcase_22 AC 1,354 ms
54,852 KB
testcase_23 AC 995 ms
54,700 KB
testcase_24 AC 94 ms
54,852 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package yukicoder;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Random;

public class N626_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		long W = nl();
		long[][] vw = new long[n][];
		for(int i = 0;i < n;i++){
			vw[i] = new long[]{nl(), nl()};
		}
		// nt = 10^7
		// t = 10^7/n
		// W->t 
		W++;
		long t = Math.min(50000000, 1200000000/n);
		for(int i = 0;i < n;i++){
			vw[i][1] = BigInteger.valueOf(vw[i][1]).multiply(
					BigInteger.valueOf(t)).add(BigInteger.valueOf(W-1)).divide(BigInteger.valueOf(W)).longValue();
		}
		long[] dp = new long[(int)t];
		for(long[] item : vw){
			for(int i = (int)(t-1-item[1]);i >= 0;i--){
				dp[(int)(i+item[1])] = Math.max(
						dp[(int)(i+item[1])], dp[i] + item[0]);
			}
		}
		long ans = 0;
		for(long v : dp){
			ans = Math.max(ans, v);
		}
		out.println(ans);
	}
	
	long big(Random gen)
	{
		return Math.abs(gen.nextLong() % 1000000000000L) + 1;
	}
	
	void run() throws Exception
	{
//		int n = 5000, m = 99999;
//		Random gen = new Random(1);
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		sb.append(big(gen) + " ");
//		for (int i = 0; i < n; i++) {
//			sb.append(big(gen) + " ");
//			sb.append(big(gen) + "\n");
//		}
//		INPUT = sb.toString();

		
		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 N626_2().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)); }
}
0