結果
問題 | No.2423 Merge Stones |
ユーザー | 遭難者 |
提出日時 | 2023-08-12 14:41:59 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 584 ms / 4,000 ms |
コード長 | 22,113 bytes |
コンパイル時間 | 3,526 ms |
コンパイル使用メモリ | 89,360 KB |
実行使用メモリ | 56,580 KB |
最終ジャッジ日時 | 2024-11-19 20:59:50 |
合計ジャッジ時間 | 33,767 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
52,336 KB |
testcase_01 | AC | 60 ms
52,340 KB |
testcase_02 | AC | 57 ms
52,144 KB |
testcase_03 | AC | 58 ms
52,476 KB |
testcase_04 | AC | 56 ms
52,308 KB |
testcase_05 | AC | 56 ms
51,844 KB |
testcase_06 | AC | 57 ms
52,180 KB |
testcase_07 | AC | 55 ms
51,920 KB |
testcase_08 | AC | 56 ms
52,068 KB |
testcase_09 | AC | 55 ms
52,036 KB |
testcase_10 | AC | 56 ms
52,344 KB |
testcase_11 | AC | 560 ms
54,712 KB |
testcase_12 | AC | 218 ms
54,396 KB |
testcase_13 | AC | 563 ms
54,820 KB |
testcase_14 | AC | 325 ms
54,624 KB |
testcase_15 | AC | 291 ms
54,768 KB |
testcase_16 | AC | 480 ms
54,784 KB |
testcase_17 | AC | 365 ms
54,824 KB |
testcase_18 | AC | 504 ms
54,896 KB |
testcase_19 | AC | 238 ms
54,564 KB |
testcase_20 | AC | 319 ms
54,540 KB |
testcase_21 | AC | 494 ms
54,836 KB |
testcase_22 | AC | 369 ms
54,748 KB |
testcase_23 | AC | 298 ms
54,632 KB |
testcase_24 | AC | 295 ms
54,448 KB |
testcase_25 | AC | 294 ms
54,720 KB |
testcase_26 | AC | 267 ms
54,780 KB |
testcase_27 | AC | 362 ms
54,760 KB |
testcase_28 | AC | 546 ms
54,372 KB |
testcase_29 | AC | 490 ms
54,432 KB |
testcase_30 | AC | 327 ms
54,652 KB |
testcase_31 | AC | 332 ms
54,644 KB |
testcase_32 | AC | 559 ms
54,796 KB |
testcase_33 | AC | 269 ms
54,480 KB |
testcase_34 | AC | 450 ms
54,680 KB |
testcase_35 | AC | 380 ms
54,876 KB |
testcase_36 | AC | 311 ms
54,600 KB |
testcase_37 | AC | 295 ms
54,544 KB |
testcase_38 | AC | 267 ms
54,708 KB |
testcase_39 | AC | 580 ms
54,968 KB |
testcase_40 | AC | 492 ms
54,700 KB |
testcase_41 | AC | 427 ms
54,748 KB |
testcase_42 | AC | 546 ms
54,716 KB |
testcase_43 | AC | 229 ms
54,448 KB |
testcase_44 | AC | 476 ms
54,756 KB |
testcase_45 | AC | 303 ms
54,748 KB |
testcase_46 | AC | 427 ms
54,472 KB |
testcase_47 | AC | 289 ms
54,632 KB |
testcase_48 | AC | 268 ms
54,696 KB |
testcase_49 | AC | 228 ms
54,576 KB |
testcase_50 | AC | 224 ms
54,456 KB |
testcase_51 | AC | 482 ms
54,764 KB |
testcase_52 | AC | 492 ms
56,580 KB |
testcase_53 | AC | 561 ms
54,788 KB |
testcase_54 | AC | 484 ms
54,728 KB |
testcase_55 | AC | 584 ms
54,964 KB |
testcase_56 | AC | 483 ms
54,828 KB |
testcase_57 | AC | 502 ms
54,684 KB |
testcase_58 | AC | 582 ms
54,872 KB |
testcase_59 | AC | 560 ms
54,768 KB |
testcase_60 | AC | 490 ms
54,728 KB |
testcase_61 | AC | 558 ms
54,412 KB |
testcase_62 | AC | 576 ms
54,920 KB |
testcase_63 | AC | 549 ms
54,708 KB |
testcase_64 | AC | 564 ms
55,240 KB |
testcase_65 | AC | 565 ms
54,752 KB |
testcase_66 | AC | 519 ms
55,176 KB |
testcase_67 | AC | 566 ms
54,768 KB |
testcase_68 | AC | 545 ms
54,628 KB |
testcase_69 | AC | 560 ms
54,708 KB |
testcase_70 | AC | 546 ms
54,752 KB |
testcase_71 | AC | 566 ms
54,732 KB |
testcase_72 | AC | 562 ms
54,660 KB |
ソースコード
import java.util.*; import java.io.*; class Main { private static final void solve() throws IOException { final int n = ni(), sa = ni(), nn = n << 1; var a = new long[nn + 1]; for (int i = 0; i < n; i++) a[i] = a[i + n] = nl(); var d = new long[n][n + 1]; for (int i = 0; i < n; i++) d[i][1] = 1L << ni(); for (int range = 2; range <= n; range++) { for (int i = 0; i < n; i++) { for (int j = 1; j < range; j++) { final int ii = (i + j) % n; final int ra = range - j; for (int ss = 0; ss <= sa; ss++) { d[i][range] |= d[i][j] & ((d[ii][ra] << ss) | (d[ii][ra] >> ss)); d[i][range] |= d[ii][ra] & ((d[i][j] << ss) | (d[i][j] >> ss)); } } } } for (int i = nn; i > 0; i--) a[i - 1] += a[i]; long ans = 0; for (int i = 0; i < n; i++) for (int j = 0; j <= n; j++) if (d[i][j] != 0) ans = Math.max(ans, a[i] - a[i + j]); ou.println(ans); } public static void main(String[] args) throws IOException { // for (int i = 0, t = ni(); i < t; i++) solve(); ou.flush(); } private static final int ni() throws IOException { return sc.nextInt(); } private static final int[] ni(int n) throws IOException { return sc.nextIntArray(n); } private static final int[] ni1(int n) throws IOException { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni() - 1; return a; } private static final long nl() throws IOException { return sc.nextLong(); } private static final long[] nl(int n) throws IOException { return sc.nextLongArray(n); } private static final String ns() throws IOException { return sc.next(); } private static final char[] nc() throws IOException { return sc.nextCharArray(); } private static final double nd() throws IOException { return sc.nextDouble(); } private static final ContestInputStream sc = new ContestInputStream(); private static final ContestOutputStream ou = new ContestOutputStream(); } final class ContestInputStream extends FilterInputStream { protected final byte[] buf; protected int pos = 0; protected int lim = 0; private final char[] cbuf; public ContestInputStream() { super(System.in); this.buf = new byte[1 << 13]; this.cbuf = new char[1 << 20]; } boolean hasRemaining() throws IOException { if (pos < lim) return true; lim = in.read(buf); pos = 0; return lim > 0; } final int remaining() throws IOException { if (pos >= lim) { lim = in.read(buf); pos = 0; } return lim - pos; } @Override public final int available() throws IOException { if (pos < lim) return lim - pos + in.available(); return in.available(); } @Override public final long skip(long n) throws IOException { if (pos < lim) { int rem = lim - pos; if (n < rem) { pos += n; return n; } pos = lim; return rem; } return in.skip(n); } @Override public final int read() throws IOException { if (hasRemaining()) return buf[pos++]; return -1; } @Override public final int read(byte[] b, int off, int len) throws IOException { if (pos < lim) { int rem = Math.min(lim - pos, len); for (int i = 0; i < rem; i++) b[off + i] = buf[pos + i]; pos += rem; return rem; } return in.read(b, off, len); } public final char[] readToken() throws IOException { int cpos = 0; int rem; byte b; l: while ((rem = remaining()) > 0) { for (int i = 0; i < rem; i++) { b = buf[pos + i]; if (b <= 0x20) { pos += i + 1; cpos += i; if (b == 0x0d && hasRemaining() && buf[pos] == 0x0a) pos++; break l; } cbuf[cpos + i] = (char) b; } pos += rem; cpos += rem; } char[] arr = new char[cpos]; for (int i = 0; i < cpos; i++) arr[i] = cbuf[i]; return arr; } public final int readToken(char[] cbuf, int off) throws IOException { int cpos = off; int rem; byte b; l: while ((rem = remaining()) > 0) { for (int i = 0; i < rem; i++) { b = buf[pos + i]; if (b <= 0x20) { pos += i + 1; cpos += i; if (b == 0x0d && hasRemaining() && buf[pos] == 0x0a) pos++; break l; } cbuf[cpos + i] = (char) b; } pos += rem; cpos += rem; } return cpos - off; } public final int readToken(char[] cbuf) throws IOException { return readToken(cbuf, 0); } public final String next() throws IOException { int cpos = 0; int rem; byte b; l: while ((rem = remaining()) > 0) { for (int i = 0; i < rem; i++) { b = buf[pos + i]; if (b <= 0x20) { pos += i + 1; cpos += i; if (b == 0x0d && hasRemaining() && buf[pos] == 0x0a) pos++; break l; } cbuf[cpos + i] = (char) b; } pos += rem; cpos += rem; } return String.valueOf(cbuf, 0, cpos); } public final char[] nextCharArray() throws IOException { return readToken(); } public final int nextInt() throws IOException { if (!hasRemaining()) return 0; int value = 0; byte b = buf[pos++]; if (b == 0x2d) { while (hasRemaining() && (b = buf[pos++]) > 0x20) value = (value << 3) + (value << 1) - b + 0x30; } else { do { value = (value << 3) + (value << 1) + b - 0x30; } while (hasRemaining() && (b = buf[pos++]) > 0x20); } if (b == 0x0d && hasRemaining() && buf[pos] == 0x0a) pos++; return value; } public final long nextLong() throws IOException { if (!hasRemaining()) return 0L; long value = 0L; byte b = buf[pos++]; if (b == 0x2d) { while (hasRemaining() && (b = buf[pos++]) > 0x20) value = (value << 3) + (value << 1) - b + 0x30; } else { do { value = (value << 3) + (value << 1) + b - 0x30; } while (hasRemaining() && (b = buf[pos++]) > 0x20); } if (b == 0x0d && hasRemaining() && buf[pos] == 0x0a) pos++; return value; } public final char nextChar() throws IOException { if (!hasRemaining()) throw new EOFException(); final char c = (char) buf[pos++]; if (hasRemaining() && buf[pos++] == 0x0d && hasRemaining() && buf[pos] == 0x0a) pos++; return c; } public final float nextFloat() throws IOException { return Float.parseFloat(next()); } public final double nextDouble() throws IOException { return Double.parseDouble(next()); } public final boolean[] nextBooleanArray(char ok) throws IOException { char[] s = readToken(); int n = s.length; boolean[] t = new boolean[n]; for (int i = 0; i < n; i++) t[i] = s[i] == ok; return t; } public final boolean[][] nextBooleanMatrix(int h, int w, char ok) throws IOException { boolean[][] s = new boolean[h][]; for (int i = 0; i < h; i++) { char[] t = readToken(); int n = t.length; s[i] = new boolean[n]; for (int j = 0; j < n; j++) s[i][j] = t[j] == ok; } return s; } public final String[] nextStringArray(int len) throws IOException { String[] arr = new String[len]; for (int i = 0; i < len; i++) arr[i] = next(); return arr; } public final int[] nextIntArray(int len) throws IOException { int[] arr = new int[len]; for (int i = 0; i < len; i++) arr[i] = nextInt(); return arr; } public final int[] nextIntArray(int len, java.util.function.IntUnaryOperator map) throws IOException { int[] arr = new int[len]; for (int i = 0; i < len; i++) arr[i] = map.applyAsInt(nextInt()); return arr; } public final long[] nextLongArray(int len, java.util.function.LongUnaryOperator map) throws IOException { long[] arr = new long[len]; for (int i = 0; i < len; i++) arr[i] = map.applyAsLong(nextLong()); return arr; } public final int[][] nextIntMatrix(int h, int w) throws IOException { int[][] arr = new int[h][w]; for (int i = 0; i < h; i++) for (int j = 0; j < w; j++) arr[i][j] = nextInt(); return arr; } public final int[][] nextIntMatrix(int h, int w, java.util.function.IntUnaryOperator map) throws IOException { int[][] arr = new int[h][w]; for (int i = 0; i < h; i++) for (int j = 0; j < w; j++) arr[i][j] = map.applyAsInt(nextInt()); return arr; } public final long[] nextLongArray(int len) throws IOException { long[] arr = new long[len]; for (int i = 0; i < len; i++) arr[i] = nextLong(); return arr; } public final long[][] nextLongMatrix(int h, int w) throws IOException { long[][] arr = new long[h][w]; for (int i = 0; i < h; i++) for (int j = 0; j < w; j++) arr[i][j] = nextLong(); return arr; } public final float[] nextFloatArray(int len) throws IOException { float[] arr = new float[len]; for (int i = 0; i < len; i++) arr[i] = nextFloat(); return arr; } public final double[] nextDoubleArray(int len) throws IOException { double[] arr = new double[len]; for (int i = 0; i < len; i++) arr[i] = nextDouble(); return arr; } public final char[][] nextCharMatrix(int h, int w) throws IOException { char[][] arr = new char[h][]; for (int i = 0; i < h; i++) arr[i] = readToken(); return arr; } public final void nextThrow() throws IOException { next(); return; } public final void nextThrow(int n) throws IOException { for (int i = 0; i < n; i++) nextThrow(); return; } } final class ContestOutputStream extends FilterOutputStream implements Appendable { protected final byte[] buf; protected int pos = 0; public ContestOutputStream() { super(System.out); this.buf = new byte[1 << 13]; } @Override public void flush() throws IOException { out.write(buf, 0, pos); pos = 0; out.flush(); } void put(byte b) throws IOException { if (pos >= buf.length) flush(); buf[pos++] = b; } int remaining() throws IOException { if (pos >= buf.length) flush(); return buf.length - pos; } @Override public void write(int b) throws IOException { put((byte) b); } @Override public void write(byte[] b, int off, int len) throws IOException { int o = off; int l = len; while (l > 0) { int rem = Math.min(remaining(), l); for (int i = 0; i < rem; i++) buf[pos + i] = b[o + i]; pos += rem; o += rem; l -= rem; } } @Override public ContestOutputStream append(char c) throws IOException { put((byte) c); return this; } @Override public ContestOutputStream append(CharSequence csq, int start, int end) throws IOException { int off = start; int len = end - start; while (len > 0) { int rem = Math.min(remaining(), len); for (int i = 0; i < rem; i++) buf[pos + i] = (byte) csq.charAt(off + i); pos += rem; off += rem; len -= rem; } return this; } @Override public ContestOutputStream append(CharSequence csq) throws IOException { return append(csq, 0, csq.length()); } public ContestOutputStream append(char[] arr, int off, int len) throws IOException { int o = off; int l = len; while (l > 0) { int rem = Math.min(remaining(), l); for (int i = 0; i < rem; i++) buf[pos + i] = (byte) arr[o + i]; pos += rem; o += rem; l -= rem; } return this; } public ContestOutputStream print(char[] arr) throws IOException { return append(arr, 0, arr.length).newLine(); } public ContestOutputStream print(boolean value) throws IOException { if (value) return append("o"); return append("."); } public ContestOutputStream println(boolean value) throws IOException { if (value) return append("o\n"); return append(".\n"); } public ContestOutputStream print(boolean[][] value) throws IOException { final int n = value.length, m = value[0].length; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) print(value[i][j]); newLine(); } return this; } public ContestOutputStream print(int value) throws IOException { return append(String.valueOf(value)); } public ContestOutputStream println(int value) throws IOException { return append(String.valueOf(value)).newLine(); } public ContestOutputStream print(long value) throws IOException { return append(String.valueOf(value)); } public ContestOutputStream println(long value) throws IOException { return append(String.valueOf(value)).newLine(); } public ContestOutputStream print(float value) throws IOException { return append(String.valueOf(value)); } public ContestOutputStream println(float value) throws IOException { return append(String.valueOf(value)).newLine(); } private ContestOutputStream dtos(double x, int n) throws IOException { if (x < 0) { append('-'); x = -x; } x += Math.pow(10, -n) / 2; long longx = (long) x; print(longx); append('.'); x -= longx; for (int i = 0; i < n; i++) { x *= 10; int intx = (int) x; print(intx); x -= intx; } return this; } public ContestOutputStream print(double value) throws IOException { return dtos(value, 20); } public ContestOutputStream println(double value) throws IOException { return dtos(value, 20).newLine(); } public ContestOutputStream print(char value) throws IOException { return append(value); } public ContestOutputStream println(char value) throws IOException { return append(value).newLine(); } public ContestOutputStream print(String value) throws IOException { return append(value); } public ContestOutputStream println(String value) throws IOException { return append(String.valueOf(value)).newLine(); } public ContestOutputStream print(Object value) throws IOException { return append(String.valueOf(value)); } public ContestOutputStream println(Object value) throws IOException { return append(String.valueOf(value)).newLine(); } public ContestOutputStream printYN(boolean yes) throws IOException { if (yes) return println("Yes"); return println("No"); } public ContestOutputStream printAB(boolean yes) throws IOException { if (yes) return println("Alice"); return println("Bob"); } public ContestOutputStream print(CharSequence[] arr) throws IOException { if (arr.length > 0) { append(arr[0]); for (int i = 1; i < arr.length; i++) append('\u0020').append(arr[i]); } return this; } public ContestOutputStream print(int[] arr) throws IOException { if (arr.length > 0) { print(arr[0]); for (int i = 1; i < arr.length; i++) append('\u0020').print(arr[i]); } newLine(); return this; } public ContestOutputStream print(int[] arr, int length) throws IOException { if (length > 0) print(arr[0]); for (int i = 1; i < length; i++) append('\u0020').print(arr[i]); newLine(); return this; } public ContestOutputStream println(int[] arr) throws IOException { for (int i : arr) print(i).newLine(); return this; } public ContestOutputStream println(int[] arr, int length) throws IOException { for (int i = 0; i < length; i++) println(arr[i]); return this; } public ContestOutputStream print(boolean[] arr) throws IOException { if (arr.length > 0) { print(arr[0]); for (int i = 1; i < arr.length; i++) append('\u0020').print(arr[i]); } newLine(); return this; } public ContestOutputStream print(long[] arr) throws IOException { if (arr.length > 0) { print(arr[0]); for (int i = 1; i < arr.length; i++) append('\u0020').print(arr[i]); } newLine(); return this; } public ContestOutputStream print(long[] arr, int length) throws IOException { if (length > 0) print(arr[0]); for (int i = 1; i < length; i++) append('\u0020').print(arr[i]); newLine(); return this; } public ContestOutputStream println(long[] arr, int length) throws IOException { for (int i = 0; i < length; i++) println(arr[i]); return this; } public ContestOutputStream println(long[] arr) throws IOException { for (long i : arr) print(i).newLine(); return this; } public ContestOutputStream print(float[] arr) throws IOException { if (arr.length > 0) { print(arr[0]); for (int i = 1; i < arr.length; i++) append('\u0020').print(arr[i]); } return this; } public ContestOutputStream println(float[] arr) throws IOException { for (float i : arr) print(i).newLine(); return this; } public ContestOutputStream print(double[] arr) throws IOException { if (arr.length > 0) { print(arr[0]); for (int i = 1; i < arr.length; i++) append('\u0020').print(arr[i]); } return newLine(); } public ContestOutputStream println(double[] arr) throws IOException { for (double i : arr) print(i).newLine(); return this; } public ContestOutputStream print(Object[] arr) throws IOException { if (arr.length > 0) { print(arr[0]); for (int i = 1; i < arr.length; i++) append('\u0020').print(arr[i]); } return newLine(); } public ContestOutputStream print(java.util.ArrayList<?> arr) throws IOException { if (!arr.isEmpty()) { final int n = arr.size(); print(arr.get(0)); for (int i = 1; i < n; i++) print(" ").print(arr.get(i)); } return newLine(); } public ContestOutputStream println(java.util.ArrayList<?> arr) throws IOException { final int n = arr.size(); for (int i = 0; i < n; i++) println(arr.get(i)); return this; } public ContestOutputStream newLine() throws IOException { return append(System.lineSeparator()); } public ContestOutputStream endl() throws IOException { newLine().flush(); return this; } public ContestOutputStream print(int[][] arr) throws IOException { for (int[] i : arr) print(i); return this; } public ContestOutputStream print(long[][] arr) throws IOException { for (long[] i : arr) print(i); return this; } public ContestOutputStream print(char[][] arr) throws IOException { for (char[] i : arr) print(i); return this; } public ContestOutputStream print(Object[][] arr) throws IOException { for (Object[] i : arr) print(i); return this; } public ContestOutputStream println() throws IOException { return newLine(); } public ContestOutputStream println(Object... arr) throws IOException { for (Object i : arr) print(i); return newLine(); } public ContestOutputStream printToChar(int c) throws IOException { return print((char) c); } }