結果

問題 No.974 最後の日までに
コンテスト
ユーザー uwi
提出日時 2020-01-17 22:09:54
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,385 ms / 2,000 ms
コード長 5,615 bytes
コンパイル時間 4,639 ms
コンパイル使用メモリ 83,596 KB
実行使用メモリ 68,860 KB
最終ジャッジ日時 2024-10-04 01:35:48
合計ジャッジ時間 47,443 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 49
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200117;
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 F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		// S -> D -> A* -> S
		int n = ni();
		if(n == 1) {
			out.println(0);
			return;
		}
		long[] a = new long[n];
		long[] b = new long[n];
		long[] c = new long[n];
		for(int i = 0;i < n;i++) {
			a[i] = nl();
			b[i] = nl();
			c[i] = nl();
		}
		
		long D = 0;
		for(int i = 0;i < n;i++)D += a[i];
		
		int H = n/2;
		int ct = 0;
		
		long[][] pre = new long[300000][];
		int p = 0;
		outer:
		for(int i = 0;i < 1<<H;) {
			for(int j = 0;j < H-1;j++) {
				if(((i>>>j)&3) == 3){
					i += 1<<j;
					continue outer;
				}
			}
			
			long bsum = 0;
			long csum = 0;
			for(int j = 0;j < H;j++) {
				if(i<<~j<0) {
					bsum += b[j];
					csum += a[j] + a[j-1] + c[j];
				}
			}
			
			pre[p++] = new long[] {bsum, csum};
			
			i += 2;
		}
		pre = Arrays.copyOf(pre, p);
		Arrays.sort(pre, new Comparator<long[]>() {
			public int compare(long[] a, long[] b) {
				return Long.compare(a[1], b[1]);
			}
		});
		for(int i = 1;i < p;i++) {
			pre[i][0] = Math.max(pre[i][0], pre[i-1][0]);
		}
		
		long[][] preq = new long[300000][];
		int Q = H-1;
		p = 0;
		outer:
		for(int i = 0;i < 1<<Q;) {
			for(int j = 0;j < Q-1;j++) {
				if(((i>>>j)&3) == 3){
					i += 1<<j;
					continue outer;
				}
			}
			
			long bsum = 0;
			long csum = 0;
			for(int j = 0;j < Q;j++) {
				if(i<<~j<0) {
					bsum += b[j];
					csum += a[j] + a[j-1] + c[j];
				}
			}
			
			preq[p++] = new long[] {bsum, csum};
			
			i += 2;
		}
		
		preq = Arrays.copyOf(preq, p);
		Arrays.sort(preq, new Comparator<long[]>() {
			public int compare(long[] a, long[] b) {
				return Long.compare(a[1], b[1]);
			}
		});
		for(int i = 1;i < p;i++) {
			preq[i][0] = Math.max(preq[i][0], preq[i-1][0]);
		}
		
		long ans = 0;
		outer:
		for(int i = 0;i < 1<<n-H;) {
			for(int j = 0;j < n-H-1;j++) {
				if(((i>>>j)&3) == 3){
					i += 1<<j;
					continue outer;
				}
			}
			
			long bsum = 0;
			long csum = 0;
			for(int j = 0;j < n-H;j++) {
				if(i<<~j<0) {
					bsum += b[j+H];
					csum += a[j+H] + a[j-1+H] + c[j+H];
				}
			}
			
			if((i&1) == 1) {
				int ind = lowerBound(preq, 1, D - csum + 1) - 1;
				if(ind >= 0) {
					ans = Math.max(ans, preq[ind][0] + bsum);
				}
			}else {
				int ind = lowerBound(pre, 1, D - csum + 1) - 1;
				if(ind >= 0) {
					ans = Math.max(ans, pre[ind][0] + bsum);
				}
			}
			
			i++;
		}
		
		out.println(ans);
	}
	
	public static int lowerBound(long[][] a, int ind, long v)
	{
		int low = -1, high = a.length;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h][ind] >= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}

	
	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 F().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