結果
問題 | No.118 門松列(2) |
ユーザー | 紙ぺーぱー |
提出日時 | 2015-05-10 22:29:33 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 7,727 bytes |
コンパイル時間 | 1,079 ms |
コンパイル使用メモリ | 113,920 KB |
実行使用メモリ | 19,224 KB |
最終ジャッジ日時 | 2024-07-05 22:06:24 |
合計ジャッジ時間 | 3,200 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 46 ms
18,840 KB |
testcase_02 | AC | 47 ms
19,224 KB |
testcase_03 | AC | 47 ms
18,836 KB |
testcase_04 | AC | 47 ms
19,092 KB |
testcase_05 | AC | 49 ms
18,972 KB |
testcase_06 | AC | 32 ms
19,072 KB |
testcase_07 | AC | 31 ms
18,944 KB |
testcase_08 | AC | 32 ms
19,072 KB |
testcase_09 | AC | 47 ms
18,964 KB |
testcase_10 | AC | 41 ms
18,944 KB |
testcase_11 | AC | 41 ms
19,036 KB |
testcase_12 | AC | 40 ms
19,200 KB |
testcase_13 | AC | 40 ms
18,944 KB |
testcase_14 | AC | 48 ms
18,968 KB |
testcase_15 | AC | 40 ms
18,944 KB |
testcase_16 | AC | 44 ms
18,780 KB |
testcase_17 | AC | 39 ms
19,072 KB |
testcase_18 | AC | 43 ms
19,160 KB |
testcase_19 | AC | 45 ms
18,904 KB |
testcase_20 | AC | 45 ms
18,904 KB |
testcase_21 | AC | 46 ms
18,968 KB |
testcase_22 | AC | 42 ms
18,944 KB |
testcase_23 | AC | 43 ms
19,092 KB |
testcase_24 | AC | 41 ms
19,036 KB |
testcase_25 | AC | 43 ms
18,904 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.Linq; using System.Collections.Generic; using Debug = System.Diagnostics.Debug; using StringBuilder = System.Text.StringBuilder; using System.Numerics; namespace Program { public class Solver { public void Solve() { var map = new HashMap<int, int>(); var n = sc.Integer(); foreach (var x in sc.Integer(n)) map[x]++; ModInteger ans = 0; var a = map.OrderBy(x => x.Key).Select(x => x.Value).ToArray(); for (int i = 0; i < a.Length; i++) for (int j = i + 1; j < a.Length; j++) for (int k = j + 1; k < a.Length; k++) ans += a[i] * a[j] * a[k]; IO.Printer.Out.WriteLine(ans); } public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput()); static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; } static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; } } } #region Ex namespace Program.IO { using System.IO; using System.Text; using System.Globalization; public class Printer : StreamWriter { static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; } public static Printer Out { get; set; } public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } } public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { } public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { } public void Write<T>(string format, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); } public void WriteLine<T>(string format, IEnumerable<T> source) { base.WriteLine(format, source.OfType<object>().ToArray()); } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } public readonly Stream str; private readonly byte[] buf = new byte[1024]; private int len, ptr; public bool isEof = false; public bool IsEndOfStream { get { return isEof; } } private byte read() { if (isEof) return 0; if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } } return buf[ptr++]; } public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; } public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } public long Long() { if (isEof) return long.MinValue; long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != '-' && (b < '0' || '9' < b)); if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = ret * 10 + b - '0'; } } public int Integer() { return (isEof) ? int.MinValue : (int)Long(); } public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); } private T[] enumerate<T>(int n, Func<T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(); return a; } public char[] Char(int n) { return enumerate(n, Char); } public string[] Scan(int n) { return enumerate(n, Scan); } public double[] Double(int n) { return enumerate(n, Double); } public int[] Integer(int n) { return enumerate(n, Integer); } public long[] Long(int n) { return enumerate(n, Long); } } } static class Ex { static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); } static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); } static public void Main() { var solver = new Program.Solver(); solver.Solve(); Program.IO.Printer.Out.Flush(); } } #endregion #region ModNumber public partial struct ModInteger { public const long Mod = (long)1e9 + 7; public long num; public ModInteger(long n) : this() { num = n % Mod; } public override string ToString() { return num.ToString(); } public static ModInteger operator +(ModInteger l, ModInteger r) { var n = l.num + r.num; if (n >= Mod)n -= Mod; return new ModInteger(n); } public static ModInteger operator -(ModInteger l, ModInteger r) { var n = l.num - r.num; if (n < 0)n += Mod; return new ModInteger(n); } public static ModInteger operator *(ModInteger l, ModInteger r) { return new ModInteger((l.num * r.num) % Mod); } public static implicit operator ModInteger(long n) { return new ModInteger(n); } } #endregion #region Mod #region ModPow public partial struct ModInteger { static public ModInteger Pow(ModInteger v, ModInteger k) { ModInteger ret = 1; var n = v.num; for (; n > 0; n >>= 1, v *= v) { if ((n & 1) == 1) ret = ret * v; } return ret; } } #endregion #region Inverse public partial struct ModInteger { static public ModInteger Inverse(ModInteger v) { long p, q; ExGCD(v.num, Mod, out p, out q); return new ModInteger(p % Mod + Mod); } static public long ExGCD(long a, long b, out long x, out long y) { var u = new long[] { a, 1, 0 }; var v = new long[] { b, 0, 1 }; while (v[0] != 0) { var t = u[0] / v[0]; for (int i = 0; i < 3; i++) { var tmp = u[i] - t * v[i]; u[i] = v[i]; v[i] = tmp; } } x = u[1]; y = u[2]; if (u[0] > 0) return u[0]; for (int i = 0; i < 3; i++) u[i] = -u[i]; return u[0]; } } #endregion #region Permutaion public class ModTable { ModInteger[] perm, inv; public ModTable(int n) { perm = new ModInteger[n + 1]; inv = new ModInteger[n + 1]; perm[0] = 1; for (int i = 1; i <= n; i++) perm[i] = perm[i - 1] * i; inv[n] = ModInteger.Inverse(perm[n]); for (int i = n - 1; i >= 0; i--) inv[i] = inv[i + 1] * (i + 1); inv[0] = inv[1]; } public ModInteger this[int k] { get { return perm[k]; } } public ModInteger Inverse(int k) { return inv[k]; } public ModInteger Permutation(int n, int k) { if (n < 0 || n > perm.Length) return 0; if (k < 0 || k > n) return 0; return perm[n] * inv[n - k]; } public ModInteger Combination(int n, int r) { if (n < 0 || n > perm.Length || r < 0 || r > n) return 0; return perm[n] * inv[n - r] * inv[r]; } public ModInteger RepeatedCombination(int n, int k) { if (k == 0) return 1; return Combination(n + k - 1, k); } } #endregion #endregion #region HashMap class HashMap<K, V> : Dictionary<K, V> { new public V this[K i] { get { V v; return TryGetValue(i, out v) ? v : base[i] = default(V); } set { base[i] = value; } } } #endregion