Submission #11562983
Source Code Expand
// https://atcoder.jp/contests/agc003/tasks/agc003_b
//
#![allow(unused_imports)]
use std::io::*;
use std::io::Write;
use std::fmt::*;
use std::str::*;
use std::cmp::*;
use std::collections::*;
// Input macros.
// Original by tanakh: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[allow(unused_macros)]
macro_rules! input {
(source = $s:expr, $($r:tt)*) => {
let mut iter = $s.split_whitespace();
input_inner!{iter, $($r)*}
};
($($r:tt)*) => {
let s = {
use std::io::Read;
let mut s = String::new();
std::io::stdin().read_to_string(&mut s).unwrap();
s
};
let mut iter = s.split_whitespace();
input_inner!{iter, $($r)*}
};
}
#[allow(unused_macros)]
macro_rules! input_inner {
($iter:expr) => {};
($iter:expr, ) => {};
($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
let $var = read_value!($iter, $t);
input_inner!{$iter $($r)*}
};
($iter:expr, mut $var:ident : $t:tt $($r:tt)*) => {
let mut $var = read_value!($iter, $t);
input_inner!{$iter $($r)*}
};
}
#[allow(unused_macros)]
macro_rules! read_value {
($iter:expr, ( $($t:tt),* )) => {
( $(read_value!($iter, $t)),* )
};
($iter:expr, [ $t:tt ; $len:expr ]) => {
(0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
};
($iter:expr, [ next / $t:tt ]) => {
{
let len = read_value!($iter, usize);
(0..len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
}
};
($iter:expr, switch) => {
{
let ty = read_value!($iter, i32);
if ty == 1 {
vec![ty, read_value!($iter, i32), read_value!($iter, i32)]
} else if ty == 2 {
vec![ty, read_value!($iter, i32)]
} else {
vec![ty, read_value!($iter, i32)]
}
}
};
($iter:expr, chars) => {
read_value!($iter, String).chars().collect::<Vec<char>>()
};
($iter:expr, usize1) => {
read_value!($iter, usize) - 1
};
($iter:expr, $t:ty) => {
$iter.next().unwrap().parse::<$t>().expect("Parse error")
};
}
#[allow(unused_macros)]
macro_rules! read_line {
($t:tt) => {
{
let mut s = String::new();
std::io::stdin().read_line(&mut s).unwrap();
s.trim_right().parse::<$t>().unwrap()
}
}
}
#[allow(unused_macros)]
macro_rules! dvec {
($t:expr ; $len:expr) => {
vec![$t; $len]
};
($t:expr ; $len:expr, $($rest:expr),*) => {
vec![dvec!($t; $($rest),*); $len]
};
}
#[allow(unused_macros)]
macro_rules! ifv {
($t:expr, $a:expr, $b: expr) => {
if $t { $a } else { $b }
}
}
#[allow(unused_macros)]
macro_rules! fill {
($t:expr, $v:expr) => {
for i in 0..$t.len() {
$t[i] = $v;
}
};
}
#[allow(unused_macros)]
macro_rules! join {
($t:expr, $glue:expr) => {
$t.into_iter().map(|w| w.to_string()).collect::<Vec<_>>().join($glue)
};
}
#[allow(unused_macros)]
macro_rules! debug {
($($a:expr),*) => {
println!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
}
}
// ===
fn main() {
input! {
n: usize, a: [i64; n]
};
let mut ans = 0;
let mut dp = dvec!(-1; n+1, 2);
dp[0][0] = 0;
for i in 0..n {
for j in 0..2 {
let base = dp[i][j];
if base == -1 {
continue;
}
for k in 0..2 {
let left = a[i]-(j as i64)-(k as i64);
if left < 0 {
continue;
}
let to = base+left/2+(j as i64);
dp[i+1][k] = max(dp[i+1][k], to);
}
}
}
println!("{}", max(dp[n][0], dp[n][1]));
}
Submission Info
Submission Time
2020-04-05 10:46:54+0900
Task
B - Simplified mahjong
User
hamadu
Language
Rust (1.15.1)
Score
400
Code Size
3894 Byte
Status
AC
Exec Time
18 ms
Memory
12540 KB
Compile Error
warning: unused variable: `ans`, #[warn(unused_variables)] on by default
--> ./Main.rs:148:9
|
148 | let mut ans = 0;
| ^^^^^^^
warning: variable does not need to be mutable, #[warn(unused_mut)] on by default
--> ./Main.rs:148:9
|
148 | let mut ans = 0;
| ^^^^^^^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
400 / 400
Status
Set Name
Test Cases
Sample
s1.txt, s2.txt
All
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, s1.txt, s2.txt
Case Name
Status
Exec Time
Memory
01.txt
AC
17 ms
10492 KB
02.txt
AC
17 ms
10492 KB
03.txt
AC
17 ms
10492 KB
04.txt
AC
15 ms
10492 KB
05.txt
AC
15 ms
10492 KB
06.txt
AC
15 ms
10492 KB
07.txt
AC
16 ms
10492 KB
08.txt
AC
16 ms
10492 KB
09.txt
AC
17 ms
10492 KB
10.txt
AC
17 ms
10492 KB
11.txt
AC
12 ms
10492 KB
12.txt
AC
18 ms
12540 KB
13.txt
AC
17 ms
10492 KB
14.txt
AC
17 ms
10492 KB
15.txt
AC
12 ms
10492 KB
16.txt
AC
17 ms
10492 KB
17.txt
AC
17 ms
10492 KB
18.txt
AC
2 ms
4352 KB
19.txt
AC
2 ms
4352 KB
20.txt
AC
2 ms
4352 KB
21.txt
AC
2 ms
4352 KB
22.txt
AC
2 ms
4352 KB
s1.txt
AC
2 ms
4352 KB
s2.txt
AC
2 ms
4352 KB