結果

問題 No.785 色食い虫
ユーザー YukimotoPGYukimotoPG
提出日時 2019-03-11 12:59:38
言語 Java21
(openjdk 21)
結果
AC  
実行時間 54 ms / 2,000 ms
コード長 2,392 bytes
コンパイル時間 2,176 ms
コンパイル使用メモリ 78,144 KB
実行使用メモリ 50,308 KB
最終ジャッジ日時 2024-06-23 15:30:17
合計ジャッジ時間 4,729 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
50,168 KB
testcase_01 AC 51 ms
50,140 KB
testcase_02 AC 52 ms
49,888 KB
testcase_03 AC 51 ms
49,972 KB
testcase_04 AC 52 ms
50,064 KB
testcase_05 AC 51 ms
50,188 KB
testcase_06 AC 51 ms
50,160 KB
testcase_07 AC 50 ms
50,180 KB
testcase_08 AC 52 ms
50,148 KB
testcase_09 AC 53 ms
50,308 KB
testcase_10 AC 53 ms
50,212 KB
testcase_11 AC 53 ms
50,224 KB
testcase_12 AC 52 ms
50,100 KB
testcase_13 AC 52 ms
50,192 KB
testcase_14 AC 53 ms
49,816 KB
testcase_15 AC 53 ms
49,776 KB
testcase_16 AC 53 ms
49,936 KB
testcase_17 AC 54 ms
50,148 KB
testcase_18 AC 54 ms
49,832 KB
testcase_19 AC 52 ms
50,196 KB
testcase_20 AC 50 ms
50,024 KB
testcase_21 AC 50 ms
50,224 KB
testcase_22 AC 50 ms
49,836 KB
testcase_23 AC 52 ms
50,184 KB
testcase_24 AC 51 ms
49,820 KB
testcase_25 AC 53 ms
50,216 KB
testcase_26 AC 51 ms
50,248 KB
testcase_27 AC 52 ms
49,940 KB
testcase_28 AC 51 ms
50,128 KB
testcase_29 AC 51 ms
50,124 KB
testcase_30 AC 50 ms
50,308 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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

public class Main {

	void solve (FastScanner in, PrintWriter out) {
		
		long ans = 0;
		long[] ar = new long[3];
		for (int i=0; i<3; i++) {
			String s = in.next();
			if (s.equals("NONE")) ar[i] = 16;
			else {
				ar[i] = 16 - (s.length()+1)/2;
			}
		}
		out.println(ar[0]*ar[0]*ar[1]*ar[1]*ar[2]*ar[2]);
	}



	public static void main(String[] args) {
		FastScanner in = new FastScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		Main main = new Main();
		main.solve(in, out);
		in.close();
		out.close();
	}

	static class FastScanner {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private  int length = 0, p = 0;

		public FastScanner (InputStream stream) {
			in = stream;
		}
		public boolean hasNextByte () {
			if (p < length) return true;
			else {
				p = 0;
				try {length = in.read(buffer);}
				catch (Exception e) {e.printStackTrace();}
				if (length <= 0) return false;
			}
			return true;
		}
		public int readByte () {
			if (hasNextByte() == true) return buffer[p++];
			return -1;
		}
		public boolean isPrintable (int n) {return 33<=n&&n<=126;}
		public void skip () {
			while (hasNextByte() && !isPrintable(buffer[p])) p++;
		}
		public boolean hasNext () {skip(); return hasNextByte();}
		public String next () {
			if (!hasNext()) throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int t = readByte();
			while (isPrintable(t)) {
				sb.appendCodePoint(t);
				t = readByte();
			}
			return sb.toString();
		}
		public int nextInt () {return Math.toIntExact(nextLong());}
		public int[] nextIntArray (int n) {
			int[] ar = new int[n];
			for (int i=0; i<n; i++) ar[i] = nextInt();
			return ar;
		}
		public long nextLong () {
			if (!hasNext()) throw new NoSuchElementException();
			boolean minus = false;
			int temp = readByte();
			if (temp == '-') {
				minus = true;
				temp = readByte();
			}
			if (temp<'0' || '9'<temp) throw new NumberFormatException();
			long n = 0;
			while (isPrintable(temp)) {
				if ('0'<=temp && temp<='9') {
					n *= 10;
					n += temp - '0';
				}
				else throw new NumberFormatException();
				temp = readByte();
			}
			return minus? -n : n;
		}
		public double nextDouble () {
			return Double.parseDouble(next());
		}
		public void close () {
			try {in.close();}
			catch(Exception e){}
		}
	}

}
0