結果

問題 No.606 カラフルタイル
ユーザー GrenacheGrenache
提出日時 2017-12-12 19:07:05
言語 Java21
(openjdk 21)
結果
AC  
実行時間 348 ms / 2,000 ms
コード長 4,586 bytes
コンパイル時間 3,925 ms
コンパイル使用メモリ 77,980 KB
実行使用メモリ 63,940 KB
最終ジャッジ日時 2024-12-14 06:21:16
合計ジャッジ時間 10,124 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 57 ms
50,372 KB
testcase_01 AC 56 ms
50,188 KB
testcase_02 AC 57 ms
50,432 KB
testcase_03 AC 57 ms
50,188 KB
testcase_04 AC 56 ms
50,220 KB
testcase_05 AC 57 ms
50,388 KB
testcase_06 AC 55 ms
50,208 KB
testcase_07 AC 58 ms
49,876 KB
testcase_08 AC 56 ms
50,416 KB
testcase_09 AC 56 ms
50,000 KB
testcase_10 AC 56 ms
50,352 KB
testcase_11 AC 58 ms
50,260 KB
testcase_12 AC 58 ms
50,580 KB
testcase_13 AC 114 ms
52,380 KB
testcase_14 AC 58 ms
49,956 KB
testcase_15 AC 84 ms
50,948 KB
testcase_16 AC 211 ms
60,064 KB
testcase_17 AC 344 ms
63,620 KB
testcase_18 AC 223 ms
60,636 KB
testcase_19 AC 222 ms
60,684 KB
testcase_20 AC 348 ms
63,740 KB
testcase_21 AC 235 ms
60,424 KB
testcase_22 AC 230 ms
60,540 KB
testcase_23 AC 277 ms
61,152 KB
testcase_24 AC 322 ms
63,096 KB
testcase_25 AC 319 ms
63,168 KB
testcase_26 AC 347 ms
63,940 KB
testcase_27 AC 344 ms
63,800 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


public class Main_yukicoder606 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();
		int k = sc.nextInt();
		int q = sc.nextInt();

		String[] a = new String[q];
		int[] b = new int[q];
		int[] c = new int[q];
		for (int i = 0; i < q; i++) {
			a[i] = sc.next();
			b[i] = sc.nextInt() - 1;
			c[i] = sc.nextInt() - 1;
		}

		long[] cnt = new long[k];
		boolean[] rr = new boolean[n];
		boolean[] cc = new boolean[n];
		int nr = n;
		int nc = n;
		for (int i = q - 1; i >= 0; i--) {
			if (a[i].charAt(0) == 'R' && !rr[b[i]]) {
				cnt[c[i]] += nc;
				rr[b[i]] = true;
				nr--;
			} else if (a[i].charAt(0) == 'C' && !cc[b[i]]) {
				cnt[c[i]] += nr;
				cc[b[i]] = true;
				nc--;
			}
		}

		cnt[0] += (long)nr * nc;

		for (int i = 0; i < k; i++) {
			pr.println(cnt[i]);
		}
	}

	// ---------------------------------------------------
	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