結果
問題 | No.1045 直方体大学 |
ユーザー | uwi |
提出日時 | 2020-05-01 21:57:31 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 719 ms / 2,000 ms |
コード長 | 4,110 bytes |
コンパイル時間 | 4,935 ms |
コンパイル使用メモリ | 85,916 KB |
実行使用メモリ | 115,108 KB |
最終ジャッジ日時 | 2023-08-26 09:41:03 |
合計ジャッジ時間 | 11,667 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
49,200 KB |
testcase_01 | AC | 39 ms
49,348 KB |
testcase_02 | AC | 37 ms
49,576 KB |
testcase_03 | AC | 39 ms
49,276 KB |
testcase_04 | AC | 38 ms
49,276 KB |
testcase_05 | AC | 77 ms
52,520 KB |
testcase_06 | AC | 67 ms
52,016 KB |
testcase_07 | AC | 75 ms
52,416 KB |
testcase_08 | AC | 719 ms
113,676 KB |
testcase_09 | AC | 687 ms
114,560 KB |
testcase_10 | AC | 639 ms
115,108 KB |
testcase_11 | AC | 644 ms
114,528 KB |
testcase_12 | AC | 670 ms
114,652 KB |
testcase_13 | AC | 665 ms
114,684 KB |
testcase_14 | AC | 656 ms
114,568 KB |
testcase_15 | AC | 683 ms
114,664 KB |
testcase_16 | AC | 683 ms
113,160 KB |
testcase_17 | AC | 48 ms
49,132 KB |
testcase_18 | AC | 680 ms
114,664 KB |
ソースコード
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 F { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[][] ms = new int[n][]; for(int i = 0;i < n;i++) { ms[i] = na(3); } long[][][] dp = new long[1<<n][n][3]; for(int i = 0;i < 1<<n;i++) { for(int j = 0;j < n;j++) { Arrays.fill(dp[i][j], Long.MIN_VALUE / 2); } } long ans = 0; for(int i = 1;i < 1<<n;i++) { if((i&i-1) == 0) { int id = Integer.numberOfTrailingZeros(i); dp[i][id][0] = ms[id][2]; dp[i][id][1] = ms[id][0]; dp[i][id][2] = ms[id][1]; ans = Math.max(ans, ms[id][0]); ans = Math.max(ans, ms[id][1]); ans = Math.max(ans, ms[id][2]); } for(int j = 0;j < n;j++) { if(i<<~j<0) { for(int k = 0;k < n;k++) { if(i<<~k>=0) { for(int l = 0;l < 3;l++) { for(int m = 0;m < 3;m++) { int BH = ms[j][l], BW = ms[j][(l+1)%3]; int TH = ms[k][m], TW = ms[k][(m+1)%3]; if(BH >= TH && BW >= TW || BH >= TW && BW >= TH) { dp[i|1<<k][k][m] = Math.max(dp[i|1<<k][k][m], dp[i][j][l] + ms[k][(m+2)%3]); ans = Math.max(ans, dp[i|1<<k][k][m]); } } } } } } } } out.println(ans); } 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)); } }