結果
問題 | No.606 カラフルタイル |
ユーザー |
![]() |
提出日時 | 2017-12-06 00:18:37 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 405 ms / 2,000 ms |
コード長 | 4,610 bytes |
コンパイル時間 | 2,377 ms |
コンパイル使用メモリ | 83,140 KB |
実行使用メモリ | 64,404 KB |
最終ジャッジ日時 | 2024-11-28 18:46:45 |
合計ジャッジ時間 | 8,799 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 |
ソースコード
import java.io.*;import java.util.*;import java.math.*;// import java.awt.Point;public class Main {InputStream is;PrintWriter out;String INPUT = "";long MOD = 1_000_000_007;int inf = Integer.MAX_VALUE;void solve(){int n = ni();int k = ni();int q = ni();String[] a = new String[q];int[] b = new int[q];int[] c = new int[q];for(int i = 0; i < q; i++){String[] s = ns().split(" ");a[i] = s[0];b[i] = Integer.parseInt(s[1])-1;c[i] = Integer.parseInt(s[2])-1;}boolean[] usedr = new boolean[n];boolean[] usedc = new boolean[n];int usedrsum = 0;int usedcsum = 0;long[] color = new long[k];for(int i = q-1; i >= 0; i--){if(a[i].equals("C")){if(usedc[b[i]]) continue;else{color[c[i]] += n-usedrsum;usedc[b[i]] = true;usedcsum += 1;}}else{if(usedr[b[i]]) continue;else{color[c[i]] += n-usedcsum;usedr[b[i]] = true;usedrsum += 1;}}}long sum = 0;for(int i = 1; i < k; i++){sum += color[i];}color[0] = (long)n*n-sum;for(int i = 0; i < k; i++){out.println(color[i]);}}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");}public static void main(String[] args) throws Exception { new Main().run(); }private byte[] inbuf = new byte[1024];private 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) && 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 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[] na(int n){int[] a = new int[n];for(int i = 0;i < n;i++)a[i] = ni();return a;}private int ni(){int num = 0, 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 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)); }}