結果

問題 No.1205 Eye Drops
ユーザー Konton7
提出日時 2020-08-30 13:17:30
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 10 ms / 2,000 ms
コード長 1,821 bytes
コンパイル時間 14,346 ms
コンパイル使用メモリ 379,580 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-23 20:44:58
合計ジャッジ時間 13,355 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 37
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: fields `mark`, `y`, and `x` are never read
  --> src/main.rs:38:5
   |
37 | struct Piece {
   |        ----- fields in this struct
38 |     mark: char,
   |     ^^^^
39 |     y: i32,
   |     ^
40 |     x: i32,
   |     ^
   |
   = note: `Piece` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
   = note: `#[warn(dead_code)]` on by default

ソースコード

diff #
プレゼンテーションモードにする

#[allow(unused_imports)]
use std::cmp;
use std::fs::File;
use std::io::Read;
#[allow(unused_imports)]
use std::mem;
#[allow(dead_code)]
fn pow_speedy_with_mod(mut p: i64, mut q: i64, m: i64) -> i64 {
p %= m;
let mut r = p;
let mut ret: i64 = 1;
while q > 0 {
ret *= if q % 2 == 1 { r } else { 1 };
r *= r;
r %= m;
q /= 2;
ret %= m;
}
return ret;
}
#[allow(dead_code)]
fn comb(n: usize, k: usize, m: i64, frac: &[i64], frac_inv: &[i64]) -> i64 {
let mut ret = 1i64;
if n < k {
return 0;
}
ret *= frac[n] * frac_inv[n - k];
ret %= m;
ret *= frac_inv[k];
ret %= m;
ret
}
#[derive(Debug)]
struct Piece {
mark: char,
y: i32,
x: i32,
}
fn main() {
let inputstatus = 1;
let mut buf = String::new();
let filename = "inputrust.txt";
if inputstatus == 0 {
let mut f = File::open(filename).expect("file not found");
f.read_to_string(&mut buf)
.expect("something went wrong reading the file");
} else {
std::io::stdin().read_to_string(&mut buf).unwrap();
}
let mut iter = buf.split_whitespace();
let _: usize = iter.next().unwrap().parse().unwrap();
let m: usize = iter.next().unwrap().parse().unwrap();
let mut ans = true;
let mut t = 0i64;
let mut x = 0i64;
for _ in 0..m {
let ti: i64 = iter.next().unwrap().parse().unwrap();
let xi: i64 = iter.next().unwrap().parse().unwrap();
if (ti - t) < (x - xi).abs() {
ans = false;
break;
}
t = ti;
x = xi;
}
let ans = if ans { "Yes" } else { "No" };
println!("{}", ans);
// let n = iter.next().unwrap().parse().unwrap();
// println!("{}", n);
// println!("{:?}", cum_num);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0