結果
問題 | No.5002 stick xor |
ユーザー |
|
提出日時 | 2018-05-25 23:03:44 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 24 ms / 1,000 ms |
コード長 | 6,808 bytes |
コンパイル時間 | 4,501 ms |
実行使用メモリ | 1,148 KB |
スコア | 36,325 |
最終ジャッジ日時 | 2018-05-25 23:03:51 |
ジャッジサーバーID (参考情報) |
judge8 / |
純コード判定しない問題か言語 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 32 |
ソースコード
/*** _ _ __ _ _ _ _ _ _ _* | | | | / / | | (_) | (_) | | (_) | |* | |__ __ _| |_ ___ ___ / /__ ___ _ __ ___ _ __ ___| |_ _| |_ ___ _____ ______ _ __ _ _ ___| |_ ______ ___ _ __ _ _ __ _ __ ___||_ ___* | '_ \ / _` | __/ _ \ / _ \ / / __/ _ \| '_ ` _ \| '_ \ / _ \ __| | __| \ \ / / _ \______| '__| | | / __| __|______/ __| '_ \| | '_ \| '_ \ / _ \__/ __|* | | | | (_| | || (_) | (_) / / (_| (_) | | | | | | |_) | __/ |_| | |_| |\ 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::io::{stdin, stdout, BufWriter, Write};#[allow(unused_imports)]use std::iter::FromIterator;mod util {use std::fmt::Debug;use std::io::{stdin, stdout, BufWriter, StdoutLock};use std::str::FromStr;#[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 ( & mutline ) . 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 = false;#[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();}}#[derive(Debug)]#[allow(dead_code)]pub struct Xorshift {seed: u64,}impl Xorshift {#[allow(dead_code)]pub fn new() -> Xorshift {Xorshift {seed: 0xf0fb588ca2196dac,}}#[allow(dead_code)]pub fn with_seed(seed: u64) -> Xorshift {Xorshift { seed: seed }}#[inline(always)]#[allow(dead_code)]pub fn next(&mut self) -> u64 {self.seed = self.seed ^ (self.seed << 13);self.seed = self.seed ^ (self.seed >> 7);self.seed = self.seed ^ (self.seed << 17);self.seed}#[inline(always)]#[allow(dead_code)]pub fn rand(&mut self, m: u64) -> u64 {self.next() % m}#[inline(always)]#[allow(dead_code)]pub fn randf(&mut self) -> f64 {use std::mem;const UPPER_MASK: u64 = 0x3FF0000000000000;const LOWER_MASK: u64 = 0xFFFFFFFFFFFFF;let tmp = UPPER_MASK | (self.next() & LOWER_MASK);let result: f64 = unsafe { mem::transmute(tmp) };result - 1.0}}fn solve() {let (n, _k) = get!(usize, usize);let ls = get!(usize;;);let mut field: Vec<Vec<bool>> = (0..n).map(|_| util::line().chars().map(|c| c == '1').collect()).collect();// Find baseline with simple greedylet mut ans = Vec::new();for l in ls {let mut val = -1000;let mut tyx = (false, 0, 0);for y in 0..n {for x in 0..n - l {let mut b = 0;for x in x..x + l {if field[y][x] {b += 1;}}if b > val {tyx = (true, y, x);val = b;}}/*for y in 0..n - l {for x in 0..n {let mut b = 0;for y in y..y + l {if field[y][x] {b += 1;}}if b > val {tyx = (false, y, x);val = b;}}}*/}let (t, y, x) = tyx;if t {for x in x..x + l {field[y][x] = !field[y][x];}ans.push((y + 1, x + 1, y + 1, x + l));} else {for y in y..y + l {field[y][x] = !field[y][x];}ans.push((y + 1, x + 1, y + l, x + 1));}}util::with_bufwriter(|mut out| {for (a, b, c, d) in ans {writeln!(out, "{} {} {} {}", a, b, c, d).unwrap();}});}