結果
問題 | No.1623 三角形の制作 |
ユーザー |
![]() |
提出日時 | 2021-07-25 11:31:32 |
言語 | Rust (1.77.0 + proconio) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,436 bytes |
コンパイル時間 | 14,122 ms |
コンパイル使用メモリ | 377,492 KB |
実行使用メモリ | 10,752 KB |
最終ジャッジ日時 | 2024-07-20 19:17:03 |
合計ジャッジ時間 | 18,543 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | OLE | - |
testcase_03 | -- | - |
testcase_04 | -- | - |
testcase_05 | -- | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
コンパイルメッセージ
warning: unused import: `std::collections::HashMap` --> src/main.rs:1:5 | 1 | use std::collections::HashMap; | ^^^^^^^^^^^^^^^^^^^^^^^^^ | = note: `#[warn(unused_imports)]` on by default
ソースコード
use std::collections::HashMap; fn getline() -> String{ let mut __ret=String::new(); std::io::stdin().read_line(&mut __ret).ok(); return __ret; } fn main() { let n=getline(); let n:Vec<_>=n.trim().split(' ').collect(); let n:i32=n[0].parse().unwrap(); let r=getline(); let r:Vec<_>=r.trim().split(' ').collect(); let r:Vec<i32>=r.iter().map(|v| v.parse().unwrap()).collect(); let g=getline(); let g:Vec<_>=g.trim().split(' ').collect(); let g:Vec<i32>=g.iter().map(|v| v.parse().unwrap()).collect(); let mut ag = vec![0; 3001]; for i in 0..n { ag[g[i as usize] as usize] = ag[g[i as usize] as usize] + 1; } let b=getline(); let b:Vec<_>=b.trim().split(' ').collect(); let b:Vec<i32>=b.iter().map(|v| v.parse().unwrap()).collect(); let mut ab = vec![0; 3001]; for i in 0..n { ab[b[i as usize] as usize] = ab[b[i as usize] as usize] + 1; } let mut ans:i32=0; let mut ar = vec![0; 6002]; for i in 0..n { ar[r[i as usize] as usize] = ar[r[i as usize] as usize] + 1; } let mut aar = vec![0; 6002]; aar[0] = ar[0]; for i in 1..6002 { aar[i as usize] = aar[(i-1) as usize] + ar[i]; } for j in 1..3001 { for k in 1..3001 { let bi = j + k -1; let si = std::cmp::max(j,k) -1; let add = (aar[bi] - aar[si]) * ag[j as usize] * ab[k as usize]; if (ag[j as usize] != 0) & (ab[k as usize] != 0) { println!("{} {} {}",bi, si, add) } ans = ans + add; } } println!("{}",ans) }