Submission #18895773


Source Code Expand

use std::cmp::Reverse;
use std::collections::{BTreeSet, BinaryHeap};

fn main() {
    let (r, w) = (std::io::stdin(), std::io::stdout());
    let mut sc = IO::new(r.lock(), w.lock());
    let n: usize = sc.read();
    let k: usize = sc.read();

    let mut done = BTreeSet::new();
    let mut heap = BinaryHeap::new();
    for i in 0..n {
        let a: Vec<usize> = sc.vec(k);
        for j in 0..k {
            heap.push((Reverse(j), Reverse(i), a[j]));
        }

        let mut ans = vec![];
        while let Some((Reverse(rank), Reverse(count), id)) = heap.pop() {
            if done.contains(&id) {
                continue;
            }
            let remain = n - (i + 1);
            if remain * rank + done.len() >= k {
                heap.push((Reverse(rank), Reverse(count), id));
                break;
            }
            done.insert(id);
            ans.push(id);
        }
        ans.sort();
        for (i, ans) in ans.into_iter().enumerate() {
            if i > 0 {
                sc.write(" ");
            }
            sc.write(ans);
        }
        sc.write('\n');
    }
}

pub struct IO<R, W: std::io::Write>(R, std::io::BufWriter<W>);

impl<R: std::io::Read, W: std::io::Write> IO<R, W> {
    pub fn new(r: R, w: W) -> Self {
        Self(r, std::io::BufWriter::new(w))
    }
    pub fn write<S: ToString>(&mut self, s: S) {
        use std::io::Write;
        self.1.write_all(s.to_string().as_bytes()).unwrap();
    }
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .0
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r' || b == b'\t')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r' && b != b'\t')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }
    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}

Submission Info

Submission Time
Task C - 決勝進出者
User kenkoooo
Language Rust (1.42.0)
Score 100
Code Size 2287 Byte
Status AC
Exec Time 31 ms
Memory 3312 KiB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 76
Set Name Test Cases
All sample_01.txt, sample_02.txt, test_00.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt, test_59.txt, test_60.txt, test_61.txt, test_62.txt, test_63.txt, test_64.txt, test_65.txt, test_66.txt, test_67.txt, test_68.txt, test_69.txt, test_70.txt, test_71.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
sample_01.txt AC 8 ms 2096 KiB
sample_02.txt AC 2 ms 2052 KiB
test_00.txt AC 2 ms 2104 KiB
test_01.txt AC 2 ms 2160 KiB
test_02.txt AC 2 ms 2200 KiB
test_03.txt AC 2 ms 2084 KiB
test_04.txt AC 2 ms 2164 KiB
test_05.txt AC 2 ms 2012 KiB
test_06.txt AC 2 ms 2036 KiB
test_07.txt AC 1 ms 2200 KiB
test_08.txt AC 2 ms 2076 KiB
test_09.txt AC 1 ms 2092 KiB
test_10.txt AC 2 ms 1992 KiB
test_11.txt AC 2 ms 2148 KiB
test_12.txt AC 2 ms 2068 KiB
test_13.txt AC 1 ms 2072 KiB
test_14.txt AC 2 ms 2064 KiB
test_15.txt AC 2 ms 2068 KiB
test_16.txt AC 2 ms 2152 KiB
test_17.txt AC 3 ms 2116 KiB
test_18.txt AC 3 ms 2124 KiB
test_19.txt AC 2 ms 2116 KiB
test_20.txt AC 7 ms 2184 KiB
test_21.txt AC 3 ms 2188 KiB
test_22.txt AC 3 ms 2148 KiB
test_23.txt AC 3 ms 2104 KiB
test_24.txt AC 2 ms 2092 KiB
test_25.txt AC 2 ms 2084 KiB
test_26.txt AC 2 ms 1956 KiB
test_27.txt AC 2 ms 1992 KiB
test_28.txt AC 2 ms 2120 KiB
test_29.txt AC 2 ms 2112 KiB
test_30.txt AC 2 ms 2044 KiB
test_31.txt AC 2 ms 2168 KiB
test_32.txt AC 2 ms 2000 KiB
test_33.txt AC 4 ms 2112 KiB
test_34.txt AC 2 ms 2072 KiB
test_35.txt AC 2 ms 2068 KiB
test_36.txt AC 2 ms 1996 KiB
test_37.txt AC 2 ms 2112 KiB
test_38.txt AC 2 ms 1992 KiB
test_39.txt AC 2 ms 2080 KiB
test_40.txt AC 3 ms 2192 KiB
test_41.txt AC 4 ms 2192 KiB
test_42.txt AC 4 ms 2184 KiB
test_43.txt AC 4 ms 2160 KiB
test_44.txt AC 9 ms 2128 KiB
test_45.txt AC 4 ms 2228 KiB
test_46.txt AC 3 ms 2144 KiB
test_47.txt AC 4 ms 2156 KiB
test_48.txt AC 1 ms 2068 KiB
test_49.txt AC 2 ms 1984 KiB
test_50.txt AC 2 ms 2084 KiB
test_51.txt AC 2 ms 2108 KiB
test_52.txt AC 2 ms 2068 KiB
test_53.txt AC 2 ms 2092 KiB
test_54.txt AC 3 ms 2076 KiB
test_55.txt AC 2 ms 1972 KiB
test_56.txt AC 2 ms 2092 KiB
test_57.txt AC 1 ms 2128 KiB
test_58.txt AC 2 ms 2100 KiB
test_59.txt AC 2 ms 2152 KiB
test_60.txt AC 2 ms 2108 KiB
test_61.txt AC 2 ms 2088 KiB
test_62.txt AC 2 ms 2148 KiB
test_63.txt AC 3 ms 2080 KiB
test_64.txt AC 23 ms 3132 KiB
test_65.txt AC 26 ms 3000 KiB
test_66.txt AC 31 ms 3312 KiB
test_67.txt AC 29 ms 3204 KiB
test_68.txt AC 28 ms 3012 KiB
test_69.txt AC 29 ms 2964 KiB
test_70.txt AC 23 ms 3192 KiB
test_71.txt AC 19 ms 3248 KiB