結果

問題 No.606 カラフルタイル
ユーザー uwiuwi
提出日時 2017-12-06 00:03:20
言語 Java21
(openjdk 21)
結果
AC  
実行時間 221 ms / 2,000 ms
コード長 3,654 bytes
コンパイル時間 5,889 ms
コンパイル使用メモリ 84,704 KB
実行使用メモリ 49,768 KB
最終ジャッジ日時 2024-11-28 17:57:57
合計ジャッジ時間 10,179 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
36,932 KB
testcase_01 AC 51 ms
36,896 KB
testcase_02 AC 51 ms
37,276 KB
testcase_03 AC 51 ms
36,792 KB
testcase_04 AC 52 ms
37,012 KB
testcase_05 AC 51 ms
36,736 KB
testcase_06 AC 51 ms
36,724 KB
testcase_07 AC 51 ms
36,992 KB
testcase_08 AC 50 ms
36,940 KB
testcase_09 AC 54 ms
36,852 KB
testcase_10 AC 51 ms
36,736 KB
testcase_11 AC 51 ms
36,660 KB
testcase_12 AC 51 ms
36,876 KB
testcase_13 AC 61 ms
37,300 KB
testcase_14 AC 54 ms
37,196 KB
testcase_15 AC 53 ms
36,968 KB
testcase_16 AC 102 ms
42,596 KB
testcase_17 AC 220 ms
49,428 KB
testcase_18 AC 117 ms
46,208 KB
testcase_19 AC 118 ms
46,036 KB
testcase_20 AC 217 ms
49,000 KB
testcase_21 AC 123 ms
46,076 KB
testcase_22 AC 122 ms
46,092 KB
testcase_23 AC 155 ms
46,092 KB
testcase_24 AC 195 ms
48,344 KB
testcase_25 AC 197 ms
48,120 KB
testcase_26 AC 221 ms
49,768 KB
testcase_27 AC 219 ms
49,444 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2017;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class N606 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), K = ni(), Q = ni();
		int[][] qs = new int[Q][];
		for(int z = 0;z < Q;z++){
			qs[z] = new int[]{nc(), ni()-1, ni()};
		}
		int fr = 0, fc = 0;
		boolean[] frs = new boolean[n];
		boolean[] fcs = new boolean[n];
		long[] anss = new long[K+1];
		anss[1] = (long)n*n;
		for(int i = Q-1;i >= 0;i--){
			int[] q = qs[i];
			if(q[0] == 'R'){
				if(frs[q[1]])continue;
				frs[q[1]] = true;
				anss[q[2]] += n-fc;
				anss[1] -= n-fc;
				fr++;
			}else{
				if(fcs[q[1]])continue;
				fcs[q[1]] = true;
				anss[q[2]] += n-fr;
				anss[1] -= n-fr;
				fc++;
			}
		}
		for(int i = 1;i <= K;i++){
			out.println(anss[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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new N606().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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))){ // when nextLine, (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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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)); }
}
0