結果
問題 | No.1299 Random Array Score |
ユーザー | keymoon |
提出日時 | 2020-11-27 21:23:41 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 143 ms / 2,000 ms |
コード長 | 2,937 bytes |
コンパイル時間 | 1,008 ms |
コンパイル使用メモリ | 112,056 KB |
実行使用メモリ | 52,244 KB |
最終ジャッジ日時 | 2024-07-23 21:54:08 |
合計ジャッジ時間 | 5,553 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
27,120 KB |
testcase_01 | AC | 30 ms
22,960 KB |
testcase_02 | AC | 31 ms
25,004 KB |
testcase_03 | AC | 127 ms
46,732 KB |
testcase_04 | AC | 125 ms
44,552 KB |
testcase_05 | AC | 108 ms
44,484 KB |
testcase_06 | AC | 101 ms
43,328 KB |
testcase_07 | AC | 103 ms
43,796 KB |
testcase_08 | AC | 124 ms
46,564 KB |
testcase_09 | AC | 37 ms
26,128 KB |
testcase_10 | AC | 68 ms
31,568 KB |
testcase_11 | AC | 45 ms
27,012 KB |
testcase_12 | AC | 97 ms
43,012 KB |
testcase_13 | AC | 123 ms
46,164 KB |
testcase_14 | AC | 99 ms
41,012 KB |
testcase_15 | AC | 99 ms
43,260 KB |
testcase_16 | AC | 100 ms
41,552 KB |
testcase_17 | AC | 46 ms
26,952 KB |
testcase_18 | AC | 71 ms
32,136 KB |
testcase_19 | AC | 77 ms
37,008 KB |
testcase_20 | AC | 59 ms
32,172 KB |
testcase_21 | AC | 38 ms
25,796 KB |
testcase_22 | AC | 48 ms
26,824 KB |
testcase_23 | AC | 99 ms
41,176 KB |
testcase_24 | AC | 106 ms
44,060 KB |
testcase_25 | AC | 99 ms
43,176 KB |
testcase_26 | AC | 36 ms
27,840 KB |
testcase_27 | AC | 50 ms
27,496 KB |
testcase_28 | AC | 47 ms
27,208 KB |
testcase_29 | AC | 53 ms
28,464 KB |
testcase_30 | AC | 95 ms
40,828 KB |
testcase_31 | AC | 54 ms
26,288 KB |
testcase_32 | AC | 123 ms
44,176 KB |
testcase_33 | AC | 142 ms
50,452 KB |
testcase_34 | AC | 92 ms
40,764 KB |
testcase_35 | AC | 143 ms
52,244 KB |
testcase_36 | AC | 94 ms
40,648 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Collections; using System.Collections.Generic; using System.Diagnostics; using System.IO; using System.Linq; using System.Numerics; using System.Text; using System.Text.RegularExpressions; using System.Threading.Tasks; using static System.Math; public static class P { public static void Main() { var nk = Console.ReadLine().Split().Select(long.Parse).ToArray(); var k = nk[1]; var a = Console.ReadLine().Split().Select(int.Parse).ToArray(); var sum = a.Aggregate(new ModInt(0), (x, y) => x + y); Console.WriteLine(sum * Power(2, k)); } static ModInt Power(ModInt n, long m) { ModInt pow = n; ModInt res = 1; while (m > 0) { if ((m & 1) == 1) res *= pow; pow *= pow; m >>= 1; } return res; } } struct ModInt { public const int Mod = 998244353; const long POSITIVIZER = ((long)Mod) << 31; long Data; public ModInt(long data) { if ((Data = data % Mod) < 0) Data += Mod; } public static implicit operator long(ModInt modInt) => modInt.Data; public static implicit operator ModInt(long val) => new ModInt(val); public static ModInt operator +(ModInt a, int b) => new ModInt() { Data = (a.Data + b + POSITIVIZER) % Mod }; public static ModInt operator +(ModInt a, long b) => new ModInt(a.Data + b); public static ModInt operator +(ModInt a, ModInt b) { long res = a.Data + b.Data; return new ModInt() { Data = res >= Mod ? res - Mod : res }; } public static ModInt operator -(ModInt a, int b) => new ModInt() { Data = (a.Data - b + POSITIVIZER) % Mod }; public static ModInt operator -(ModInt a, long b) => new ModInt(a.Data - b); public static ModInt operator -(ModInt a, ModInt b) { long res = a.Data - b.Data; return new ModInt() { Data = res < 0 ? res + Mod : res }; } public static ModInt operator *(ModInt a, int b) => new ModInt(a.Data * b); public static ModInt operator *(ModInt a, long b) => a * new ModInt(b); public static ModInt operator *(ModInt a, ModInt b) => new ModInt() { Data = a.Data * b.Data % Mod }; public static ModInt operator /(ModInt a, ModInt b) => new ModInt() { Data = a.Data * GetInverse(b) % Mod }; public static bool operator ==(ModInt a, ModInt b) => a.Data == b.Data; public static bool operator !=(ModInt a, ModInt b) => a.Data != b.Data; public override string ToString() => Data.ToString(); public override bool Equals(object obj) => (ModInt)obj == this; public override int GetHashCode() => (int)Data; static long GetInverse(long a) { long div, p = Mod, x1 = 1, y1 = 0, x2 = 0, y2 = 1; while (true) { if (p == 1) return x2 + Mod; div = a / p; x1 -= x2 * div; y1 -= y2 * div; a %= p; if (a == 1) return x1 + Mod; div = p / a; x2 -= x1 * div; y2 -= y1 * div; p %= a; } } }