結果
問題 | No.1359 [Zelkova 3rd Tune] 四人セゾン |
ユーザー | Moss_Local |
提出日時 | 2021-01-22 21:52:55 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 206 ms / 2,000 ms |
コード長 | 5,536 bytes |
コンパイル時間 | 1,609 ms |
コンパイル使用メモリ | 150,028 KB |
実行使用メモリ | 13,932 KB |
最終ジャッジ日時 | 2023-08-27 18:42:16 |
合計ジャッジ時間 | 18,099 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,008 KB |
testcase_01 | AC | 1 ms
5,020 KB |
testcase_02 | AC | 1 ms
4,948 KB |
testcase_03 | AC | 104 ms
8,592 KB |
testcase_04 | AC | 103 ms
8,580 KB |
testcase_05 | AC | 92 ms
7,472 KB |
testcase_06 | AC | 93 ms
7,492 KB |
testcase_07 | AC | 135 ms
10,760 KB |
testcase_08 | AC | 136 ms
10,736 KB |
testcase_09 | AC | 38 ms
4,944 KB |
testcase_10 | AC | 38 ms
5,008 KB |
testcase_11 | AC | 180 ms
13,684 KB |
testcase_12 | AC | 180 ms
13,752 KB |
testcase_13 | AC | 111 ms
7,924 KB |
testcase_14 | AC | 111 ms
7,924 KB |
testcase_15 | AC | 102 ms
7,812 KB |
testcase_16 | AC | 101 ms
7,792 KB |
testcase_17 | AC | 191 ms
12,400 KB |
testcase_18 | AC | 191 ms
12,408 KB |
testcase_19 | AC | 163 ms
11,620 KB |
testcase_20 | AC | 163 ms
11,676 KB |
testcase_21 | AC | 179 ms
10,984 KB |
testcase_22 | AC | 178 ms
10,988 KB |
testcase_23 | AC | 117 ms
8,736 KB |
testcase_24 | AC | 119 ms
8,744 KB |
testcase_25 | AC | 19 ms
5,012 KB |
testcase_26 | AC | 18 ms
5,016 KB |
testcase_27 | AC | 60 ms
4,952 KB |
testcase_28 | AC | 61 ms
4,948 KB |
testcase_29 | AC | 76 ms
5,760 KB |
testcase_30 | AC | 77 ms
5,760 KB |
testcase_31 | AC | 108 ms
7,920 KB |
testcase_32 | AC | 103 ms
7,924 KB |
testcase_33 | AC | 76 ms
6,980 KB |
testcase_34 | AC | 75 ms
6,984 KB |
testcase_35 | AC | 100 ms
7,580 KB |
testcase_36 | AC | 99 ms
7,588 KB |
testcase_37 | AC | 20 ms
4,952 KB |
testcase_38 | AC | 20 ms
4,948 KB |
testcase_39 | AC | 17 ms
5,016 KB |
testcase_40 | AC | 17 ms
5,012 KB |
testcase_41 | AC | 36 ms
5,008 KB |
testcase_42 | AC | 35 ms
4,952 KB |
testcase_43 | AC | 28 ms
4,948 KB |
testcase_44 | AC | 188 ms
10,724 KB |
testcase_45 | AC | 80 ms
6,600 KB |
testcase_46 | AC | 27 ms
4,952 KB |
testcase_47 | AC | 136 ms
10,132 KB |
testcase_48 | AC | 125 ms
9,028 KB |
testcase_49 | AC | 125 ms
8,808 KB |
testcase_50 | AC | 96 ms
7,048 KB |
testcase_51 | AC | 6 ms
4,948 KB |
testcase_52 | AC | 169 ms
13,004 KB |
testcase_53 | AC | 189 ms
13,892 KB |
testcase_54 | AC | 200 ms
11,548 KB |
testcase_55 | AC | 197 ms
13,932 KB |
testcase_56 | AC | 199 ms
11,464 KB |
testcase_57 | AC | 201 ms
11,464 KB |
testcase_58 | AC | 199 ms
13,920 KB |
testcase_59 | AC | 196 ms
11,552 KB |
testcase_60 | AC | 193 ms
13,392 KB |
testcase_61 | AC | 184 ms
13,932 KB |
testcase_62 | AC | 199 ms
13,860 KB |
testcase_63 | AC | 196 ms
11,548 KB |
testcase_64 | AC | 202 ms
13,312 KB |
testcase_65 | AC | 201 ms
13,656 KB |
testcase_66 | AC | 197 ms
11,548 KB |
testcase_67 | AC | 206 ms
13,392 KB |
testcase_68 | AC | 194 ms
13,392 KB |
testcase_69 | AC | 180 ms
13,660 KB |
testcase_70 | AC | 180 ms
13,324 KB |
testcase_71 | AC | 177 ms
13,400 KB |
testcase_72 | AC | 204 ms
13,368 KB |
testcase_73 | AC | 172 ms
11,480 KB |
testcase_74 | AC | 171 ms
11,548 KB |
testcase_75 | AC | 173 ms
13,924 KB |
testcase_76 | AC | 171 ms
13,928 KB |
testcase_77 | AC | 171 ms
11,468 KB |
コンパイルメッセージ
warning: unnecessary parentheses around type --> Main.rs:45:15 | 45 | fn readi() -> (i64) { | ^ ^ | = note: `#[warn(unused_parens)]` on by default help: remove these parentheses | 45 - fn readi() -> (i64) { 45 + fn readi() -> i64 { | warning: variable does not need to be mutable --> Main.rs:192:13 | 192 | let mut ma = max(max(p1[i], p2[i]), max(p3[i], p4[i])); | ----^^ | | | help: remove this `mut` | = note: `#[warn(unused_mut)]` on by default warning: variable does not need to be mutable --> Main.rs:193:13 | 193 | let mut mi = min(min(p1[i], p2[i]), min(p3[i], p4[i])); | ----^^ | | | help: remove this `mut` warning: 3 warnings emitted
ソースコード
// -*- coding:utf-8-unix -*- #![allow(dead_code)] #![allow(unused_imports)] 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 INF: i64 = 2147483647; const UINF: usize = INF as usize; const MEM_SIZE: usize = 202020; // 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; use btree_map::{Keys, Values}; // 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(), ) } fn readin() -> (usize, usize, char) { 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::<char>().unwrap(), ) } // let m = 0 as usize; pub fn mod_pow(x: usize, n: usize, m: usize) -> usize { let mut res = 1; let mut x = x % m; let mut n = n; while n > 0 { if n & 1 == 1 { res = (res * x) % m; } x = (x * x) % m; n >>= 1; } res } fn solve() { let (n, k, m) = readuuu(); let mut p1: Vec<usize> = read_vec(); p1.sort(); let mut p2: Vec<usize> = read_vec(); p2.sort(); let mut p3: Vec<usize> = read_vec(); p3.sort(); let mut p4: Vec<usize> = read_vec(); p4.sort(); let mut res = 0 as usize; for i in 0..n { let mut ma = max(max(p1[i], p2[i]), max(p3[i], p4[i])); let mut mi = min(min(p1[i], p2[i]), min(p3[i], p4[i])); // let mut re= 0 as usize; res += mod_pow(ma - mi, k, m); res %= m; } println!("{:?}", res); return; } fn main() { solve() }