結果
問題 | No.324 落ちてた閉路グラフ |
ユーザー | uwi |
提出日時 | 2015-12-17 01:29:09 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,480 bytes |
コンパイル時間 | 4,866 ms |
コンパイル使用メモリ | 80,024 KB |
実行使用メモリ | 53,752 KB |
最終ジャッジ日時 | 2023-10-14 11:56:15 |
合計ジャッジ時間 | 10,211 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,208 KB |
testcase_01 | AC | 41 ms
49,136 KB |
testcase_02 | AC | 42 ms
49,048 KB |
testcase_03 | AC | 42 ms
48,848 KB |
testcase_04 | AC | 167 ms
53,596 KB |
testcase_05 | AC | 170 ms
53,384 KB |
testcase_06 | AC | 168 ms
53,244 KB |
testcase_07 | AC | 169 ms
53,376 KB |
testcase_08 | AC | 167 ms
53,692 KB |
testcase_09 | AC | 157 ms
51,552 KB |
testcase_10 | AC | 168 ms
53,144 KB |
testcase_11 | AC | 168 ms
53,752 KB |
testcase_12 | WA | - |
testcase_13 | AC | 117 ms
52,660 KB |
testcase_14 | AC | 79 ms
51,624 KB |
testcase_15 | AC | 83 ms
51,720 KB |
testcase_16 | WA | - |
testcase_17 | AC | 42 ms
49,120 KB |
testcase_18 | AC | 42 ms
49,016 KB |
testcase_19 | AC | 42 ms
49,136 KB |
testcase_20 | WA | - |
testcase_21 | AC | 42 ms
49,016 KB |
testcase_22 | AC | 41 ms
49,160 KB |
testcase_23 | AC | 42 ms
49,172 KB |
testcase_24 | WA | - |
testcase_25 | AC | 41 ms
47,184 KB |
testcase_26 | AC | 42 ms
46,996 KB |
testcase_27 | AC | 42 ms
48,848 KB |
testcase_28 | AC | 42 ms
49,296 KB |
testcase_29 | WA | - |
testcase_30 | AC | 41 ms
49,676 KB |
testcase_31 | AC | 42 ms
49,136 KB |
testcase_32 | AC | 169 ms
53,344 KB |
testcase_33 | AC | 168 ms
53,340 KB |
testcase_34 | AC | 130 ms
51,392 KB |
testcase_35 | AC | 49 ms
49,072 KB |
testcase_36 | AC | 128 ms
53,376 KB |
testcase_37 | AC | 45 ms
48,832 KB |
ソースコード
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 Adv17F { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(); int[] w = na(n); int ret = -9999999; // include { int[] pre = new int[n+1]; int[] cur = new int[n+1]; int[] pprem = new int[n+1]; int[] prem = new int[n+1]; int[] curm = new int[n+1]; Arrays.fill(pre, -9999999); Arrays.fill(cur, -9999999); Arrays.fill(pprem, -9999999); Arrays.fill(prem, -9999999); Arrays.fill(curm, -9999999); pre[1] = 0; prem[1] = 0; for(int i = 1;i < n;i++){ for(int k = 1;k <= n;k++){ int max = pprem[k-1]; if(k > 1){ max = Math.max(max, pre[k-1] + w[i-1]); }else{ // max = Math.max(max, 0); } cur[k] = max; curm[k] = Math.max(cur[k], prem[k]); } {int[] dum = pre; pre = cur; cur = dum;} {int[] dum = pprem; pprem = prem; prem = curm; curm = dum;} } ret = Math.max(ret, pprem[m]); ret = Math.max(ret, pre[m] + w[n-1]); } // not include { int[] pre = new int[n+1]; int[] cur = new int[n+1]; int[] pprem = new int[n+1]; int[] prem = new int[n+1]; int[] curm = new int[n+1]; Arrays.fill(pre, -9999999); Arrays.fill(cur, -9999999); Arrays.fill(pprem, -9999999); Arrays.fill(prem, -9999999); Arrays.fill(curm, -9999999); pre[0] = 0; prem[0] = 0; for(int i = 1;i < n;i++){ for(int k = 1;k <= n;k++){ int max = pprem[k-1]; if(k > 1){ max = Math.max(max, pre[k-1] + w[i-1]); }else{ max = Math.max(max, 0); } cur[k] = max; curm[k] = Math.max(cur[k], prem[k]); } {int[] dum = pre; pre = cur; cur = dum;} {int[] dum = pprem; pprem = prem; prem = curm; curm = dum;} } ret = Math.max(prem[m], ret); } out.println(ret); } 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 Adv17F().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)); } }