結果

問題 No.1439 Let's Compare!!!!
ユーザー Moss_LocalMoss_Local
提出日時 2021-03-26 21:51:21
言語 Rust
(1.77.0)
結果
AC  
実行時間 395 ms / 2,000 ms
コード長 6,589 bytes
コンパイル時間 5,234 ms
コンパイル使用メモリ 160,980 KB
実行使用メモリ 12,692 KB
最終ジャッジ日時 2023-08-19 15:16:58
合計ジャッジ時間 6,688 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,384 KB
testcase_02 AC 1 ms
4,384 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 1 ms
4,384 KB
testcase_07 AC 7 ms
4,380 KB
testcase_08 AC 12 ms
4,380 KB
testcase_09 AC 5 ms
4,380 KB
testcase_10 AC 387 ms
12,372 KB
testcase_11 AC 357 ms
10,076 KB
testcase_12 AC 354 ms
9,908 KB
testcase_13 AC 395 ms
12,692 KB
testcase_14 AC 392 ms
12,692 KB
testcase_15 AC 343 ms
9,032 KB
testcase_16 AC 319 ms
9,020 KB
testcase_17 AC 313 ms
9,036 KB
testcase_18 AC 304 ms
9,028 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unnecessary parentheses around method argument
   --> Main.rs:226:31
    |
226 |         let mut ok = st.range((0..n + 1)).next();
    |                               ^        ^
    |
    = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
    |
226 -         let mut ok = st.range((0..n + 1)).next();
226 +         let mut ok = st.range(0..n + 1).next();
    |

warning: unused variable: `i`
   --> Main.rs:207:9
    |
207 |     for i in 0..q {
    |         ^ 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
   --> Main.rs:186:9
    |
186 |     let mut v = s.as_bytes().to_vec();
    |         ----^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: variable does not need to be mutable
   --> Main.rs:193:9
    |
193 |     let mut v = s.as_bytes().to_vec();
    |         ----^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:211:13
    |
211 |         let mut c: char = s.next().unwrap().parse().unwrap();
    |             ----^
    |             |
    |             help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:213:13
    |
213 |         let mut y: usize = s.next().unwrap().parse().unwrap();
    |             ----^
    |             |
    |             help: remove this `mut`

warning: variable does not need to be mutable
   --> Main.rs:226:13
    |
226 |         let mut ok = st.range((0..n + 1)).next();
    |             ----^^
    |             |
    |             help: remove this `mut`

warning: 7 warnings emitted

ソースコード

diff # 

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]

use std::collections::*;
use std::convert::*;
use std::convert::{From, Into};
use std::fmt::Debug;
use std::fs::File;
use std::io::prelude::*;
use std::io::*;
use std::marker::Copy;
use std::mem::*;
use std::ops::Bound::*;
use std::ops::{Add, Mul, Neg, Sub};
use std::str;
use std::vec;
use std::{cmp, process::Output};
use std::{cmp::Ordering, env::consts::DLL_PREFIX};
use std::{cmp::Ordering::*, f32::consts::PI};

const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const FINF: f64 = 122337203685.0;
const INF128: i128 = 1223372036854775807000000000000;
const LINF: i64 = 2147483647;
// const MOD: i64 = 1000000007;
const MOD: i64 = 998244353;
const UMOD: usize = MOD as usize;
use std::cmp::*;
use std::collections::*;
use std::io::stdin;
use std::io::stdout;
use std::io::Write;

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

macro_rules! pp {
    ($x:expr) => {
        println!("{:?}", $x);
    };
}

macro_rules! d {
    ($x:expr) => {
        dbg!($x);
    };
}

// 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 readi() -> (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()
// }

#[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_vec2<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(),
    )
}

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(),
    )
}

#[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(),
    )
}

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(),
    )
}

#[allow(dead_code)]
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 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 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(),
    )
}
// / Equivalent to std::lowerbound and std::upperbound in c++
fn neighbors(tree: &BTreeSet<i64>, val: i64) -> (Option<&i64>, Option<&i64>) {
    use std::ops::Bound::*;

    let mut before = tree.range((Unbounded, Excluded(val)));
    let mut after = tree.range((Excluded(val), Unbounded));

    (before.next_back(), after.next())
}

fn solve() {
    let n: usize = read();
    let s: String = read();
    let mut v = s.as_bytes().to_vec();
    let mut vec = vec![0; s.len()];
    for i in 0..s.len() {
        vec[i] = v[i] as usize - '0' as usize;
    }
    let mut v1 = vec.clone();
    let s: String = read();
    let mut v = s.as_bytes().to_vec();
    let mut vec = vec![0; s.len()];
    for i in 0..s.len() {
        vec[i] = v[i] as usize - '0' as usize;
    }
    let mut v2 = vec.clone();
    let q: usize = read();
    let mut st = BTreeSet::new();
    for i in 0..n {
        if v1[i] != v2[i] {
            st.insert(i);
        }
    }

    for i in 0..q {
        let mut s = String::new();
        std::io::stdin().read_line(&mut s).unwrap();
        let mut s = s.split_whitespace();
        let mut c: char = s.next().unwrap().parse().unwrap();
        let mut x: usize = s.next().unwrap().parse().unwrap();
        let mut y: usize = s.next().unwrap().parse().unwrap();
        x -= 1;
        if c == 'S' {
            v1[x] = y;
        } else {
            v2[x] = y;
        }
        if v1[x] == v2[x] {
            st.remove(&x);
        } else {
            st.insert(x);
        }

        let mut ok = st.range((0..n + 1)).next();
        if ok == None {
            println!("{}", "=");
        } else {
            let ok = *ok.unwrap();
            if ok == n {
                println!("{}", "=");
            } else {
                if v1[ok] > v2[ok] {
                    println!("{}", ">");
                } else {
                    println!("{}", "<");
                }
            }
        }
    }

    return;
}

fn main() {
    solve()
}
0