結果

問題 No.775 tatyamと素数大富豪(hard)
ユーザー uwiuwi
提出日時 2018-12-22 00:15:30
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,269 bytes
コンパイル時間 3,907 ms
コンパイル使用メモリ 82,552 KB
実行使用メモリ 51,552 KB
最終ジャッジ日時 2024-10-14 01:25:54
合計ジャッジ時間 8,633 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
42,036 KB
testcase_01 AC 55 ms
37,068 KB
testcase_02 WA -
testcase_03 AC 56 ms
37,268 KB
testcase_04 WA -
testcase_05 AC 55 ms
37,136 KB
testcase_06 AC 57 ms
37,324 KB
testcase_07 AC 87 ms
38,620 KB
testcase_08 AC 93 ms
38,584 KB
testcase_09 AC 123 ms
40,832 KB
testcase_10 AC 121 ms
40,988 KB
testcase_11 AC 51 ms
37,080 KB
testcase_12 AC 54 ms
37,160 KB
testcase_13 WA -
testcase_14 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2018;
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 Day23_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), K = ni();
		int[] a = na(n);
		String[] sa = new String[n];
		for(int i = 0;i < n;i++)sa[i] = "" + a[i];
		
		Arrays.sort(sa, new Comparator<String>() {
			public int compare(String a, String b) {
				return -(a+b).compareTo(b+a);
			}
		});

		rem = K;
		dfs(0, new boolean[n], sa, new StringBuilder());
	}
	
	int rem = 0;
	String last = null;
	
	void dfs(int pos, boolean[] used, String[] sa, StringBuilder sb)
	{
		if(rem <= 0)return;
		if(pos == used.length){
			if(last == null || !last.equals(sb.toString())){
				out.println(sb);
				rem--;
				last = sb.toString();
			}
			return;
		}
		for(int i = 0;i < used.length;i++){
			if(!used[i]){
				if(i-1 >= 0 && sa[i].equals(sa[i-1]) && !used[i-1])continue;
				used[i] = true;
				sb.append(sa[i]);
				dfs(pos+1, used, sa, sb);
				sb.delete(sb.length()-sa[i].length(), sb.length());
				used[i] = false;
			}
		}
	}
	
	void run() throws Exception
	{
//		int n = 99, m = 99999;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " " + 1000 + "\n");
//		for (int i = 0; i < n/2; i++) {
//			sb.append(77 + " ");
//		}
//		for (int i = 0; i < n/2; i++) {
//			sb.append(7 + " ");
//		}
//		sb.append(67 + " ");
//		INPUT = sb.toString();

		
		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 Day23_2().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)); }
}
0