結果

問題 No.785 色食い虫
ユーザー uwiuwi
提出日時 2019-02-08 21:24:41
言語 Java17
(openjdk 17.0.1)
結果
AC  
実行時間 197 ms / 2,000 ms
コード長 3,567 bytes
コンパイル時間 3,823 ms
使用メモリ 35,792 KB
最終ジャッジ日時 2023-01-28 14:25:07
合計ジャッジ時間 11,461 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 153 ms
35,032 KB
testcase_01 AC 127 ms
35,104 KB
testcase_02 AC 99 ms
34,680 KB
testcase_03 AC 167 ms
35,336 KB
testcase_04 AC 132 ms
35,204 KB
testcase_05 AC 175 ms
35,552 KB
testcase_06 AC 117 ms
34,724 KB
testcase_07 AC 188 ms
35,328 KB
testcase_08 AC 184 ms
35,256 KB
testcase_09 AC 171 ms
35,140 KB
testcase_10 AC 161 ms
35,364 KB
testcase_11 AC 102 ms
34,764 KB
testcase_12 AC 136 ms
35,568 KB
testcase_13 AC 173 ms
35,444 KB
testcase_14 AC 143 ms
35,248 KB
testcase_15 AC 142 ms
35,412 KB
testcase_16 AC 116 ms
35,212 KB
testcase_17 AC 166 ms
35,320 KB
testcase_18 AC 160 ms
35,340 KB
testcase_19 AC 156 ms
35,340 KB
testcase_20 AC 146 ms
35,472 KB
testcase_21 AC 138 ms
35,292 KB
testcase_22 AC 136 ms
35,292 KB
testcase_23 AC 142 ms
35,392 KB
testcase_24 AC 125 ms
35,316 KB
testcase_25 AC 139 ms
35,620 KB
testcase_26 AC 105 ms
35,076 KB
testcase_27 AC 135 ms
35,288 KB
testcase_28 AC 117 ms
35,264 KB
testcase_29 AC 158 ms
35,340 KB
testcase_30 AC 197 ms
35,792 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest190208;
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 B {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int r = to(ns());
		int g = to(ns());
		int b = to(ns());
		int ct = 0;
		for(int i = 0;i < 1<<24;i++) {
			if(
					b<<~(i&15)<0 ||
					b<<~(i>>>4&15)<0 ||
					g<<~(i>>>8&15)<0 ||
					g<<~(i>>>12&15)<0 ||
					r<<~(i>>>16&15)<0 ||
					r<<~(i>>>20&15)<0) {
			}else {
				ct++;
			}
		}
		out.println(ct);
	}
	
	int to(String x)
	{
		if(x.equals("NONE"))return 0;
		int ret = 0;
		for(String u : x.split(",")) {
			char c = u.charAt(0);
			if(c >= '0' && c <= '9') {
				ret |= 1<<c-'0';
			}else {
				ret |= 1<<c-'A'+10;
			}
		}
		return ret;
	}
	
	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 B().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