結果

問題 No.332 数列をプレゼントに
ユーザー uwiuwi
提出日時 2015-12-25 00:14:37
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,969 bytes
コンパイル時間 4,295 ms
コンパイル使用メモリ 86,828 KB
実行使用メモリ 65,300 KB
最終ジャッジ日時 2023-10-19 03:01:01
合計ジャッジ時間 41,086 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 74 ms
61,948 KB
testcase_01 AC 77 ms
62,320 KB
testcase_02 AC 76 ms
62,296 KB
testcase_03 AC 77 ms
62,308 KB
testcase_04 AC 77 ms
62,380 KB
testcase_05 AC 206 ms
65,064 KB
testcase_06 WA -
testcase_07 AC 1,283 ms
65,044 KB
testcase_08 WA -
testcase_09 AC 87 ms
62,904 KB
testcase_10 AC 936 ms
65,088 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 179 ms
64,620 KB
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 1,303 ms
65,096 KB
testcase_25 AC 1,211 ms
64,636 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 1,285 ms
64,624 KB
testcase_29 AC 1,288 ms
65,128 KB
testcase_30 WA -
testcase_31 AC 1,291 ms
65,092 KB
testcase_32 AC 1,284 ms
65,072 KB
testcase_33 AC 1,290 ms
64,684 KB
testcase_34 AC 1,300 ms
64,936 KB
testcase_35 AC 1,237 ms
64,912 KB
testcase_36 AC 76 ms
62,568 KB
testcase_37 WA -
testcase_38 AC 1,300 ms
65,092 KB
testcase_39 WA -
testcase_40 AC 1,307 ms
64,936 KB
testcase_41 AC 1,282 ms
65,108 KB
testcase_42 AC 1,304 ms
64,916 KB
testcase_43 AC 1,264 ms
65,116 KB
testcase_44 WA -
testcase_45 AC 1,292 ms
65,084 KB
testcase_46 AC 1,175 ms
64,620 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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(23, n);
		int smaller = n-larger;
		
		boolean[] dp = new boolean[1800000];
		int[] prev = new int[1800000];
		Arrays.fill(prev, -1);
		dp[0] = true;
		for(int i = 0;i < smaller;i++){
			for(int j = 1800000-1-ai[i][0];j >= 0;j--){
				if(dp[j]){
					dp[j+ai[i][0]] = true;
					prev[j+ai[i][0]] = i;
				}
			}
		}
		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 < 1800000 && 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)); }
}
0