結果

問題 No.459 C-VS for yukicoder
ユーザー uwiuwi
提出日時 2016-12-10 00:10:43
言語 Java21
(openjdk 21)
結果
AC  
実行時間 231 ms / 2,000 ms
コード長 4,098 bytes
コンパイル時間 3,957 ms
コンパイル使用メモリ 78,232 KB
実行使用メモリ 57,772 KB
最終ジャッジ日時 2023-08-19 06:20:44
合計ジャッジ時間 11,398 ms
ジャッジサーバーID
(参考情報)
judge15 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
49,244 KB
testcase_01 AC 40 ms
49,212 KB
testcase_02 AC 40 ms
49,408 KB
testcase_03 AC 39 ms
49,216 KB
testcase_04 AC 37 ms
49,244 KB
testcase_05 AC 39 ms
49,272 KB
testcase_06 AC 39 ms
49,044 KB
testcase_07 AC 39 ms
49,392 KB
testcase_08 AC 39 ms
49,500 KB
testcase_09 AC 38 ms
49,044 KB
testcase_10 AC 40 ms
49,268 KB
testcase_11 AC 39 ms
49,280 KB
testcase_12 AC 39 ms
49,328 KB
testcase_13 AC 38 ms
49,400 KB
testcase_14 AC 38 ms
49,540 KB
testcase_15 AC 74 ms
51,824 KB
testcase_16 AC 56 ms
51,216 KB
testcase_17 AC 44 ms
49,252 KB
testcase_18 AC 45 ms
49,412 KB
testcase_19 AC 44 ms
49,496 KB
testcase_20 AC 42 ms
49,664 KB
testcase_21 AC 231 ms
57,460 KB
testcase_22 AC 195 ms
57,772 KB
testcase_23 AC 229 ms
57,664 KB
testcase_24 AC 138 ms
53,120 KB
testcase_25 AC 106 ms
53,128 KB
testcase_26 AC 110 ms
52,252 KB
testcase_27 AC 109 ms
52,540 KB
testcase_28 AC 103 ms
52,236 KB
testcase_29 AC 134 ms
52,844 KB
testcase_30 AC 110 ms
53,016 KB
testcase_31 AC 126 ms
52,636 KB
testcase_32 AC 43 ms
49,116 KB
testcase_33 AC 103 ms
52,936 KB
testcase_34 AC 121 ms
52,932 KB
testcase_35 AC 54 ms
49,156 KB
testcase_36 AC 123 ms
52,764 KB
testcase_37 AC 53 ms
49,892 KB
testcase_38 AC 113 ms
53,092 KB
testcase_39 AC 57 ms
50,056 KB
testcase_40 AC 112 ms
53,384 KB
testcase_41 AC 43 ms
49,328 KB
testcase_42 AC 109 ms
52,912 KB
testcase_43 AC 111 ms
52,908 KB
testcase_44 AC 84 ms
51,292 KB
testcase_45 AC 82 ms
52,080 KB
testcase_46 AC 79 ms
51,976 KB
testcase_47 AC 54 ms
50,116 KB
testcase_48 AC 119 ms
52,708 KB
testcase_49 AC 47 ms
49,404 KB
testcase_50 AC 111 ms
52,652 KB
testcase_51 AC 49 ms
49,952 KB
testcase_52 AC 94 ms
52,936 KB
testcase_53 AC 63 ms
50,892 KB
testcase_54 AC 117 ms
52,968 KB
testcase_55 AC 81 ms
51,696 KB
testcase_56 AC 111 ms
53,088 KB
testcase_57 AC 44 ms
49,520 KB
testcase_58 AC 125 ms
51,044 KB
testcase_59 AC 83 ms
52,020 KB
testcase_60 AC 93 ms
52,932 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

package adv2016;
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 N459 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int h = ni(), w = ni(), K = ni();
		char[][] map = nm(h, w);
		int[] hs = new int[w+2];
		for(int i = 0;i < w;i++){
			for(int j = 0;j < h;j++){
				if(map[j][i] == '#'){
					hs[i]++;
				}
			}
		}
		int[] a = na(K);
		int[][] bs = new int[K][3];
		int[][] ai = new int[K][];
		for(int i = 0;i < K;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 < K;i++){
			for(int j = 0;j < 3;j++){
				if(hs[ai[i][0]+j] > 0){
					hs[ai[i][0]+j]--;
					bs[ai[i][1]][j]++;
					break;
				}
			}
		}
		
		for(int i = 0;i < K;i++){
			for(int j = 0;j < 3;j++){
				int plus = Math.min(3-bs[ai[i][1]][j], hs[ai[i][0]+j]);
				hs[ai[i][0]+j] -= plus;
				bs[ai[i][1]][j] += plus;
			}
		}
		for(int i = 0;i < K;i++){
			for(int j = 0;j < 3;j++){
				for(int k = 0;k < 3;k++){
					if(bs[i][k] >= 3-j){
						out.print("#");
						bs[i][k]--;
					}else{
						out.print(".");
					}
				}
				out.println();
			}
		}
		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 N459().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