#68491 (Java21) No.332 数列をプレゼントに

提出ソース

結果

問題	No.332 数列をプレゼントに
ユーザー	uwi
提出日時	2015-12-25 00:58:59
言語	Java21 (openjdk 21)
結果	AC
実行時間	199 ms / 2,000 ms
コード長	4,006 bytes
コンパイル時間	5,313 ms
コンパイル使用メモリ	80,600 KB
実行使用メモリ	44,120 KB
最終ジャッジ日時	2024-06-09 13:16:43
合計ジャッジ時間	13,196 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	67 ms 42,072 KB
testcase_01	AC	67 ms 42,660 KB
testcase_02	AC	68 ms 42,204 KB
testcase_03	AC	67 ms 42,600 KB
testcase_04	AC	67 ms 42,560 KB
testcase_05	AC	68 ms 42,580 KB
testcase_06	AC	78 ms 43,136 KB
testcase_07	AC	191 ms 43,356 KB
testcase_08	AC	68 ms 41,900 KB
testcase_09	AC	86 ms 43,232 KB
testcase_10	AC	186 ms 43,432 KB
testcase_11	AC	65 ms 41,928 KB
testcase_12	AC	78 ms 42,636 KB
testcase_13	AC	83 ms 42,652 KB
testcase_14	AC	75 ms 42,136 KB
testcase_15	AC	94 ms 43,096 KB
testcase_16	AC	84 ms 43,092 KB
testcase_17	AC	79 ms 42,808 KB
testcase_18	AC	86 ms 43,004 KB
testcase_19	AC	67 ms 42,192 KB
testcase_20	AC	83 ms 42,952 KB
testcase_21	AC	83 ms 42,948 KB
testcase_22	AC	84 ms 43,152 KB
testcase_23	AC	128 ms 43,280 KB
testcase_24	AC	184 ms 43,368 KB
testcase_25	AC	185 ms 43,216 KB
testcase_26	AC	156 ms 43,488 KB
testcase_27	AC	78 ms 42,580 KB
testcase_28	AC	187 ms 43,416 KB
testcase_29	AC	188 ms 43,412 KB
testcase_30	AC	110 ms 43,204 KB
testcase_31	AC	185 ms 43,392 KB
testcase_32	AC	199 ms 43,544 KB
testcase_33	AC	182 ms 43,292 KB
testcase_34	AC	194 ms 44,120 KB
testcase_35	AC	177 ms 43,412 KB
testcase_36	AC	75 ms 42,252 KB
testcase_37	AC	187 ms 43,332 KB
testcase_38	AC	184 ms 43,412 KB
testcase_39	AC	185 ms 43,312 KB
testcase_40	AC	180 ms 43,444 KB
testcase_41	AC	190 ms 43,428 KB
testcase_42	AC	183 ms 43,428 KB
testcase_43	AC	184 ms 43,340 KB
testcase_44	AC	91 ms 43,060 KB
testcase_45	AC	193 ms 43,588 KB
testcase_46	AC	182 ms 43,232 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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)); }
}

yukicoder

結果

テストケース

ソースコード