結果

問題 No.951 【本日限定】１枚頼むともう１枚無料！
ユーザー uwiuwi
提出日時 2019-12-14 00:15:36
言語 Java
(openjdk 23)
結果
AC  
実行時間 575 ms / 2,000 ms
コード長 4,198 bytes
コンパイル時間 3,907 ms
コンパイル使用メモリ 80,716 KB
実行使用メモリ 44,940 KB
最終ジャッジ日時 2024-06-27 23:11:09
合計ジャッジ時間 22,620 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 52
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2019;
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 D14 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), K = ni();
		int[][] pd = new int[n][];
		for(int i = 0;i < n;i++){
			pd[i] = na(2);
		}
		
		Arrays.sort(pd, new Comparator<int[]>() {
			public int compare(int[] a, int[] b) {
				return -(a[0] - b[0]);
			}
		});
		
		// (i, j, k) = (iまでみたときj枚余裕があって、k円)
		// (j, k) -> (j+1, k+p[i]) + d[i]
		// (j, k) -> (j-1, k) + d[i]

		long[][] dp = new long[2][K+1];
		Arrays.fill(dp[0], -Long.MAX_VALUE / 3);
		Arrays.fill(dp[1], -Long.MAX_VALUE / 3);
		dp[0][0] = 0;
		for(int i = 0;i < n;i++){
			long[][] ndp = new long[2][K+1];
			Arrays.fill(ndp[0], -Long.MAX_VALUE / 3);
			Arrays.fill(ndp[1], -Long.MAX_VALUE / 3);
			for(int j = 0;j < 2;j++){
				for(int k = 0;k <= K;k++){
					ndp[j][k] = Math.max(ndp[j][k], dp[j][k]);
					if(j == 0 && k+pd[i][0] <= K){
						ndp[1][k+pd[i][0]] = Math.max(ndp[1][k+pd[i][0]], 
								dp[0][k] + pd[i][1]);
					}
					if(j == 1){
						ndp[0][k] = Math.max(ndp[0][k],
								dp[1][k] + pd[i][1]);
					}
				}
			}
			dp = ndp;
		}
		long max = 0;
		for(int i = 0;i <= K;i++){
			max = Math.max(max, dp[0][i]);
			max = Math.max(max, dp[1][i]);
		}
		out.println(max);
	}
	
	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 D14().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