#910217 (Rust) No.2453 Seat Allocation

• 問題: No.2453 Seat Allocation
• ユーザー: Moss_Local
• 提出日時: 2023-09-01 23:25:09
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 172 ms / 2,000 ms
• コード長: 6,771 bytes
• コンパイル時間: 12,236 ms
• コンパイル使用メモリ: 402,216 KB
• 実行使用メモリ: 8,664 KB
• 最終ジャッジ日時: 2024-06-25 09:33:57
• 合計ジャッジ時間: 15,758 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	155 ms; 8,476 KB
testcase_06	AC	134 ms; 5,376 KB
testcase_07	AC	20 ms; 6,272 KB
testcase_08	AC	16 ms; 5,376 KB
testcase_09	AC	171 ms; 8,540 KB
testcase_10	AC	171 ms; 8,496 KB
testcase_11	AC	172 ms; 8,664 KB
testcase_12	AC	133 ms; 5,376 KB
testcase_13	AC	137 ms; 5,376 KB
testcase_14	AC	131 ms; 5,376 KB
testcase_15	AC	143 ms; 5,376 KB
testcase_16	AC	134 ms; 5,376 KB
testcase_17	AC	1 ms; 5,376 KB
testcase_18	AC	135 ms; 5,376 KB
testcase_19	AC	145 ms; 7,112 KB
testcase_20	AC	56 ms; 5,376 KB
testcase_21	AC	97 ms; 5,376 KB
testcase_22	AC	141 ms; 5,376 KB
testcase_23	AC	1 ms; 5,376 KB
testcase_24	AC	1 ms; 5,376 KB

コンパイルメッセージ

warning: type `candidate` should have an upper camel case name
   --> src/main.rs:212:8
    |
212 | struct candidate {
    |        ^^^^^^^^^ help: convert the identifier to upper camel case (notice the capitalization): `Candidate`
    |
    = note: `#[warn(non_camel_case_types)]` on by default

warning: unused variable: `i`
   --> src/main.rs:257:9
    |
257 |     for i in 0..m {
    |         ^ help: if this is intentional, prefix it with an underscore: `_i`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: variable does not need to be mutable
   --> src/main.rs:246:9
    |
246 |     let mut a: Vec<i64> = read_vec();
    |         ----^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: variable does not need to be mutable
   --> src/main.rs:247:9
    |
247 |     let mut b: Vec<i64> = read_vec();
    |         ----^
    |         |
    |         help: remove this `mut`

ソースコード

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
use std::arch::x86_64::_MM_FROUND_NEARBYINT;
// use core::num;
use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::iter::FromIterator;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD1: i64 = 1000000007;
const MOD9: i64 = 998244353;
const MOD: i64 = MOD9;
// const MOD: i64 = MOD2;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;

// use proconio::input;
// const MOD: i64 = INF;

use cmp::Ordering::*;
use std::collections::*;

use std::io::stdin;
use std::io::stdout;
use std::io::Write;

macro_rules! p {
    ($x:expr) => {
        //if expr
        println!("{}", $x);
    };
}

macro_rules! vp {
    // vector print separate with space
    ($x:expr) => {
        println!(
            "{}",
            $x.iter()
                .map(|x| x.to_string())
                .collect::<Vec<_>>()
                .join(" ")
        );
    };
}

macro_rules! d {
    ($x:expr) => {
        eprintln!("{:?}", $x);
    };
}
macro_rules! yn {
    ($val:expr) => {
        if $val {
            println!("Yes");
        } else {
            println!("No");
        }
    };
}

fn main() {
    solve();
}

// use str::Chars;
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<f64>().unwrap(),
        iter.next().unwrap().parse::<f64>().unwrap(),
    )
}

fn readcc() -> (char, char) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<char>().unwrap(),
        iter.next().unwrap().parse::<char>().unwrap(),
    )
}

fn readuuu() -> (usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

fn readimat(h: usize, w: usize) -> Vec<Vec<i64>> {
    let mut mat = vec![vec![0; w]; h];
    for i in 0..h {
        let mut str = String::new();
        let _ = stdin().read_line(&mut str).unwrap();
        let mut iter = str.split_whitespace();
        for j in 0..w {
            mat[i][j] = iter.next().unwrap().parse::<i64>().unwrap();
        }
    }
    mat
}

fn readcmat(h: usize, w: usize) -> Vec<Vec<char>> {
    let mut mat = vec![vec!['.'; w]; h];
    for i in 0..h {
        let mut str = String::new();
        let _ = stdin().read_line(&mut str).unwrap();
        let mut iter = str.chars();
        for j in 0..w {
            mat[i][j] = iter.next().unwrap();
        }
    }
    mat
}

#[derive(Debug, Clone, PartialEq, Eq)]
struct candidate {
    a: i64,
    b: i64,
    group: usize,
    num: usize,
}

impl PartialOrd for candidate {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}
//compare candidate a_i/b_i < a_j/b_j
impl Ord for candidate {
    fn cmp(&self, other: &Self) -> Ordering {
        let a = self.a * other.b;
        let b = self.b * other.a;
        if a < b {
            return Less;
        } else if a > b {
            return Greater;
        } else {
            if self.group < other.group {
                return Greater;
            } else if self.group > other.group {
                return Less;
            }
            return Equal;
        }
    }
}

fn solve() {
    let (n, m) = readuu();
    let mut a: Vec<i64> = read_vec();
    let mut b: Vec<i64> = read_vec();
    let mut heap = BinaryHeap::new();
    for i in 0..n {
        heap.push(candidate {
            a: a[i],
            b: b[0],
            group: i,
            num: 0,
        });
    }
    for i in 0..m {
        let top = heap.pop().unwrap();
        p!(top.group + 1);
        if top.num == m - 1 {
            continue;
        }

        heap.push(candidate {
            a: top.a,
            b: b[top.num + 1],
            group: top.group,
            num: top.num + 1,
        });
    }

    return;
}