結果

問題 No.357 品物の並び替え (Middle)
ユーザー uwiuwi
提出日時 2016-04-01 22:37:59
言語 Java19
(openjdk 21)
結果
AC  
実行時間 65 ms / 5,000 ms
コード長 3,200 bytes
コンパイル時間 4,437 ms
コンパイル使用メモリ 77,724 KB
実行使用メモリ 51,964 KB
最終ジャッジ日時 2023-07-25 15:30:18
合計ジャッジ時間 6,166 ms
ジャッジサーバーID
(参考情報)
judge13 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
49,488 KB
testcase_01 AC 43 ms
49,216 KB
testcase_02 AC 43 ms
49,264 KB
testcase_03 AC 45 ms
49,068 KB
testcase_04 AC 44 ms
49,204 KB
testcase_05 AC 43 ms
49,604 KB
testcase_06 AC 43 ms
49,308 KB
testcase_07 AC 43 ms
49,272 KB
testcase_08 AC 44 ms
49,204 KB
testcase_09 AC 62 ms
51,228 KB
testcase_10 AC 50 ms
49,276 KB
testcase_11 AC 49 ms
49,812 KB
testcase_12 AC 65 ms
51,964 KB
testcase_13 AC 60 ms
48,648 KB
testcase_14 AC 60 ms
50,860 KB
testcase_15 AC 48 ms
49,212 KB
testcase_16 AC 53 ms
49,500 KB
testcase_17 AC 50 ms
49,064 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 Q810 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		int[][] g = new int[n][n];
		for(int i = 0;i < m;i++){
			g[ni()][ni()] = ni();
		}
		long[] dp = new long[1<<n];
		for(int i = 1;i < 1<<n;i++){
			for(int j = 0;j < n;j++){
				if(i<<~j<0){
					int plus = 0;
					for(int k = 0;k < n;k++){
						if(i<<~k<0){
							plus += g[k][j];
						}
					}
					dp[i] = Math.max(dp[i], dp[i^1<<j] + plus);
				}
			}
		}
		out.println(dp[(1<<n)-1]);
	}
	
	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 Q810().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