結果
問題 | No.2423 Merge Stones |
ユーザー |
![]() |
提出日時 | 2023-08-12 16:11:26 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 573 ms / 4,000 ms |
コード長 | 3,156 bytes |
コンパイル時間 | 2,911 ms |
コンパイル使用メモリ | 78,056 KB |
実行使用メモリ | 42,948 KB |
最終ジャッジ日時 | 2024-11-20 05:11:10 |
合計ジャッジ時間 | 32,301 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 72 |
ソースコード
import java.util.*;import java.io.*;@SuppressWarnings("unused")public class Main {private static void solve() {int n = ni() * 2;int k = ni();int[] a = new int[n];int[] c = new int[n];for (int i = 0; i < n / 2; i++) {a[i] = a[i + n / 2] = ni();}for (int i = 0; i < n / 2; i++) {c[i] = c[i + n / 2] = ni();}long[][] dp = new long[n][n + 1];long ret = 0;for (int len = 1; len <= n / 2; len++) {for (int l = 0; l < n; l++) {int r = l + len;if (r > n)continue;if (len == 1) {dp[l][r] = 1L << c[l];} else {for (int j = l + 1; j < r; j++) {for (int d = 0; d <= k; d++) {dp[l][r] |= dp[l][j] & (dp[j][r] << d);dp[l][r] |= dp[l][j] & (dp[j][r] >> d);dp[l][r] |= (dp[l][j] << d) & dp[j][r];dp[l][r] |= (dp[l][j] >> d) & dp[j][r];}}}}}for (int l = 0; l < n; l++) {for (int r = l + 1; r <= n; r++) {long cur = 0;if (Long.bitCount(dp[l][r]) > 0) {for (int s = l; s < r; s++) {cur += a[s];}ret = Math.max(ret, cur);}}}// 28 11 32 60 53 6 28 96 8 23 19 76 62 76// 19 5 3 11 14 5 3 19 10 10 16 13 3 8//System.out.println(Arrays.deepToString(dp));System.out.println(ret);}public static void main(String[] args) {new Thread(null, new Runnable() {@Overridepublic void run() {solve();out.flush();}}, "", 64000000).start();}private static PrintWriter out = new PrintWriter(System.out);private static StringTokenizer tokenizer = null;private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 32768);public static String next() {while (tokenizer == null || !tokenizer.hasMoreTokens()) {try {tokenizer = new java.util.StringTokenizer(reader.readLine());} catch (Exception e) {throw new RuntimeException(e);}}return tokenizer.nextToken();}private static double nd() {return Double.parseDouble(next());}private static long nl() {return Long.parseLong(next());}private static int[] na(int n) {int[] a = new int[n];for (int i = 0; i < n; i++)a[i] = ni();return a;}private static char[] ns() {return next().toCharArray();}private static long[] nal(int n) {long[] a = new long[n];for (int i = 0; i < n; i++)a[i] = nl();return a;}private static int[][] ntable(int n, int m) {int[][] table = new int[n][m];for (int i = 0; i < n; i++) {for (int j = 0; j < m; j++) {table[i][j] = ni();}}return table;}private static int[][] nlist(int n, int m) {int[][] table = new int[m][n];for (int i = 0; i < n; i++) {for (int j = 0; j < m; j++) {table[j][i] = ni();}}return table;}private static int ni() {return Integer.parseInt(next());}}