結果
問題 | No.1017 Reiwa Sequence |
ユーザー | uwi |
提出日時 | 2020-04-03 22:07:29 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 487 ms / 2,000 ms |
コード長 | 4,811 bytes |
コンパイル時間 | 4,065 ms |
コンパイル使用メモリ | 77,848 KB |
実行使用メモリ | 408,460 KB |
最終ジャッジ日時 | 2023-09-16 02:02:11 |
合計ジャッジ時間 | 31,129 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 69 ms
50,288 KB |
testcase_01 | AC | 103 ms
60,696 KB |
testcase_02 | AC | 65 ms
50,272 KB |
testcase_03 | AC | 251 ms
117,388 KB |
testcase_04 | AC | 65 ms
50,292 KB |
testcase_05 | AC | 144 ms
65,856 KB |
testcase_06 | AC | 137 ms
61,988 KB |
testcase_07 | AC | 63 ms
50,184 KB |
testcase_08 | AC | 64 ms
50,360 KB |
testcase_09 | AC | 265 ms
146,304 KB |
testcase_10 | AC | 432 ms
325,192 KB |
testcase_11 | AC | 271 ms
139,964 KB |
testcase_12 | AC | 462 ms
394,940 KB |
testcase_13 | AC | 423 ms
408,460 KB |
testcase_14 | AC | 265 ms
137,600 KB |
testcase_15 | AC | 250 ms
145,504 KB |
testcase_16 | AC | 243 ms
139,264 KB |
testcase_17 | AC | 304 ms
203,040 KB |
testcase_18 | AC | 242 ms
139,692 KB |
testcase_19 | AC | 449 ms
325,960 KB |
testcase_20 | AC | 468 ms
325,836 KB |
testcase_21 | AC | 473 ms
326,124 KB |
testcase_22 | AC | 468 ms
326,236 KB |
testcase_23 | AC | 454 ms
326,248 KB |
testcase_24 | AC | 420 ms
325,868 KB |
testcase_25 | AC | 447 ms
325,860 KB |
testcase_26 | AC | 431 ms
326,440 KB |
testcase_27 | AC | 472 ms
328,504 KB |
testcase_28 | AC | 465 ms
326,976 KB |
testcase_29 | AC | 386 ms
326,992 KB |
testcase_30 | AC | 402 ms
326,492 KB |
testcase_31 | AC | 435 ms
327,212 KB |
testcase_32 | AC | 457 ms
326,864 KB |
testcase_33 | AC | 365 ms
326,948 KB |
testcase_34 | AC | 63 ms
50,680 KB |
testcase_35 | AC | 64 ms
50,280 KB |
testcase_36 | AC | 64 ms
50,312 KB |
testcase_37 | AC | 425 ms
326,912 KB |
testcase_38 | AC | 333 ms
326,876 KB |
testcase_39 | AC | 449 ms
326,832 KB |
testcase_40 | AC | 226 ms
59,048 KB |
testcase_41 | AC | 223 ms
58,728 KB |
testcase_42 | AC | 224 ms
58,664 KB |
testcase_43 | AC | 226 ms
58,696 KB |
testcase_44 | AC | 259 ms
61,552 KB |
testcase_45 | AC | 226 ms
58,944 KB |
testcase_46 | AC | 223 ms
58,396 KB |
testcase_47 | AC | 223 ms
58,612 KB |
testcase_48 | AC | 487 ms
64,120 KB |
testcase_49 | AC | 283 ms
64,412 KB |
testcase_50 | AC | 286 ms
64,052 KB |
testcase_51 | AC | 55 ms
52,128 KB |
testcase_52 | AC | 462 ms
327,212 KB |
testcase_53 | AC | 443 ms
326,924 KB |
ソースコード
package contest200403; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.Comparator; import java.util.InputMismatchException; public class C { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[] a = na(n); int[][] ai = new int[n][]; for(int i = 0;i < n;i++){ ai[i] = new int[]{a[i], i}; } Arrays.sort(ai, new Comparator<int[]>() { public int compare(int[] a, int[] b) { return a[0] - b[0]; } }); for(int i = 0;i < n-1;i++){ if(ai[i+1][0] == ai[i][0]){ out.println("Yes"); int[] b = new int[n]; b[ai[i][1]] = ai[i][0]; b[ai[i+1][1]] = -ai[i][0]; print(b); return; } } int[] hit = new int[150005]; Arrays.fill(hit, -1); for(int i = 0;i < n-1;i++){ int cha = ai[i+1][0] - ai[i][0]; if(hit[cha] != -1 && hit[cha] < i-1){ out.println("Yes"); int[] b = new int[n]; b[ai[i+1][1]] = ai[i+1][0]; b[ai[i][1]] = -ai[i][0]; b[ai[hit[cha]+1][1]] = -ai[hit[cha]+1][0]; b[ai[hit[cha]][1]] = ai[hit[cha]][0]; print(b); return; } if(hit[cha] == -1)hit[cha] = i; } // sqrt(n) int h = (n+1)/2; int[][] dp = new int[n+1][150005*h*2+1]; int O = 150005*h; dp[0][O] = 1; for(int i = 0;i < n;i++){ for(int j = 0;j < dp[i].length;j++){ dp[i+1][j] = dp[i][j]; } for(int j = 0;j < dp[i].length;j++){ if(dp[i][j] != 0){ if(j+a[i] < dp[i].length)dp[i+1][j+a[i]] += dp[i][j]*3; if(j-a[i] >= 0)dp[i+1][j-a[i]] += dp[i][j]*5; } } if(dp[i+1][O] != 1){ out.println("Yes"); int cur = O; int[] b = new int[n]; for(int k = i;k >= 0;k--){ if(dp[k][cur] != 0 && k != i){ }else if((k == 0 && cur-a[k] == O) || cur-a[k] >= 0 && dp[k][cur-a[k]] != 0){ cur -= a[k]; b[k] = a[k]; }else{ cur += a[k]; b[k] = -a[k]; } } print(b); return; } } out.println("No"); } void print(int[] b) { for(int v : b){ out.print(v + " "); } out.println(); } 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 C().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)); } }