Submission #2215748
Source Code Expand
/**
* _ _ __ _ _ _ _ _ _ _
* | | | | / / | | (_) | (_) | | (_) | |
* | |__ __ _| |_ ___ ___ / /__ ___ _ __ ___ _ __ ___| |_ _| |_ ___ _____ ______ _ __ _ _ ___| |_ ______ ___ _ __ _ _ __ _ __ ___| |_ ___
* | '_ \ / _` | __/ _ \ / _ \ / / __/ _ \| '_ ` _ \| '_ \ / _ \ __| | __| \ \ / / _ \______| '__| | | / __| __|______/ __| '_ \| | '_ \| '_ \ / _ \ __/ __|
* | | | | (_| | || (_) | (_) / / (_| (_) | | | | | | |_) | __/ |_| | |_| |\ V / __/ | | | |_| \__ \ |_ \__ \ | | | | |_) | |_) | __/ |_\__ \
* |_| |_|\__,_|\__\___/ \___/_/ \___\___/|_| |_| |_| .__/ \___|\__|_|\__|_| \_/ \___| |_| \__,_|___/\__| |___/_| |_|_| .__/| .__/ \___|\__|___/
* | | | | | |
* |_| |_| |_|
*
* https://github.com/hatoo/competitive-rust-snippets
*/
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
mod util {
use std::io::{stdin, stdout, BufWriter, StdoutLock};
use std::str::FromStr;
use std::fmt::Debug;
#[allow(dead_code)]
pub fn line() -> String {
let mut line: String = String::new();
stdin().read_line(&mut line).unwrap();
line.trim().to_string()
}
#[allow(dead_code)]
pub fn chars() -> Vec<char> {
line().chars().collect()
}
#[allow(dead_code)]
pub fn gets<T: FromStr>() -> Vec<T>
where
<T as FromStr>::Err: Debug,
{
let mut line: String = String::new();
stdin().read_line(&mut line).unwrap();
line.split_whitespace()
.map(|t| t.parse().unwrap())
.collect()
}
#[allow(dead_code)]
pub fn with_bufwriter<F: FnOnce(BufWriter<StdoutLock>) -> ()>(f: F) {
let out = stdout();
let writer = BufWriter::new(out.lock());
f(writer)
}
}
#[allow(unused_macros)]
macro_rules ! get { ( $ t : ty ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . trim ( ) . parse ::<$ t > ( ) . unwrap ( ) } } ; ( $ ( $ t : ty ) ,* ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; let mut iter = line . split_whitespace ( ) ; ( $ ( iter . next ( ) . unwrap ( ) . parse ::<$ t > ( ) . unwrap ( ) , ) * ) } } ; ( $ t : ty ; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ ( $ t : ty ) ,*; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ ( $ t ) ,* ) ) . collect ::< Vec < _ >> ( ) } ; ( $ t : ty ;; ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . split_whitespace ( ) . map ( | t | t . parse ::<$ t > ( ) . unwrap ( ) ) . collect ::< Vec < _ >> ( ) } } ; ( $ t : ty ;; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ;; ) ) . collect ::< Vec < _ >> ( ) } ; }
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
const BIG_STACK_SIZE: bool = true;
#[allow(dead_code)]
fn main() {
use std::thread;
if BIG_STACK_SIZE {
thread::Builder::new()
.stack_size(32 * 1024 * 1024)
.name("solve".into())
.spawn(solve)
.unwrap()
.join()
.unwrap();
} else {
solve();
}
}
fn solve() {
let (n, m) = get!(usize, usize);
let abc = get!(usize, usize, i64; m);
let mut ds = vec![-(1 << 60); n + 1];
ds[1] = 0;
for i in 0..n {
for &(a, b, c) in &abc {
if ds[b] < ds[a] + c {
ds[b] = ds[a] + c;
if b == n && i == n - 1 {
println!("inf");
return;
}
}
}
}
println!("{}", ds[n]);
}
Submission Info
Submission Time |
|
Task |
D - Score Attack |
User |
hatoo |
Language |
Rust (1.15.1) |
Score |
400 |
Code Size |
4582 Byte |
Status |
AC |
Exec Time |
13 ms |
Memory |
8572 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 400 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
3 ms |
8572 KB |
sample_02.txt |
AC |
3 ms |
8572 KB |
sample_03.txt |
AC |
3 ms |
8572 KB |
subtask_1_1.txt |
AC |
3 ms |
8572 KB |
subtask_1_10.txt |
AC |
3 ms |
8572 KB |
subtask_1_11.txt |
AC |
4 ms |
8572 KB |
subtask_1_12.txt |
AC |
7 ms |
8572 KB |
subtask_1_13.txt |
AC |
3 ms |
8572 KB |
subtask_1_14.txt |
AC |
6 ms |
8572 KB |
subtask_1_15.txt |
AC |
13 ms |
8572 KB |
subtask_1_16.txt |
AC |
3 ms |
8572 KB |
subtask_1_17.txt |
AC |
3 ms |
8572 KB |
subtask_1_18.txt |
AC |
4 ms |
8572 KB |
subtask_1_19.txt |
AC |
5 ms |
8572 KB |
subtask_1_2.txt |
AC |
5 ms |
8572 KB |
subtask_1_20.txt |
AC |
3 ms |
8572 KB |
subtask_1_21.txt |
AC |
4 ms |
8572 KB |
subtask_1_22.txt |
AC |
7 ms |
8572 KB |
subtask_1_23.txt |
AC |
3 ms |
8572 KB |
subtask_1_24.txt |
AC |
5 ms |
8572 KB |
subtask_1_25.txt |
AC |
4 ms |
8572 KB |
subtask_1_26.txt |
AC |
5 ms |
8572 KB |
subtask_1_27.txt |
AC |
5 ms |
8572 KB |
subtask_1_3.txt |
AC |
4 ms |
8572 KB |
subtask_1_4.txt |
AC |
5 ms |
8572 KB |
subtask_1_5.txt |
AC |
4 ms |
8572 KB |
subtask_1_6.txt |
AC |
5 ms |
8572 KB |
subtask_1_7.txt |
AC |
4 ms |
8572 KB |
subtask_1_8.txt |
AC |
5 ms |
8572 KB |
subtask_1_9.txt |
AC |
3 ms |
8572 KB |