結果
問題 | No.1673 Lamps on a line |
ユーザー | kenichi |
提出日時 | 2023-09-03 16:56:34 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 144 ms / 2,000 ms |
コード長 | 5,141 bytes |
コンパイル時間 | 14,052 ms |
コンパイル使用メモリ | 402,704 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-12 22:33:04 |
合計ジャッジ時間 | 14,594 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 0 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,816 KB |
testcase_02 | AC | 73 ms
6,816 KB |
testcase_03 | AC | 73 ms
6,940 KB |
testcase_04 | AC | 127 ms
6,944 KB |
testcase_05 | AC | 7 ms
6,944 KB |
testcase_06 | AC | 106 ms
6,944 KB |
testcase_07 | AC | 85 ms
6,940 KB |
testcase_08 | AC | 3 ms
6,940 KB |
testcase_09 | AC | 124 ms
6,944 KB |
testcase_10 | AC | 134 ms
6,944 KB |
testcase_11 | AC | 13 ms
6,944 KB |
testcase_12 | AC | 144 ms
6,944 KB |
ソースコード
use std::io::*; use std::str::FromStr; /* const LOW_CASE_ALPHABET: [char; 26] = [ 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', ]; */ fn main() { let n: usize = read(); let q: usize = read(); let mut ans = vec![0; n]; let mut answer = 0; for _i in 0..q{ let l: usize = read(); let r: usize = read(); for _j in ans.iter_mut().take(r).skip(l - 1){ if *_j == 0{ answer += 1; *_j = 1; }else{ answer -= 1; *_j = 0; } } println!("{}",answer); } } /* pub fn perfect(value_1: usize) -> usize { let mut perfect_number = Vec::new(); let mut tmp_1 = 0; for _i in 2..=value_1 { let mut tmp = 0; for _j in 1..=((_i as f64).powf(0.5)) as usize { if _i % _j == 0 { if _j * _j == _i { tmp += _j; } else { tmp += _j + (_i / _j); } } } tmp -= _i; if tmp == _i { perfect_number.push(_i); } } for _i in &perfect_number{ if tmp_1 == perfect_number.len() - 1{ break; } println!("{}", _i); tmp_1 += 1; } perfect_number[perfect_number.len() - 1] } */ /* pub fn prime_number(value_1: usize, value_2: usize) -> usize { let mut primary = Vec::new(); primary.push(2); for _i in 2..=value_1 { let mut flag = 0; for _j in &primary { if _i % _j == 0 { flag = 1; break; } } if flag == 0 { primary.push(_i); } if primary.len() == value_2 { return primary[primary.len() - 1]; } } 0 } */ /* pub fn ctoi(c: char) -> isize { c as isize - '0' as isize } */ /* pub fn stoi(c: String) -> isize { c.parse::<isize>().unwrap() } */ /* pub fn find_char(sentence: Vec<char>, target: char, start: isize) -> isize { for _i in start as usize..sentence.len() { if sentence[_i] == target { return _i as isize; } } -1 } */ /* pub fn hex_to_binary_2(hex_string: String, x: u32) -> Option<String> { match i64::from_str_radix(&hex_string, x) { Ok(decimal) => Some(format!("{}", decimal)), Err(_) => None, } } */ /* pub fn hex_to_binary(hex_string: &str, x: u32) -> Option<String> { match i64::from_str_radix(hex_string, x) { Ok(decimal) => Some(format!("{}", decimal)), Err(_) => None, } } */ /* pub fn my_floor(x: f64) -> f64 { (x * 1000.0).floor() / 1000.0 } */ /* pub fn upper_lower(x: char) -> char { let result: char; if x.is_uppercase() { result = x.to_ascii_lowercase(); } else if x.is_lowercase() { result = x.to_ascii_uppercase(); } else { result = x; } result } */ /* pub fn maxf_2(x: f64, y: f64) -> f64 { if x >= y { x } else { y } } */ /* pub fn max_2(x: isize, y: isize) -> isize { if x >= y { x } else { y } } */ /* pub fn min_2(x: isize, y: isize) -> isize { if x >= y { y } else { x } } */ /* pub fn max_3(x: isize, y: isize, z: isize) -> isize { if (x >= y && y >= z) || (x >= z && z >= y){ x } else if (y >= x && x >= z) || (y >= z && z >= x) { y } else { z } } */ /* pub fn max_u_3(x: usize, y: usize, z: usize) -> usize { if (x >= y && y >= z) || (x >= z && z >= y){ x } else if (y >= x && x >= z) || (y >= z && z >= x) { y } else { z } } */ /* pub fn min_3(x: isize, y: isize, z: isize) -> isize { if (x <= y && y <= z) || (x <= z && z <= y){ x } else if (y <= x && x <= z) || (y <= z && z <= x) { y } else { z } } */ /* pub fn min_u_3(x: usize, y: usize, z: usize) -> usize { if (x <= y && y <= z) || (x <= z && z <= y){ x } else if (y <= x && x <= z) || (y <= z && z <= x) { y } else { z } } */ pub fn read_text() -> String { let mut word = String::new(); std::io::stdin().read_line(&mut word).ok(); let answer = word.trim().to_string(); answer } pub fn read_array() -> Vec<char> { let array: String = read(); let chars: Vec<char> = array.trim().chars().collect::<Vec<char>>(); chars } pub fn read<T: FromStr>() -> T { let stdin = stdin(); let stdin = stdin.lock(); let token: String = stdin .bytes() .map(|c| c.expect("failed to read char") as char) .skip_while(|c| c.is_whitespace()) .take_while(|c| !c.is_whitespace()) .collect(); token.parse().ok().expect("failed to parse token") } pub fn read_line<T: FromStr>() -> String { let stdin = stdin(); let stdin = stdin.lock(); stdin .lines() .next() .expect("No line in the input") .expect("Failed to read line") }