結果
問題 | No.1506 Unbalanced Pocky Game |
ユーザー |
![]() |
提出日時 | 2021-05-14 22:21:19 |
言語 | Rust (1.59.0) |
結果 |
AC
|
実行時間 | 10 ms / 2,000 ms |
コード長 | 5,289 bytes |
コンパイル時間 | 1,932 ms |
使用メモリ | 5,612 KB |
最終ジャッジ日時 | 2022-11-25 19:09:26 |
合計ジャッジ時間 | 3,013 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
1,964 KB |
testcase_01 | AC | 1 ms
1,912 KB |
testcase_02 | AC | 0 ms
1,972 KB |
testcase_03 | AC | 1 ms
2,112 KB |
testcase_04 | AC | 3 ms
3,068 KB |
testcase_05 | AC | 4 ms
3,760 KB |
testcase_06 | AC | 2 ms
2,772 KB |
testcase_07 | AC | 2 ms
2,492 KB |
testcase_08 | AC | 3 ms
2,804 KB |
testcase_09 | AC | 4 ms
3,816 KB |
testcase_10 | AC | 4 ms
3,736 KB |
testcase_11 | AC | 2 ms
2,544 KB |
testcase_12 | AC | 2 ms
2,492 KB |
testcase_13 | AC | 2 ms
2,164 KB |
testcase_14 | AC | 2 ms
2,468 KB |
testcase_15 | AC | 2 ms
2,492 KB |
testcase_16 | AC | 4 ms
3,756 KB |
testcase_17 | AC | 3 ms
2,592 KB |
testcase_18 | AC | 2 ms
2,384 KB |
testcase_19 | AC | 2 ms
2,288 KB |
testcase_20 | AC | 4 ms
3,764 KB |
testcase_21 | AC | 2 ms
2,440 KB |
testcase_22 | AC | 2 ms
2,684 KB |
testcase_23 | AC | 1 ms
1,860 KB |
testcase_24 | AC | 1 ms
1,848 KB |
testcase_25 | AC | 5 ms
4,424 KB |
testcase_26 | AC | 10 ms
5,612 KB |
testcase_27 | AC | 10 ms
5,436 KB |
testcase_28 | AC | 10 ms
5,512 KB |
testcase_29 | AC | 10 ms
5,420 KB |
testcase_30 | AC | 10 ms
5,596 KB |
testcase_31 | AC | 10 ms
5,556 KB |
testcase_32 | AC | 9 ms
5,504 KB |
testcase_33 | AC | 9 ms
5,544 KB |
testcase_34 | AC | 10 ms
5,560 KB |
testcase_35 | AC | 10 ms
5,488 KB |
testcase_36 | AC | 1 ms
1,928 KB |
testcase_37 | AC | 1 ms
2,004 KB |
testcase_38 | AC | 1 ms
2,072 KB |
testcase_39 | AC | 0 ms
1,960 KB |
testcase_40 | AC | 1 ms
1,924 KB |
testcase_41 | AC | 1 ms
1,936 KB |
testcase_42 | AC | 1 ms
2,004 KB |
testcase_43 | AC | 1 ms
1,924 KB |
testcase_44 | AC | 1 ms
1,972 KB |
testcase_45 | AC | 1 ms
1,956 KB |
testcase_46 | AC | 4 ms
3,104 KB |
testcase_47 | AC | 2 ms
2,240 KB |
testcase_48 | AC | 2 ms
2,268 KB |
testcase_49 | AC | 5 ms
3,280 KB |
testcase_50 | AC | 5 ms
3,248 KB |
testcase_51 | AC | 4 ms
3,244 KB |
testcase_52 | AC | 3 ms
2,708 KB |
testcase_53 | AC | 6 ms
3,572 KB |
testcase_54 | AC | 2 ms
2,540 KB |
testcase_55 | AC | 2 ms
2,228 KB |
testcase_56 | AC | 2 ms
2,168 KB |
testcase_57 | AC | 4 ms
3,264 KB |
testcase_58 | AC | 2 ms
2,332 KB |
testcase_59 | AC | 1 ms
2,044 KB |
testcase_60 | AC | 2 ms
2,432 KB |
testcase_61 | AC | 4 ms
3,148 KB |
testcase_62 | AC | 3 ms
2,576 KB |
testcase_63 | AC | 3 ms
2,576 KB |
testcase_64 | AC | 5 ms
3,264 KB |
testcase_65 | AC | 3 ms
2,504 KB |
コンパイルメッセージ
warning: unnecessary parentheses around type --> Main.rs:70:15 | 70 | fn readi() -> (i64) { | ^ ^ | = note: `#[warn(unused_parens)]` on by default help: remove these parentheses | 70 - fn readi() -> (i64) { 70 + fn readi() -> i64 { | warning: unnecessary parentheses around `while` condition --> Main.rs:183:11 | 183 | while (!vec.is_empty()) { | ^ ^ | help: remove these parentheses | 183 - while (!vec.is_empty()) { 183 + while !vec.is_empty() { | warning: unused variable: `n` --> Main.rs:180:9 | 180 | let n: usize = read(); | ^ help: if this is intentional, prefix it with an underscore: `_n` | = note: `#[warn(unused_variables)]` on by default warning: variable does not need to be mutable --> Main.rs:190:9 | 190 | let mut x = vec.last(); | ----^ | | | help: remove this `mut` | = note: `#[warn(unused_mut)]` on by default warning: 4 warnings emitted
ソースコード
// -*- coding:utf-8-unix -*- // #![feature(map_first_last)] #![allow(dead_code)] #![allow(unused_imports)] #![allow(unused_macros)] use std::collections::*; use std::convert::*; use std::convert::{From, Into}; use std::fmt::Debug; use std::fs::File; use std::io::prelude::*; use std::io::*; use std::marker::Copy; use std::mem::*; use std::ops::Bound::*; use std::ops::{Add, Mul, Neg, Sub}; use std::str; use std::vec; use std::{cmp, process::Output}; use std::{cmp::Ordering, env::consts::DLL_PREFIX}; use std::{cmp::Ordering::*, f32::consts::PI}; const INF: i64 = 1223372036854775807; const UINF: usize = INF as usize; const FINF: f64 = 122337203685.0; const INF128: i128 = 1223372036854775807000000000000; const LINF: i64 = 2147483647; const MOD: i64 = 1000000007; // const MOD: i64 = 998244353; const UMOD: usize = MOD as usize; use std::cmp::*; use std::collections::*; use std::io::stdin; use std::io::stdout; use std::io::Write; macro_rules! p { ($x:expr) => { println!("{}", $x); }; } macro_rules! d { ($x:expr) => { dbg!($x); }; } macro_rules! v { ($x:expr) => { if $x == 0 { vec![]; } else if $x == 1 { BTreeSet::new(); } else if $x == 2 { BTreeMap::new(); } }; } // use str::Chars; #[allow(dead_code)] fn read<T: std::str::FromStr>() -> T { let mut s = String::new(); std::io::stdin().read_line(&mut s).ok(); s.trim().parse().ok().unwrap() } #[allow(dead_code)] fn readi() -> (i64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); iter.next().unwrap().parse::<i64>().unwrap() } #[allow(dead_code)] fn read_vec<T: std::str::FromStr>() -> Vec<T> { read::<String>() .split_whitespace() .map(|e| e.parse().ok().unwrap()) .collect() } #[allow(dead_code)] fn read_vec2<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> { (0..n).map(|_| read_vec()).collect() } #[allow(dead_code)] fn readii() -> (i64, i64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), ) } fn readff() -> (f64, f64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<f64>().unwrap(), iter.next().unwrap().parse::<f64>().unwrap(), ) } #[allow(dead_code)] fn readiii() -> (i64, i64, i64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), ) } #[allow(dead_code)] fn readuu() -> (usize, usize) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), ) } fn readcc() -> (char, char) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<char>().unwrap(), iter.next().unwrap().parse::<char>().unwrap(), ) } #[allow(dead_code)] fn readuuu() -> (usize, usize, usize) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), ) } #[allow(dead_code)] fn readuuuu() -> (usize, usize, usize, usize) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), ) } fn readiiii() -> (i64, i64, i64, i64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), ) } fn solve() { let n: usize = read(); let mut vec: Vec<usize> = read_vec(); let mut cnt = 0 as usize; while (!vec.is_empty()) { if *vec.last().unwrap() != 1 { break; } cnt += 1; vec.pop(); } let mut x = vec.last(); if x == None { if cnt % 2 == 1 { p!("Alice"); } else { p!("Bob"); } return; } if (*x.unwrap() > 1) ^ ((cnt) % 2 == 1) { p!("Alice"); } else { p!("Bob"); } return; } fn main() { solve(); }