結果

問題 No.459 C-VS for yukicoder
ユーザー GrenacheGrenache
提出日時 2016-12-10 08:37:19
言語 Java21
(openjdk 21)
結果
AC  
実行時間 304 ms / 2,000 ms
コード長 5,421 bytes
コンパイル時間 5,015 ms
コンパイル使用メモリ 80,164 KB
実行使用メモリ 49,236 KB
最終ジャッジ日時 2024-11-29 00:28:06
合計ジャッジ時間 14,230 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
37,068 KB
testcase_01 AC 57 ms
36,980 KB
testcase_02 AC 57 ms
37,164 KB
testcase_03 AC 57 ms
36,840 KB
testcase_04 AC 58 ms
37,028 KB
testcase_05 AC 57 ms
37,248 KB
testcase_06 AC 59 ms
37,204 KB
testcase_07 AC 58 ms
36,844 KB
testcase_08 AC 57 ms
36,980 KB
testcase_09 AC 59 ms
37,256 KB
testcase_10 AC 57 ms
37,292 KB
testcase_11 AC 60 ms
36,872 KB
testcase_12 AC 59 ms
36,992 KB
testcase_13 AC 59 ms
37,168 KB
testcase_14 AC 58 ms
37,064 KB
testcase_15 AC 100 ms
38,760 KB
testcase_16 AC 85 ms
38,176 KB
testcase_17 AC 63 ms
37,320 KB
testcase_18 AC 61 ms
37,384 KB
testcase_19 AC 62 ms
36,864 KB
testcase_20 AC 62 ms
37,148 KB
testcase_21 AC 304 ms
47,756 KB
testcase_22 AC 255 ms
49,236 KB
testcase_23 AC 303 ms
47,736 KB
testcase_24 AC 190 ms
44,544 KB
testcase_25 AC 146 ms
40,628 KB
testcase_26 AC 150 ms
41,920 KB
testcase_27 AC 156 ms
40,660 KB
testcase_28 AC 144 ms
40,572 KB
testcase_29 AC 176 ms
43,380 KB
testcase_30 AC 150 ms
41,736 KB
testcase_31 AC 157 ms
40,952 KB
testcase_32 AC 97 ms
38,264 KB
testcase_33 AC 164 ms
41,344 KB
testcase_34 AC 169 ms
41,992 KB
testcase_35 AC 105 ms
38,992 KB
testcase_36 AC 181 ms
42,204 KB
testcase_37 AC 97 ms
38,652 KB
testcase_38 AC 164 ms
41,560 KB
testcase_39 AC 104 ms
39,000 KB
testcase_40 AC 155 ms
40,920 KB
testcase_41 AC 96 ms
38,320 KB
testcase_42 AC 150 ms
41,044 KB
testcase_43 AC 154 ms
42,080 KB
testcase_44 AC 125 ms
39,024 KB
testcase_45 AC 124 ms
38,920 KB
testcase_46 AC 110 ms
39,248 KB
testcase_47 AC 105 ms
38,968 KB
testcase_48 AC 168 ms
41,816 KB
testcase_49 AC 103 ms
38,732 KB
testcase_50 AC 162 ms
41,368 KB
testcase_51 AC 96 ms
38,668 KB
testcase_52 AC 142 ms
39,944 KB
testcase_53 AC 115 ms
38,704 KB
testcase_54 AC 162 ms
41,964 KB
testcase_55 AC 129 ms
39,676 KB
testcase_56 AC 156 ms
41,040 KB
testcase_57 AC 103 ms
38,744 KB
testcase_58 AC 170 ms
41,860 KB
testcase_59 AC 122 ms
39,028 KB
testcase_60 AC 142 ms
39,892 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder459 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int h = sc.nextInt();
		int w = sc.nextInt();
		int n = sc.nextInt();

		char[][] s = new char[h][];
		for (int i = 0; i < h; i++) {
			s[i] = sc.next().toCharArray();
		}

		int[] c = new int[n];
		Pair[] cc = new Pair[n];
//		int[] cnt = new int[w];
		for (int i = 0; i < n; i++) {
			c[i] = sc.nextInt();
			cc[i] = new Pair(i, c[i]);
//			cnt[c[i]]++;
//			cnt[c[i] + 1]++;
//			cnt[c[i] + 2]++;
		}
		Arrays.sort(cc);

		int[] b = new int[w];
		for (int i = 0; i < w; i++) {
			for (int j = 0; j < h; j++) {
				if (s[j][i] == '#') {
					b[i]++;
				}
			}
		}

		int[][] tmp = new int[n][3];
		for (int i = 0; i < n; i++) {
			if (b[cc[i].w] > 0) {
				b[cc[i].w]--;
				tmp[cc[i].i][0]++;
			} else if (b[cc[i].w + 1] > 0) {
				b[cc[i].w + 1]--;
				tmp[cc[i].i][1]++;
			} else if (b[cc[i].w + 2] > 0) {
				b[cc[i].w + 2]--;
				tmp[cc[i].i][2]++;
			}
		}

		for (int i = 0; i < n; i++) {
			for (int j = 0; j < 3; j++) {
				int btmp = Math.min(b[c[i] + j], 3 - tmp[i][j]);
				tmp[i][j] += btmp;
				b[c[i] + j] -= btmp;
			}
		}

		for (int i = 0; i < n; i++) {
			for (int j = 0; j < 3; j++) {
				StringBuilder sb = new StringBuilder();
				for (int k = 0; k < 3; k++) {
					if (tmp[i][k] > 0) {
						sb.append('#');
						tmp[i][k]--;
					} else {
						sb.append('.');
					}
				}
				pr.println(sb);
			}
		}
	}

	private static class Pair implements Comparable<Pair> {
		int i;
		int w;

		Pair(int a, int b) {
			this.i = a;
			this.w = b;
		}

		@Override
		public int compareTo(Pair o) {
			return Integer.compare(w, o.w);
		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0