Submission #3724664
Source Code Expand
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::mem;
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, StdoutLock, Write};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[allow(unused_macros)]
macro_rules ! input { ( source = $ s : expr , $ ( $ r : tt ) * ) => { let mut iter = $ s . split_whitespace ( ) ; let mut next = || { iter . next ( ) . unwrap ( ) } ; input_inner ! { next , $ ( $ r ) * } } ; ( $ ( $ r : tt ) * ) => { let stdin = std :: io :: stdin ( ) ; let mut bytes = std :: io :: Read :: bytes ( std :: io :: BufReader :: new ( stdin . lock ( ) ) ) ; let mut next = move || -> String { bytes . by_ref ( ) . map ( | r | r . unwrap ( ) as char ) . skip_while ( | c | c . is_whitespace ( ) ) . take_while ( | c |! c . is_whitespace ( ) ) . collect ( ) } ; input_inner ! { next , $ ( $ r ) * } } ; }
#[allow(unused_macros)]
macro_rules ! input_inner { ( $ next : expr ) => { } ; ( $ next : expr , ) => { } ; ( $ next : expr , $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let $ var = read_value ! ( $ next , $ t ) ; input_inner ! { $ next $ ( $ r ) * } } ; }
#[allow(unused_macros)]
macro_rules ! read_value { ( $ next : expr , ( $ ( $ t : tt ) ,* ) ) => { ( $ ( read_value ! ( $ next , $ t ) ) ,* ) } ; ( $ next : expr , [ $ t : tt ; $ len : expr ] ) => { ( 0 ..$ len ) . map ( | _ | read_value ! ( $ next , $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ next : expr , chars ) => { read_value ! ( $ next , String ) . chars ( ) . collect ::< Vec < char >> ( ) } ; ( $ next : expr , bytes ) => { read_value ! ( $ next , String ) . into_bytes ( ) } ; ( $ next : expr , usize1 ) => { read_value ! ( $ next , usize ) - 1 } ; ( $ next : expr , $ t : ty ) => { $ next ( ) . parse ::<$ t > ( ) . expect ( "Parse error" ) } ; }
#[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 ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) } ; }
#[allow(dead_code)]
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();
}
}
#[allow(dead_code)]
fn solve() {
input!{
n: u64,
}
let pattern = (n - 1) / 5 % 6;
let mut ans = match pattern {
0 => [1, 2, 3, 4, 5, 6],
1 => [2, 3, 4, 5, 6, 1],
2 => [3, 4, 5, 6, 1, 2],
3 => [4, 5, 6, 1, 2, 3],
4 => [5, 6, 1, 2, 3, 4],
5 => [6, 1, 2, 3, 4, 5],
_ => [0, 0, 0, 0, 0, 0],
};
//std::mem::swap(&mut ans[0 as usize], &mut ans[1 as usize]);
let tmp = ans[1];
ans[1] = ans[0];
ans[0] = tmp;
let pattern2 = (n - 1) % 5;
//debug!(ans);
//debug!(pattern2);
for i in 1..pattern2+1 {
//std::mem::swap(&mut ans[i as usize], &mut ans[(i+1) as usize]);
let mut num = i as usize;
let tmp = ans[num+1];
ans[num+1] = ans[num];
ans[num] = tmp;
}
println!("{:?}{:?}{:?}{:?}{:?}{:?}", ans[0], ans[1], ans[2], ans[3], ans[4], ans[5]);
}
Submission Info
Submission Time |
|
Task |
C - 入れ替え |
User |
wh317706 |
Language |
Rust (1.15.1) |
Score |
100 |
Code Size |
3587 Byte |
Status |
AC |
Exec Time |
3 ms |
Memory |
8572 KB |
Compile Error
warning: variable does not need to be mutable, #[warn(unused_mut)] on by default
--> ./Main.rs:67:13
|
67 | let mut num = i as usize;
| ^^^^^^^
Judge Result
Set Name |
Subtask1 |
Subtask2 |
Score / Max Score |
30 / 30 |
70 / 70 |
Status |
|
|
Set Name |
Test Cases |
Subtask1 |
SubTask1/00_sample_00.txt, SubTask1/00_sample_01.txt, SubTask1/00_sample_02.txt, SubTask1/rand_19.txt, SubTask1/rand_2.txt, SubTask1/rand_25.txt, SubTask1/rand_27.txt, SubTask1/rand_33.txt, SubTask1/rand_35.txt, SubTask1/rand_4.txt, SubTask1/rand_44.txt, SubTask1/rand_48.txt, SubTask1/rand_8.txt |
Subtask2 |
SubTask2/00_sample_03.txt, SubTask2/max_case.txt, SubTask2/rand_120009641.txt, SubTask2/rand_134230520.txt, SubTask2/rand_136939465.txt, SubTask2/rand_200732473.txt, SubTask2/rand_211796835.txt, SubTask2/rand_312330341.txt, SubTask2/rand_377341731.txt, SubTask2/rand_384611280.txt, SubTask2/rand_386098102.txt, SubTask2/rand_399010727.txt, SubTask2/rand_409627453.txt, SubTask2/rand_416537730.txt, SubTask2/rand_425486442.txt, SubTask2/rand_493135174.txt, SubTask2/rand_573105326.txt, SubTask2/rand_62794810.txt, SubTask2/rand_649471654.txt, SubTask2/rand_693017484.txt, SubTask2/rand_729197057.txt, SubTask2/rand_759630883.txt, SubTask2/rand_823752210.txt, SubTask2/rand_830399384.txt, SubTask2/rand_893242387.txt, SubTask2/rand_935005824.txt, SubTask2/rand_989703310.txt |
Case Name |
Status |
Exec Time |
Memory |
SubTask1/00_sample_00.txt |
AC |
3 ms |
8572 KB |
SubTask1/00_sample_01.txt |
AC |
3 ms |
8572 KB |
SubTask1/00_sample_02.txt |
AC |
3 ms |
8572 KB |
SubTask1/rand_19.txt |
AC |
3 ms |
8572 KB |
SubTask1/rand_2.txt |
AC |
3 ms |
8572 KB |
SubTask1/rand_25.txt |
AC |
3 ms |
8572 KB |
SubTask1/rand_27.txt |
AC |
3 ms |
8572 KB |
SubTask1/rand_33.txt |
AC |
3 ms |
8572 KB |
SubTask1/rand_35.txt |
AC |
3 ms |
8572 KB |
SubTask1/rand_4.txt |
AC |
3 ms |
8572 KB |
SubTask1/rand_44.txt |
AC |
3 ms |
8572 KB |
SubTask1/rand_48.txt |
AC |
3 ms |
8572 KB |
SubTask1/rand_8.txt |
AC |
3 ms |
8572 KB |
SubTask2/00_sample_03.txt |
AC |
3 ms |
8572 KB |
SubTask2/max_case.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_120009641.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_134230520.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_136939465.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_200732473.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_211796835.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_312330341.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_377341731.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_384611280.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_386098102.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_399010727.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_409627453.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_416537730.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_425486442.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_493135174.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_573105326.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_62794810.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_649471654.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_693017484.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_729197057.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_759630883.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_823752210.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_830399384.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_893242387.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_935005824.txt |
AC |
3 ms |
8572 KB |
SubTask2/rand_989703310.txt |
AC |
3 ms |
8572 KB |