結果
問題 | No.606 カラフルタイル |
ユーザー | tenten |
提出日時 | 2023-04-07 11:58:12 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 455 ms / 2,000 ms |
コード長 | 2,694 bytes |
コンパイル時間 | 2,732 ms |
コンパイル使用メモリ | 88,580 KB |
実行使用メモリ | 58,664 KB |
最終ジャッジ日時 | 2024-04-10 16:12:28 |
合計ジャッジ時間 | 10,197 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 65 ms
38,144 KB |
testcase_01 | AC | 65 ms
38,028 KB |
testcase_02 | AC | 64 ms
37,676 KB |
testcase_03 | AC | 65 ms
38,360 KB |
testcase_04 | AC | 67 ms
38,120 KB |
testcase_05 | AC | 65 ms
37,824 KB |
testcase_06 | AC | 65 ms
37,780 KB |
testcase_07 | AC | 66 ms
37,868 KB |
testcase_08 | AC | 65 ms
37,912 KB |
testcase_09 | AC | 64 ms
38,020 KB |
testcase_10 | AC | 66 ms
37,888 KB |
testcase_11 | AC | 64 ms
38,088 KB |
testcase_12 | AC | 68 ms
38,008 KB |
testcase_13 | AC | 158 ms
44,508 KB |
testcase_14 | AC | 65 ms
37,620 KB |
testcase_15 | AC | 97 ms
39,108 KB |
testcase_16 | AC | 277 ms
48,164 KB |
testcase_17 | AC | 428 ms
58,664 KB |
testcase_18 | AC | 330 ms
52,148 KB |
testcase_19 | AC | 346 ms
52,580 KB |
testcase_20 | AC | 455 ms
58,072 KB |
testcase_21 | AC | 340 ms
52,144 KB |
testcase_22 | AC | 355 ms
52,128 KB |
testcase_23 | AC | 381 ms
51,428 KB |
testcase_24 | AC | 425 ms
55,400 KB |
testcase_25 | AC | 362 ms
51,408 KB |
testcase_26 | AC | 438 ms
57,516 KB |
testcase_27 | AC | 432 ms
58,192 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); long n = sc.nextInt(); int k = sc.nextInt(); int q = sc.nextInt(); boolean[] isRow = new boolean[q]; int[] idxes = new int[q]; int[] colors = new int[q]; for (int i = 0; i < q; i++) { isRow[i] = (sc.next().charAt(0) == 'R'); idxes[i] = sc.nextInt(); colors[i] = sc.nextInt() - 1; } long[] ans = new long[k]; ans[0] = n * n; HashSet<Integer> rUsed = new HashSet<>(); HashSet<Integer> cUsed = new HashSet<>(); for (int i = q - 1; i >= 0; i--) { if (isRow[i]) { if (rUsed.contains(idxes[i])) { continue; } rUsed.add(idxes[i]); long count = n - cUsed.size(); ans[0] -= count; ans[colors[i]] += count; } else { if (cUsed.contains(idxes[i])) { continue; } cUsed.add(idxes[i]); long count = n - rUsed.size(); ans[0] -= count; ans[colors[i]] += count; } } System.out.println(String.join("\n", Arrays.stream(ans).mapToObj(String::valueOf).toArray(String[]::new))); } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }