#756650 (Rust) No.5005 3-SAT

提出ソース

結果

問題	No.5005 3-SAT
ユーザー	terry_u16
提出日時	2022-04-29 14:42:43
言語	Rust (1.77.0 + proconio)
結果	AC
実行時間	1,952 ms / 2,000 ms
コード長	5,295 bytes
コンパイル時間	1,465 ms
実行使用メモリ	5,160 KB
スコア	16,834
最終ジャッジ日時	2022-04-29 14:46:07
合計ジャッジ時間	202,700 ms
ジャッジサーバーID （参考情報）	judge13 / judge12
	純コード判定しない問題か言語

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1,951 ms 2,152 KB
testcase_01	AC	1,951 ms 2,048 KB
testcase_02	AC	1,951 ms 2,064 KB
testcase_03	AC	1,950 ms 2,124 KB
testcase_04	AC	1,952 ms 2,136 KB
testcase_05	AC	1,952 ms 2,020 KB
testcase_06	AC	1,950 ms 1,984 KB
testcase_07	AC	1,951 ms 2,044 KB
testcase_08	AC	1,951 ms 1,960 KB
testcase_09	AC	1,950 ms 2,092 KB
testcase_10	AC	1,952 ms 2,168 KB
testcase_11	AC	1,951 ms 1,960 KB
testcase_12	AC	1,951 ms 2,140 KB
testcase_13	AC	1,951 ms 2,112 KB
testcase_14	AC	1,952 ms 2,128 KB
testcase_15	AC	1,950 ms 2,148 KB
testcase_16	AC	1,951 ms 2,144 KB
testcase_17	AC	1,952 ms 2,016 KB
testcase_18	AC	1,950 ms 3,116 KB
testcase_19	AC	1,951 ms 3,116 KB
testcase_20	AC	1,951 ms 3,112 KB
testcase_21	AC	1,951 ms 3,116 KB
testcase_22	AC	1,951 ms 3,112 KB
testcase_23	AC	1,951 ms 3,112 KB
testcase_24	AC	1,952 ms 3,116 KB
testcase_25	AC	1,951 ms 3,116 KB
testcase_26	AC	1,950 ms 3,116 KB
testcase_27	AC	1,952 ms 3,112 KB
testcase_28	AC	1,952 ms 3,112 KB
testcase_29	AC	1,950 ms 3,116 KB
testcase_30	AC	1,952 ms 3,112 KB
testcase_31	AC	1,952 ms 3,112 KB
testcase_32	AC	1,950 ms 3,116 KB
testcase_33	AC	1,952 ms 3,112 KB
testcase_34	AC	1,951 ms 3,116 KB
testcase_35	AC	1,951 ms 3,112 KB
testcase_36	AC	1,951 ms 3,116 KB
testcase_37	AC	1,951 ms 3,112 KB
testcase_38	AC	1,950 ms 3,116 KB
testcase_39	AC	1,951 ms 3,116 KB
testcase_40	AC	1,951 ms 3,112 KB
testcase_41	AC	1,951 ms 3,112 KB
testcase_42	AC	1,951 ms 3,112 KB
testcase_43	AC	1,952 ms 3,116 KB
testcase_44	AC	1,951 ms 3,116 KB
testcase_45	AC	1,952 ms 3,116 KB
testcase_46	AC	1,950 ms 3,116 KB
testcase_47	AC	1,951 ms 3,116 KB
testcase_48	AC	1,952 ms 3,116 KB
testcase_49	AC	1,951 ms 3,112 KB
testcase_50	AC	1,950 ms 3,112 KB
testcase_51	AC	1,951 ms 3,116 KB
testcase_52	AC	1,951 ms 3,116 KB
testcase_53	AC	1,952 ms 3,112 KB
testcase_54	AC	1,952 ms 3,116 KB
testcase_55	AC	1,951 ms 3,112 KB
testcase_56	AC	1,951 ms 3,112 KB
testcase_57	AC	1,951 ms 3,120 KB
testcase_58	AC	1,950 ms 3,116 KB
testcase_59	AC	1,951 ms 3,116 KB
testcase_60	AC	1,951 ms 3,112 KB
testcase_61	AC	1,952 ms 3,116 KB
testcase_62	AC	1,951 ms 3,120 KB
testcase_63	AC	1,951 ms 3,116 KB
testcase_64	AC	1,950 ms 3,116 KB
testcase_65	AC	1,952 ms 3,116 KB
testcase_66	AC	1,951 ms 3,116 KB
testcase_67	AC	1,950 ms 3,116 KB
testcase_68	AC	1,951 ms 3,112 KB
testcase_69	AC	1,950 ms 3,116 KB
testcase_70	AC	1,951 ms 3,112 KB
testcase_71	AC	1,951 ms 3,112 KB
testcase_72	AC	1,952 ms 3,116 KB
testcase_73	AC	1,951 ms 3,116 KB
testcase_74	AC	1,951 ms 3,112 KB
testcase_75	AC	1,951 ms 3,112 KB
testcase_76	AC	1,951 ms 3,116 KB
testcase_77	AC	1,952 ms 3,116 KB
testcase_78	AC	1,951 ms 3,116 KB
testcase_79	AC	1,951 ms 3,120 KB
testcase_80	AC	1,952 ms 3,116 KB
testcase_81	AC	1,950 ms 3,116 KB
testcase_82	AC	1,951 ms 3,116 KB
testcase_83	AC	1,952 ms 3,112 KB
testcase_84	AC	1,951 ms 3,112 KB
testcase_85	AC	1,950 ms 3,116 KB
testcase_86	AC	1,951 ms 3,116 KB
testcase_87	AC	1,951 ms 3,116 KB
testcase_88	AC	1,952 ms 3,112 KB
testcase_89	AC	1,952 ms 3,112 KB
testcase_90	AC	1,951 ms 3,112 KB
testcase_91	AC	1,950 ms 3,112 KB
testcase_92	AC	1,951 ms 3,120 KB
testcase_93	AC	1,952 ms 3,116 KB
testcase_94	AC	1,951 ms 4,900 KB
testcase_95	AC	1,952 ms 4,904 KB
testcase_96	AC	1,952 ms 5,160 KB
testcase_97	AC	1,950 ms 4,904 KB
testcase_98	AC	1,951 ms 4,900 KB
testcase_99	AC	1,951 ms 4,900 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

