結果
問題 | No.1470 Mex Sum |
ユーザー | itt828 |
提出日時 | 2021-04-09 21:40:45 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 152 ms / 2,000 ms |
コード長 | 5,584 bytes |
コンパイル時間 | 3,151 ms |
コンパイル使用メモリ | 109,440 KB |
実行使用メモリ | 38,016 KB |
最終ジャッジ日時 | 2024-06-25 04:41:49 |
合計ジャッジ時間 | 11,124 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 30 ms
19,072 KB |
testcase_01 | AC | 29 ms
19,072 KB |
testcase_02 | AC | 44 ms
22,016 KB |
testcase_03 | AC | 46 ms
21,888 KB |
testcase_04 | AC | 44 ms
22,016 KB |
testcase_05 | AC | 43 ms
22,016 KB |
testcase_06 | AC | 45 ms
22,016 KB |
testcase_07 | AC | 46 ms
21,888 KB |
testcase_08 | AC | 45 ms
21,760 KB |
testcase_09 | AC | 44 ms
22,016 KB |
testcase_10 | AC | 45 ms
22,016 KB |
testcase_11 | AC | 44 ms
21,632 KB |
testcase_12 | AC | 147 ms
37,760 KB |
testcase_13 | AC | 145 ms
37,376 KB |
testcase_14 | AC | 144 ms
37,504 KB |
testcase_15 | AC | 145 ms
37,632 KB |
testcase_16 | AC | 144 ms
37,376 KB |
testcase_17 | AC | 145 ms
37,376 KB |
testcase_18 | AC | 144 ms
37,248 KB |
testcase_19 | AC | 145 ms
37,376 KB |
testcase_20 | AC | 147 ms
37,376 KB |
testcase_21 | AC | 149 ms
37,888 KB |
testcase_22 | AC | 149 ms
37,760 KB |
testcase_23 | AC | 149 ms
37,760 KB |
testcase_24 | AC | 150 ms
37,760 KB |
testcase_25 | AC | 150 ms
37,888 KB |
testcase_26 | AC | 152 ms
37,888 KB |
testcase_27 | AC | 150 ms
38,016 KB |
testcase_28 | AC | 150 ms
37,888 KB |
testcase_29 | AC | 150 ms
37,760 KB |
testcase_30 | AC | 150 ms
37,760 KB |
testcase_31 | AC | 148 ms
37,888 KB |
testcase_32 | AC | 150 ms
38,016 KB |
testcase_33 | AC | 150 ms
37,760 KB |
testcase_34 | AC | 150 ms
37,760 KB |
testcase_35 | AC | 149 ms
38,016 KB |
testcase_36 | AC | 150 ms
37,888 KB |
testcase_37 | AC | 137 ms
36,096 KB |
testcase_38 | AC | 136 ms
36,096 KB |
testcase_39 | AC | 135 ms
35,840 KB |
testcase_40 | AC | 137 ms
35,968 KB |
testcase_41 | AC | 136 ms
36,096 KB |
testcase_42 | AC | 137 ms
36,224 KB |
testcase_43 | AC | 136 ms
36,224 KB |
testcase_44 | AC | 137 ms
36,096 KB |
testcase_45 | AC | 136 ms
35,968 KB |
testcase_46 | AC | 139 ms
36,096 KB |
testcase_47 | AC | 137 ms
35,968 KB |
testcase_48 | AC | 138 ms
35,968 KB |
testcase_49 | AC | 137 ms
35,968 KB |
testcase_50 | AC | 137 ms
35,840 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
#region itumono 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 static System.Math; using static Output; using static Consts; #region I/O public static class Output { public static void Put(string a) => Console.WriteLine(a); public static void Put(params object[] i) => Put(string.Join(" ", i)); public static void Put<T>(IEnumerable<T> a) => Put(string.Join(" ", a)); public static void PutV<T>(IEnumerable<T> a) { foreach (var z in a) Put(z); } public static void YN(bool i) { if (i) Put("Yes"); else Put("No"); } } public class Input { public static string Str => Console.ReadLine(); public static bool IsTypeEqual<T, U>() => typeof(T).Equals(typeof(U)); public static T ConvertType<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T)); public static T Cast<T>(string s) { if (IsTypeEqual<T, int>()) return ConvertType<T, int>(int.Parse(s)); else if (IsTypeEqual<T, long>()) return ConvertType<T, long>(long.Parse(s)); else if (IsTypeEqual<T, double>()) return ConvertType<T, double>(double.Parse(s)); else if (IsTypeEqual<T, char>()) return ConvertType<T, char>(char.Parse(s)); else if (IsTypeEqual<T, BigInteger>()) return ConvertType<T, BigInteger>(BigInteger.Parse(s)); else if (IsTypeEqual<T, decimal>()) return ConvertType<T, decimal>(decimal.Parse(s)); else return ConvertType<T, string>(s); } public static T[] Castarr<T>(string[] s) { var ret = new T[s.Length]; int i = 0; if (IsTypeEqual<T, char>()) { var list = new List<T>(); foreach (var t in s) { foreach (var u in t) { list.Add(ConvertType<T, char>(char.Parse(u.ToString()))); } } return list.ToArray(); } foreach (var t in s) { if (IsTypeEqual<T, int>()) ret[i++] = ConvertType<T, int>(int.Parse(t)); else if (IsTypeEqual<T, long>()) ret[i++] = ConvertType<T, long>(long.Parse(t)); else if (IsTypeEqual<T, double>()) ret[i++] = ConvertType<T, double>(double.Parse(t)); else if (IsTypeEqual<T, BigInteger>()) ret[i++] = ConvertType<T, BigInteger>(BigInteger.Parse(t)); else ret[i++] = ConvertType<T, string>(t); } return ret; } Queue<string> q = new Queue<string>(); void next() { var ss = Str.Split(' '); foreach (var item in ss) q.Enqueue(item); } public T cin<T>() { if (!q.Any()) next(); return Cast<T>(q.Dequeue()); } public T[] cinarr<T>() { return Castarr<T>(Str.Split(' ')); } public T[] cinarr<T>(int n) { var ret = new T[n]; for (int i = 0; i < n; ++i) ret[i] = cin<T>(); return ret; } public int Int => cin<int>(); public long Long => cin<long>(); public double Double => cin<double>(); public char Char => cin<char>(); public string String => cin<string>(); public BigInteger BI => cin<BigInteger>(); public int[] Intarr => cinarr<int>(); public long[] Longarr => cinarr<long>(); public double[] Doublearr => cinarr<double>(); public char[] Chararr => cinarr<char>(); public string[] Stringarr => cinarr<string>(); public BigInteger[] BIarr => cinarr<BigInteger>(); public void cin<T>(out T t) { t = cin<T>(); } public void mul<T, U>(out T t, out U u) { t = cin<T>(); u = cin<U>(); } public void mul<T, U, V>(out T t, out U u, out V v) { t = cin<T>(); u = cin<U>(); v = cin<V>(); } public void mul<T, U, V, W>(out T t, out U u, out V v, out W w) { t = cin<T>(); u = cin<U>(); v = cin<V>(); w = cin<W>(); } public void mul<T, U, V, W, X>(out T t, out U u, out V v, out W w, out X x) { t = cin<T>(); u = cin<U>(); v = cin<V>(); w = cin<W>(); x = cin<X>(); } public void mul<T, U, V, W, X, Y>(out T t, out U u, out V v, out W w, out X x, out Y y) { t = cin<T>(); u = cin<U>(); v = cin<V>(); w = cin<W>(); x = cin<X>(); y = cin<Y>(); } public void mul<T, U, V, W, X, Y, Z>(out T t, out U u, out V v, out W w, out X x, out Y y, out Z z) { t = cin<T>(); u = cin<U>(); v = cin<V>(); w = cin<W>(); x = cin<X>(); y = cin<Y>(); z = cin<Z>(); } } #endregion class Program { static void Main(string[] args) { var CP = new CP(); CP.Solve(); } } #endregion itumono public static class Consts { public const int INF = 1 << 30; //public const long INF = 1L << 60; public const int MOD = 1000000007; //public const int MOD = 998244353; } public class CP { Input cin = new Input(); public void Solve() { var N = cin.Int; var A = cin.Intarr; Array.Sort(A); long ans = 0; var cnt1 = new int[N]; var cnt2 = new int[N]; var cnt = new int[N]; for (int i = N - 1; i >= 0; --i) { if (A[i] == 1) cnt1[i]++; else if (A[i] == 2) cnt2[i]++; else cnt[i]++; cnt1[i] += (i == N - 1 ? 0 : cnt1[i + 1]); cnt2[i] += (i == N - 1 ? 0 : cnt2[i + 1]); cnt[i] += (i == N - 1 ? 0 : cnt[i + 1]); } for (int i = 0; i < N - 1; ++i) { if (A[i] == 1) { ans += cnt1[i + 1] * 2; ans += cnt2[i + 1] * 3; ans += cnt[i + 1] * 2; } else ans += N - 1 - i; } Put(ans); } }