結果
問題 | No.582 キャンディー・ボックス3 |
ユーザー | creep04 |
提出日時 | 2017-10-27 22:41:56 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,097 bytes |
コンパイル時間 | 2,363 ms |
コンパイル使用メモリ | 78,300 KB |
実行使用メモリ | 50,328 KB |
最終ジャッジ日時 | 2024-11-21 21:55:50 |
合計ジャッジ時間 | 3,849 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 48 ms
37,244 KB |
testcase_01 | AC | 49 ms
37,128 KB |
testcase_02 | AC | 47 ms
36,672 KB |
testcase_03 | AC | 49 ms
36,920 KB |
testcase_04 | AC | 48 ms
36,880 KB |
testcase_05 | AC | 48 ms
36,932 KB |
testcase_06 | AC | 48 ms
37,072 KB |
testcase_07 | AC | 48 ms
37,064 KB |
testcase_08 | AC | 48 ms
36,792 KB |
testcase_09 | AC | 49 ms
36,908 KB |
testcase_10 | AC | 48 ms
37,040 KB |
testcase_11 | WA | - |
testcase_12 | AC | 48 ms
36,792 KB |
testcase_13 | AC | 48 ms
37,092 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 48 ms
37,104 KB |
testcase_17 | AC | 48 ms
36,872 KB |
testcase_18 | AC | 48 ms
37,212 KB |
testcase_19 | AC | 49 ms
37,192 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { static IO io = new IO(); public static void main(String[] args) { int n = io.nextInt(); int c[] = new int[n]; int cnt = 0; boolean def = false; for (int i=0; i<n; i++) { c[i] = io.nextInt(); if (c[i]==2) cnt++; if (c[i]>=3) def=true; } if (cnt>=2 || def) System.out.println("B"); else System.out.println("A"); } static class IO extends PrintWriter { private final InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public IO() { this(System.in);} public IO(InputStream source) { super(System.out); this.in = source;} private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private static boolean isNewLine(int c) { return c == '\n' || c == '\r';} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} private void skipNewLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); return hasNextByte();} public boolean hasNextLine() { skipNewLine(); return hasNextByte();} public String next() { if (!hasNext()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public char[] nextCharArray(int len) { if (!hasNext()) { throw new NoSuchElementException(); } char[] s = new char[len]; int i = 0; int b = readByte(); while(isPrintableChar(b)) { if (i == len) { throw new InputMismatchException(); } s[i++] = (char) b; b = readByte(); } return s; } public String nextLine() { if (!hasNextLine()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(!isNewLine(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) { throw new NoSuchElementException(); } long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) { throw new NumberFormatException(); } return (int) nl; } public char nextChar() { if (!hasNext()) { throw new NoSuchElementException(); } return (char) readByte(); } public double nextDouble() { return Double.parseDouble(next());} public int[] arrayInt(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;} public long[] arrayLong(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;} public double[] arrayDouble(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;} public void arrayInt(int[]... a) {for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();} public int[][] matrixInt(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = arrayInt(m); return a;} public char[][] charMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;} public void close() { super.close(); try { in.close(); } catch (IOException e) {} } } }