結果

問題 No.459 C-VS for yukicoder
ユーザー GrenacheGrenache
提出日時 2016-12-10 08:37:19
言語 Java
(openjdk 23)
結果
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
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 58
権限があれば一括ダウンロードができます

ソースコード

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