結果
問題 | No.2282 Boxed Nim |
ユーザー | Asahi |
提出日時 | 2023-04-28 21:59:55 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 182 ms / 2,000 ms |
コード長 | 3,953 bytes |
コンパイル時間 | 2,396 ms |
コンパイル使用メモリ | 79,776 KB |
実行使用メモリ | 41,944 KB |
最終ジャッジ日時 | 2024-04-28 23:35:41 |
合計ジャッジ時間 | 6,541 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 126 ms
41,160 KB |
testcase_01 | AC | 110 ms
40,124 KB |
testcase_02 | AC | 110 ms
40,088 KB |
testcase_03 | AC | 130 ms
41,200 KB |
testcase_04 | AC | 130 ms
41,248 KB |
testcase_05 | AC | 127 ms
41,244 KB |
testcase_06 | AC | 127 ms
41,272 KB |
testcase_07 | AC | 131 ms
40,876 KB |
testcase_08 | AC | 131 ms
41,144 KB |
testcase_09 | AC | 179 ms
41,612 KB |
testcase_10 | AC | 182 ms
41,812 KB |
testcase_11 | AC | 175 ms
41,560 KB |
testcase_12 | AC | 180 ms
41,776 KB |
testcase_13 | AC | 175 ms
41,684 KB |
testcase_14 | AC | 170 ms
41,944 KB |
testcase_15 | AC | 168 ms
41,428 KB |
testcase_16 | AC | 172 ms
41,460 KB |
testcase_17 | AC | 166 ms
41,824 KB |
testcase_18 | AC | 175 ms
41,880 KB |
testcase_19 | AC | 181 ms
41,600 KB |
ソースコード
import java.util.*; import java.io.*; import java.math.*; class Main{ void solver(){ int n = in.ni(); int [] A = in.IntArray(n); int zero = 0; for(int i = 0 ; i < n ; i ++ ) { if(A[i] == 0) zero++; } out.print(zero%2==0?"Second":"First"); } public static void main(String[] args){ out = new PrintWriter(System.out); in = new In(); new Main().solver(); out.flush(); } private static PrintWriter out ; private static In in ; } class In{ private final InputStream in = System.in; private static Scanner sc = new Scanner(System.in); private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; 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;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} String ns() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } long nl() { 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(); } } int ni() { long nl = nl(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } double nd() { return Double.parseDouble(ns()); } BigInteger bi() { return sc.nextBigInteger(); } BigDecimal bd() { return sc.nextBigDecimal(); } int [] IntArray(int n) { final int [] Array = new int [n]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = ni(); } return Array; } int [][] IntArray(int n , int m) { final int [][] Array = new int [n][m]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = IntArray(m); } return Array; } long [] LongArray(int n) { final long [] Array = new long [n]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = nl(); } return Array; } long [][] LongArray(int n , int m) { final long [][] Array = new long [n][m]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = LongArray(m); } return Array; } String [] StringArray(int n) { final String [] Array = new String [n]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = ns(); } return Array; } char [][] CharArray(int n , int m) { final char [][] Array = new char [n][m]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = ns().toCharArray(); } return Array; } }