use std::time::Instant;

macro_rules! get {
      ($t:ty) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              line.trim().parse::<$t>().unwrap()
          }
      };
      ($($t:ty),*) => {
          {
              let mut line: String = String::new();
              std::io::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();
              std::io::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! chmin {
    ($base:expr, $($cmps:expr),+ $(,)*) => {{
        let cmp_min = min!($($cmps),+);
        if $base > cmp_min {
            $base = cmp_min;
            true
        } else {
            false
        }
    }};
}

#[allow(unused_macros)]
macro_rules! chmax {
    ($base:expr, $($cmps:expr),+ $(,)*) => {{
        let cmp_max = max!($($cmps),+);
        if $base < cmp_max {
            $base = cmp_max;
            true
        } else {
            false
        }
    }};
}

#[allow(unused_macros)]
macro_rules! min {
    ($a:expr $(,)*) => {{
        $a
    }};
    ($a:expr, $b:expr $(,)*) => {{
        std::cmp::min($a, $b)
    }};
    ($a:expr, $($rest:expr),+ $(,)*) => {{
        std::cmp::min($a, min!($($rest),+))
    }};
}

#[allow(unused_macros)]
macro_rules! max {
    ($a:expr $(,)*) => {{
        $a
    }};
    ($a:expr, $b:expr $(,)*) => {{
        std::cmp::max($a, $b)
    }};
    ($a:expr, $($rest:expr),+ $(,)*) => {{
        std::cmp::max($a, max!($($rest),+))
    }};
}

#[allow(unused_macros)]
macro_rules! mat {
    ($e:expr; $d:expr) => { vec![$e; $d] };
    ($e:expr; $d:expr $(; $ds:expr)+) => { vec![mat![$e $(; $ds)*]; $d] };
}

#[derive(Debug, Clone, Copy)]
struct Requirement {
    digit: usize,
    value: usize,
}

#[derive(Debug, Clone)]
struct Choice {
    requirements: [Requirement; 3],
}

#[derive(Debug, Clone)]
struct Input {
    since: Instant,
    choices: Vec<Choice>,
}

const CHOICES_COUNT: usize = 2048;
const DIGIT_LEN: usize = 256;
const TIME_LIMIT: f64 = 1.95;

fn main() {
    let input = read_input();
    let solution = solve(&input);
    write_output(&solution);
}

fn read_input() -> Input {
    let mut choices = vec![];

    for _ in 0..CHOICES_COUNT {
        let (a, b, c, p, q, r) = get!(usize, usize, usize, usize, usize, usize);

        let requirements = [
            Requirement { digit: a, value: p },
            Requirement { digit: b, value: q },
            Requirement { digit: c, value: r },
        ];
        let choice = Choice { requirements };

        choices.push(choice);
    }

    let since = Instant::now();
    let input = Input { since, choices };
    input
}

fn solve(input: &Input) -> Vec<usize> {
    let mut counts = vec![0; DIGIT_LEN];
    let mut solution = vec![0; DIGIT_LEN];
    let mut best_solution = vec![0; DIGIT_LEN];
    let mut best_score = 0;
    let mut total_count = 0;

    dfs(
        input,
        &mut solution,
        &mut best_solution,
        &mut best_score,
        &mut counts,
        &mut total_count,
        0,
    );

    eprintln!("score: {}", best_score);

    best_solution
}

fn dfs(
    input: &Input,
    solution: &mut Vec<usize>,
    best_solution: &mut Vec<usize>,
    best_score: &mut usize,
    counts: &mut [usize],
    total_count: &mut usize,
    depth: usize,
) -> bool {
    if *total_count % 1000 == 0 {
        let elapsed = (Instant::now() - input.since).as_secs_f64();

        if elapsed > TIME_LIMIT {
            return false;
        }
    }

    if chmax!(*best_score, depth) {
        *best_solution = solution.clone();
    }

    if depth == CHOICES_COUNT {
        return false;
    }

    for req in input.choices[depth].requirements.iter() {
        if counts[req.digit] == 0 || solution[req.digit] == req.value {
            counts[req.digit] += 1;
            *total_count += 1;
            solution[req.digit] = req.value;

            let in_time = dfs(
                input,
                solution,
                best_solution,
                best_score,
                counts,
                total_count,
                depth + 1,
            );

            if !in_time {
                return false;
            }

            counts[req.digit] -= 1;
        }
    }

    return true;
}

fn write_output(solution: &[usize]) {
    let mut result = String::new();

    for v in solution.iter().rev() {
        if *v == 0 {
            result.push('0');
        } else {
            result.push('1');
        }
    }

    println!("{}", result);
}

yukicoder

結果

テストケース

ソースコード