結果

問題 No.1506 Unbalanced Pocky Game
ユーザー shojin_proshojin_pro
提出日時 2021-05-14 22:46:22
言語 Java17
(openjdk 17.0.1)
結果
AC  
実行時間 210 ms / 2,000 ms
コード長 3,607 bytes
コンパイル時間 2,797 ms
使用メモリ 44,800 KB
最終ジャッジ日時 2022-11-25 20:22:55
合計ジャッジ時間 14,645 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 42 ms
34,216 KB
testcase_01 AC 42 ms
34,284 KB
testcase_02 AC 42 ms
34,328 KB
testcase_03 AC 71 ms
35,588 KB
testcase_04 AC 116 ms
41,160 KB
testcase_05 AC 137 ms
41,508 KB
testcase_06 AC 140 ms
40,908 KB
testcase_07 AC 129 ms
40,804 KB
testcase_08 AC 139 ms
40,720 KB
testcase_09 AC 173 ms
42,152 KB
testcase_10 AC 169 ms
41,492 KB
testcase_11 AC 149 ms
40,912 KB
testcase_12 AC 132 ms
40,444 KB
testcase_13 AC 113 ms
38,124 KB
testcase_14 AC 128 ms
40,948 KB
testcase_15 AC 140 ms
39,816 KB
testcase_16 AC 168 ms
41,220 KB
testcase_17 AC 138 ms
40,628 KB
testcase_18 AC 122 ms
39,204 KB
testcase_19 AC 111 ms
38,848 KB
testcase_20 AC 165 ms
41,900 KB
testcase_21 AC 133 ms
40,604 KB
testcase_22 AC 157 ms
41,024 KB
testcase_23 AC 42 ms
34,320 KB
testcase_24 AC 46 ms
34,324 KB
testcase_25 AC 169 ms
42,120 KB
testcase_26 AC 184 ms
43,500 KB
testcase_27 AC 210 ms
43,800 KB
testcase_28 AC 194 ms
44,636 KB
testcase_29 AC 202 ms
44,016 KB
testcase_30 AC 192 ms
44,800 KB
testcase_31 AC 194 ms
43,948 KB
testcase_32 AC 193 ms
43,964 KB
testcase_33 AC 191 ms
44,184 KB
testcase_34 AC 181 ms
43,236 KB
testcase_35 AC 187 ms
44,628 KB
testcase_36 AC 45 ms
34,144 KB
testcase_37 AC 47 ms
34,476 KB
testcase_38 AC 44 ms
34,112 KB
testcase_39 AC 42 ms
34,348 KB
testcase_40 AC 42 ms
34,344 KB
testcase_41 AC 44 ms
34,404 KB
testcase_42 AC 44 ms
34,176 KB
testcase_43 AC 45 ms
34,212 KB
testcase_44 AC 47 ms
34,140 KB
testcase_45 AC 43 ms
34,404 KB
testcase_46 AC 157 ms
40,556 KB
testcase_47 AC 115 ms
37,824 KB
testcase_48 AC 139 ms
38,308 KB
testcase_49 AC 159 ms
40,884 KB
testcase_50 AC 147 ms
40,332 KB
testcase_51 AC 168 ms
40,984 KB
testcase_52 AC 152 ms
40,360 KB
testcase_53 AC 170 ms
41,676 KB
testcase_54 AC 136 ms
38,760 KB
testcase_55 AC 126 ms
37,832 KB
testcase_56 AC 120 ms
38,488 KB
testcase_57 AC 165 ms
40,984 KB
testcase_58 AC 126 ms
37,680 KB
testcase_59 AC 99 ms
36,388 KB
testcase_60 AC 144 ms
39,224 KB
testcase_61 AC 159 ms
41,052 KB
testcase_62 AC 150 ms
40,344 KB
testcase_63 AC 140 ms
39,256 KB
testcase_64 AC 160 ms
41,104 KB
testcase_65 AC 145 ms
38,792 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    static long mod = (long) 1e9 + 7;

    public static void main(String[] args) throws Exception {
        solve();
        pw.flush();
    }

    public static void solve() {
        int n = sc.nextInt();
        int[] a = sc.nextIntArray(n);
        boolean isAlice = true;
        boolean isLast = true;
        for(int i = n-1; i >= 0; i--){
            if(a[i] != 1){
                isLast = false;
                break;
            }
            isAlice = !isAlice;
        }
        if(isLast) isAlice = !isAlice;
        pw.println(isAlice ? "Alice" : "Bob");
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
0