結果

問題 No.601 Midpoint Erase
ユーザー yuya178yuya178
提出日時 2017-12-01 01:32:35
言語 Java
(openjdk 23)
結果
AC  
実行時間 105 ms / 2,000 ms
コード長 3,663 bytes
コンパイル時間 3,102 ms
コンパイル使用メモリ 91,240 KB
実行使用メモリ 38,148 KB
最終ジャッジ日時 2024-12-23 03:15:30
合計ジャッジ時間 6,236 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 60 ms
36,488 KB
testcase_01 AC 59 ms
36,944 KB
testcase_02 AC 61 ms
36,900 KB
testcase_03 AC 101 ms
37,880 KB
testcase_04 AC 102 ms
38,148 KB
testcase_05 AC 98 ms
37,884 KB
testcase_06 AC 97 ms
38,096 KB
testcase_07 AC 103 ms
38,096 KB
testcase_08 AC 97 ms
38,112 KB
testcase_09 AC 104 ms
37,864 KB
testcase_10 AC 85 ms
37,344 KB
testcase_11 AC 105 ms
38,008 KB
testcase_12 AC 104 ms
38,100 KB
testcase_13 AC 59 ms
36,768 KB
testcase_14 AC 59 ms
37,112 KB
testcase_15 AC 59 ms
36,752 KB
testcase_16 AC 57 ms
36,632 KB
testcase_17 AC 58 ms
36,744 KB
testcase_18 AC 58 ms
36,616 KB
testcase_19 AC 57 ms
36,908 KB
testcase_20 AC 58 ms
36,752 KB
testcase_21 AC 57 ms
37,032 KB
testcase_22 AC 60 ms
36,812 KB
testcase_23 AC 59 ms
36,508 KB
testcase_24 AC 57 ms
36,928 KB
testcase_25 AC 58 ms
36,832 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
public class Main {
InputStream is;
PrintWriter out;
String INPUT = "";
long MOD = 1_000_000_007;
void solve()
{
int n = ni();
int[] c = new int[4];
for(int i = 0; i < n; i++){
int a = ni();
int b = ni();
c[a%2*1 + b%2*2]++;
}
int ans = 0;
for(int i = 0; i < 4; i++){
if(c[i]>=2){
ans += c[i]/2;
}
}
out.println(ans%2==0 ? "Bob" : "Alice");
}
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");
}
public static void main(String[] args) throws Exception { new Main().run(); }
private byte[] inbuf = new byte[1024];
private 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) && 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 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[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private int ni()
{
int num = 0, 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 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)); }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0