Submission #61162758


Source Code Expand

use std::collections::BTreeSet;

use proconio::{input, marker::Chars};

pub fn main() {
    input! {
        k: usize,
        s: Chars,
        t: Chars
    };
    if s.len() == t.len() {
        let mut count = 0;
        for i in 0..s.len() {
            if s[i] == t[i] {
                continue;
            } else {
                count += 1;
            }
        }
        if count <= k {
            println!("{}", "Yes");
        } else {
            println!("{}", "No");
        }
    } else if s.len() + 1 == t.len() {
        let mut count = 0;
        for i in 0..s.len() {
            let cursor = if count == 0 { i } else { i + 1 };
            if s[i] == t[cursor] {
                continue;
            } else {
                count += 1;
            }
        }
        if count <= k {
            println!("{}", "Yes");
        } else {
            println!("{}", "No");
        }
    } else if s.len() == t.len() + 1 {
        let mut count = 0;
        for i in 0..t.len() {
            let cursor = if count == 0 { i } else { i + 1 };
            if t[i] == s[cursor] {
                continue;
            } else {
                count += 1;
            }
        }
        if count <= k {
            println!("{}", "Yes");
        } else {
            println!("{}", "No");
        }
    } else {
        println!("{}", "No");
    }
}

Submission Info

Submission Time
Task C - Operate 1
User macaroon
Language Rust (rustc 1.70.0)
Score 350
Code Size 1426 Byte
Status AC
Exec Time 6 ms
Memory 6764 KiB

Compile Error

warning: unused import: `std::collections::BTreeSet`
 --> src/main.rs:1:5
  |
1 | use std::collections::BTreeSet;
  |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 350 / 350
Status
AC × 6
AC × 32
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt, sample_06.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt, sample_06.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
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 1968 KiB
sample_02.txt AC 1 ms 1948 KiB
sample_03.txt AC 1 ms 1856 KiB
sample_04.txt AC 1 ms 1936 KiB
sample_05.txt AC 1 ms 2056 KiB
sample_06.txt AC 1 ms 1792 KiB
test_01.txt AC 1 ms 1916 KiB
test_02.txt AC 1 ms 2076 KiB
test_03.txt AC 1 ms 2056 KiB
test_04.txt AC 1 ms 2060 KiB
test_05.txt AC 1 ms 1856 KiB
test_06.txt AC 4 ms 6584 KiB
test_07.txt AC 6 ms 6528 KiB
test_08.txt AC 6 ms 6536 KiB
test_09.txt AC 4 ms 6708 KiB
test_10.txt AC 4 ms 6676 KiB
test_11.txt AC 2 ms 4240 KiB
test_12.txt AC 3 ms 4176 KiB
test_13.txt AC 1 ms 2592 KiB
test_14.txt AC 1 ms 2688 KiB
test_15.txt AC 5 ms 6692 KiB
test_16.txt AC 6 ms 6660 KiB
test_17.txt AC 6 ms 6756 KiB
test_18.txt AC 5 ms 6548 KiB
test_19.txt AC 6 ms 6652 KiB
test_20.txt AC 6 ms 6696 KiB
test_21.txt AC 5 ms 6764 KiB
test_22.txt AC 6 ms 6672 KiB
test_23.txt AC 6 ms 6680 KiB
test_24.txt AC 5 ms 6744 KiB
test_25.txt AC 5 ms 6664 KiB
test_26.txt AC 4 ms 6732 KiB