結果
問題 | No.332 数列をプレゼントに |
ユーザー | uwi |
提出日時 | 2015-12-25 00:58:59 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 190 ms / 2,000 ms |
コード長 | 4,006 bytes |
コンパイル時間 | 5,068 ms |
コンパイル使用メモリ | 80,672 KB |
実行使用メモリ | 57,236 KB |
最終ジャッジ日時 | 2023-08-28 18:03:26 |
合計ジャッジ時間 | 13,506 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
55,000 KB |
testcase_01 | AC | 55 ms
55,000 KB |
testcase_02 | AC | 55 ms
55,048 KB |
testcase_03 | AC | 55 ms
54,960 KB |
testcase_04 | AC | 58 ms
54,896 KB |
testcase_05 | AC | 56 ms
54,908 KB |
testcase_06 | AC | 74 ms
55,296 KB |
testcase_07 | AC | 160 ms
56,044 KB |
testcase_08 | AC | 56 ms
55,004 KB |
testcase_09 | AC | 69 ms
55,928 KB |
testcase_10 | AC | 173 ms
56,268 KB |
testcase_11 | AC | 56 ms
55,312 KB |
testcase_12 | AC | 57 ms
55,048 KB |
testcase_13 | AC | 59 ms
56,208 KB |
testcase_14 | AC | 56 ms
54,856 KB |
testcase_15 | AC | 77 ms
56,012 KB |
testcase_16 | AC | 60 ms
55,044 KB |
testcase_17 | AC | 56 ms
55,028 KB |
testcase_18 | AC | 72 ms
55,996 KB |
testcase_19 | AC | 55 ms
54,944 KB |
testcase_20 | AC | 61 ms
55,412 KB |
testcase_21 | AC | 62 ms
56,076 KB |
testcase_22 | AC | 60 ms
55,140 KB |
testcase_23 | AC | 105 ms
56,160 KB |
testcase_24 | AC | 147 ms
56,064 KB |
testcase_25 | AC | 173 ms
55,872 KB |
testcase_26 | AC | 123 ms
56,048 KB |
testcase_27 | AC | 56 ms
55,028 KB |
testcase_28 | AC | 173 ms
56,060 KB |
testcase_29 | AC | 176 ms
55,164 KB |
testcase_30 | AC | 92 ms
56,236 KB |
testcase_31 | AC | 177 ms
56,144 KB |
testcase_32 | AC | 178 ms
55,164 KB |
testcase_33 | AC | 162 ms
55,800 KB |
testcase_34 | AC | 190 ms
57,236 KB |
testcase_35 | AC | 142 ms
56,052 KB |
testcase_36 | AC | 56 ms
54,876 KB |
testcase_37 | AC | 149 ms
56,184 KB |
testcase_38 | AC | 147 ms
55,060 KB |
testcase_39 | AC | 153 ms
56,372 KB |
testcase_40 | AC | 145 ms
55,516 KB |
testcase_41 | AC | 174 ms
55,948 KB |
testcase_42 | AC | 146 ms
56,292 KB |
testcase_43 | AC | 177 ms
55,620 KB |
testcase_44 | AC | 77 ms
55,748 KB |
testcase_45 | AC | 150 ms
55,096 KB |
testcase_46 | AC | 149 ms
54,580 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.Comparator; import java.util.InputMismatchException; public class Q894 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); long x = nl(); 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]; } }); int larger = Math.min(20, n); int smaller = n-larger; int z = 1000000; boolean[] dp = new boolean[z]; int ls = 0; int[] prev = new int[z]; Arrays.fill(prev, -1); dp[0] = true; for(int i = 0;i < smaller;i++){ for(int j = ls;j >= 0;j--){ if(!dp[j+ai[i][0]] && dp[j]){ dp[j+ai[i][0]] = true; prev[j+ai[i][0]] = i; } } ls += ai[i][0]; } for(int i = 0;i < 1<<larger;i++){ long sum = 0; for(int j = 0;j < larger;j++){ if(i<<~j<0){ sum += ai[smaller+j][0]; } } long rem = x-sum; if(0 <= rem && rem < z && dp[(int)rem]){ char[] ret = new char[n]; Arrays.fill(ret, 'x'); for(int j = 0;j < larger;j++){ if(i<<~j<0){ ret[ai[smaller+j][1]] = 'o'; } } int y = (int)rem; while(y != 0){ ret[ai[prev[y]][1]] = 'o'; y -= ai[prev[y]][0]; } out.println(new String(ret)); return; } } out.println("No"); } 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 Q894().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)); } }