結果
問題 | No.1792 科学の甲子園 |
ユーザー | tenten |
提出日時 | 2023-07-20 09:23:52 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 153 ms / 4,000 ms |
コード長 | 3,195 bytes |
コンパイル時間 | 2,823 ms |
コンパイル使用メモリ | 89,292 KB |
実行使用メモリ | 57,088 KB |
最終ジャッジ日時 | 2023-08-17 18:44:35 |
合計ジャッジ時間 | 6,219 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
49,452 KB |
testcase_01 | AC | 51 ms
49,520 KB |
testcase_02 | AC | 48 ms
49,584 KB |
testcase_03 | AC | 48 ms
49,580 KB |
testcase_04 | AC | 49 ms
50,008 KB |
testcase_05 | AC | 48 ms
49,452 KB |
testcase_06 | AC | 47 ms
49,600 KB |
testcase_07 | AC | 46 ms
49,544 KB |
testcase_08 | AC | 70 ms
51,324 KB |
testcase_09 | AC | 71 ms
51,640 KB |
testcase_10 | AC | 49 ms
49,724 KB |
testcase_11 | AC | 135 ms
55,388 KB |
testcase_12 | AC | 105 ms
53,056 KB |
testcase_13 | AC | 128 ms
57,088 KB |
testcase_14 | AC | 149 ms
55,580 KB |
testcase_15 | AC | 111 ms
53,404 KB |
testcase_16 | AC | 49 ms
49,524 KB |
testcase_17 | AC | 49 ms
49,428 KB |
testcase_18 | AC | 48 ms
49,512 KB |
testcase_19 | AC | 110 ms
53,276 KB |
testcase_20 | AC | 153 ms
55,484 KB |
testcase_21 | AC | 99 ms
53,340 KB |
testcase_22 | AC | 130 ms
55,556 KB |
testcase_23 | AC | 117 ms
53,100 KB |
testcase_24 | AC | 48 ms
49,484 KB |
testcase_25 | AC | 47 ms
49,560 KB |
testcase_26 | AC | 48 ms
49,580 KB |
testcase_27 | AC | 130 ms
55,232 KB |
testcase_28 | AC | 144 ms
55,544 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { static Student[] students; static long[][][] dp; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); students = new Student[n]; for (int i = 0; i < n; i++) { int[] tmp = new int[6]; for (int j = 0; j < 6; j++) { tmp[j] = sc.nextInt(); } students[i] = new Student(tmp); } dp = new long[n][4][1 << 6]; for (long[][] arr : dp) { for (long[] arr2 : arr) { Arrays.fill(arr2, -1); } } System.out.println(dfw(n - 1, 3, (1 << 6) - 1)); } static long dfw(int idx, int w, int v) { if (v == 0) { return 1; } if (idx < 0 || w < 0) { return 0; } if (dp[idx][w][v] < 0) { dp[idx][w][v] = dfw(idx - 1, w, v); for (int i = v; i > 0; i = ((i - 1) & v)) { if ((i & v) != i) { continue; } dp[idx][w][v] = Math.max(dp[idx][w][v], students[idx].points[i] * dfw(idx - 1, w - 1, v ^ i)); } } return dp[idx][w][v]; } static class Student { int[] values; long[] points; public Student(int[] values) { this.values = values; init(); } private void init() { points = new long[1 << 6]; points[0] = 1; for (int i = 1; i < (1 << 6); i++) { for (int j = 0; j < 6; j++) { if ((i & (1 << j)) == 0) { continue; } points[i] = points[i ^ (1 << j)] * values[j]; break; } } } } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }