Submission #997905
Source Code Expand
using System; using System.Collections; using System.Collections.Generic; using System.Diagnostics; using System.IO; using System.Linq; //using System.Numerics; //comment out if AOJ using System.Text; using Problem = Tmp.Problem; using MyIO; #pragma warning disable //for AOJ namespace Tmp { class Problem : IDisposable { bool IsGCJ; int Repeat; Scanner sc; Printer pr; public Problem(bool isGCJ, Scanner scanner, Printer printer) { sc = scanner; pr = printer; IsGCJ = isGCJ; if (isGCJ) Repeat = sc.nextInt(); else Read(); } public Problem(bool isGCJ) : this(isGCJ, new Scanner(), new Printer()) { } public Problem(bool isGCJ, Scanner scanner) : this(isGCJ, scanner, new Printer()) { } public Problem(bool isGCJ, Printer printer) : this(isGCJ, new Scanner(), printer) { } public void Solve() { if (IsGCJ) for (var i = 0; i < Repeat; i++) { Read(); pr.Write("Case #" + (i + 1) + ": "); SolveOne(); } else SolveOne(); } public void Dispose() { sc.Dispose(); pr.Dispose(); } public int Size { get { return 1; } } public const long Mod = 1000000007; // 使用する変数をここに書く // string S; // int a; /// <summary> /// 読み込み処理をここに書く /// </summary> void Read() { } /// <summary> /// メイン処理をここに書く /// </summary> void SolveOne() { int n = sc.nextInt(); int m = sc.nextInt(); int k = sc.nextInt(); int[] a = sc.nextInt(n); if (m != n) return; int[] asort = new int[n]; for (int i = 0; i < n; i++) { asort[i] = a[i]; } Array.Sort(asort); Array.Reverse(asort); HashMap<int, int> map = new HashMap<int, int>(); for (int i = 0; i < k; i++) { map[asort[i]]++; } long ans = 0; long cnt = 0; for (int i = 0; i < n; i++) { if(map[a[i]]>0) { map[a[i]]--; cnt++; ans += cnt * a[i]; } } Console.WriteLine(ans); } } } class Program { //public static RandomSFMT rand = new RandomSFMT(); public static bool IsJudgeMode = true; public static bool IsGCJMode = false; public static bool IsSolveCreated = true; static void Main() { if (IsJudgeMode) if (IsGCJMode) using (var problem = new Problem(true, new Scanner("C-large-practice.in.txt"), new Printer("output.txt"))) problem.Solve(); else using (var problem = new Problem(false, new Printer())) problem.Solve(); else { var num = 1; int size = 0; decimal time = 0; for (var tmp = 0; tmp < num; tmp++) { using (var P = IsSolveCreated ? new Problem(false, new Scanner("input.txt"), new Printer()) : new Problem(false)) { size = P.Size; //time += Func.MeasureTime(() => P.Solve()); } } Console.WriteLine("{0}, {1}ms", size, time / num); } } } /// <summary> /// カスタマイズしたIO /// </summary> namespace MyIO { class Printer : IDisposable { bool isConsole; TextWriter file; public Printer() { file = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; isConsole = true; } public Printer(string path) { file = new StreamWriter(path, false) { AutoFlush = false }; isConsole = false; } public void Write<T>(T value) { file.Write(value); } public void Write(bool b) { file.Write(b ? "YES" : "NO"); } public void Write(string str, params object[] args) { file.Write(str, args); } public void WriteLine() { file.WriteLine(); } public void WriteLine<T>(T value) { file.WriteLine(value); } public void WriteLine(bool b) { file.WriteLine(b ? "YES" : "NO"); } public void WriteLine<T>(IEnumerable<T> list) { foreach (var x in list) file.WriteLine(x); } public void WriteLine<T>(List<T> list) { foreach (var x in list) file.WriteLine(x); } public void WriteLine<T>(T[] list) { foreach (var x in list) file.WriteLine(x); } public void WriteLine(string str, params object[] args) { file.WriteLine(str, args); } public void Dispose() { file.Flush(); if (!isConsole) file.Dispose(); } } class Scanner : IDisposable { bool isConsole; TextReader file; public Scanner() { file = Console.In; } public Scanner(string path) { file = new StreamReader(path); isConsole = false; } public void Dispose() { if (!isConsole) file.Dispose(); } #region next読み込み string[] nextBuffer = new string[0]; int BufferCnt = 0; char[] cs = new char[] { ' ' }; public string next() { while (BufferCnt >= nextBuffer.Length) { string st = file.ReadLine(); while (st == "") st = file.ReadLine(); nextBuffer = st.Split(cs, StringSplitOptions.RemoveEmptyEntries); BufferCnt = 0; } return nextBuffer[BufferCnt++]; } public int nextInt() { return int.Parse(next()); } public long nextLong() { return long.Parse(next()); } public double nextDouble() { return double.Parse(next()); } 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 string[] next(int n) { return enumerate(n, next); } public double[] nextDouble(int n) { return enumerate(n, nextDouble); } public int[] nextInt(int n) { return enumerate(n, nextInt); } public long[] nextLong(int n) { return enumerate(n, nextLong); } #endregion } } 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; } } }
Submission Info
Submission Time | |
---|---|
Task | A - Struck Out |
User | yu3mars |
Language | C# (Mono 4.6.2.0) |
Score | 0 |
Code Size | 6890 Byte |
Status | WA |
Exec Time | 106 ms |
Memory | 17880 KB |
Judge Result
Set Name | Sample | subtask1 | subtask2 | subtask3 | All | ||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | 0 / 200 | 0 / 300 | 0 / 100 | ||||||||||||||||||||
Status |
|
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_1.txt, sample_2.txt, sample_3.txt |
subtask1 | sample_2.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
subtask2 | sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt |
subtask3 | sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt |
All | sample_1.txt, sample_2.txt, sample_3.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt, subtask_4_1.txt, subtask_4_10.txt, subtask_4_11.txt, subtask_4_12.txt, subtask_4_13.txt, subtask_4_2.txt, subtask_4_3.txt, subtask_4_4.txt, subtask_4_5.txt, subtask_4_6.txt, subtask_4_7.txt, subtask_4_8.txt, subtask_4_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_1.txt | WA | 22 ms | 2904 KB |
sample_2.txt | AC | 29 ms | 3160 KB |
sample_3.txt | WA | 21 ms | 2776 KB |
subtask_1_1.txt | WA | 25 ms | 3032 KB |
subtask_1_2.txt | WA | 34 ms | 4952 KB |
subtask_1_3.txt | WA | 105 ms | 17880 KB |
subtask_1_4.txt | WA | 29 ms | 3928 KB |
subtask_1_5.txt | AC | 106 ms | 17880 KB |
subtask_1_6.txt | AC | 26 ms | 3032 KB |
subtask_1_7.txt | WA | 106 ms | 17880 KB |
subtask_1_8.txt | WA | 106 ms | 17880 KB |
subtask_1_9.txt | WA | 26 ms | 3032 KB |
subtask_2_1.txt | WA | 21 ms | 2776 KB |
subtask_2_2.txt | WA | 21 ms | 2776 KB |
subtask_2_3.txt | WA | 21 ms | 2776 KB |
subtask_2_4.txt | WA | 26 ms | 3032 KB |
subtask_2_5.txt | WA | 21 ms | 2776 KB |
subtask_2_6.txt | AC | 25 ms | 2904 KB |
subtask_2_7.txt | WA | 21 ms | 2776 KB |
subtask_2_8.txt | WA | 21 ms | 2776 KB |
subtask_2_9.txt | WA | 21 ms | 2776 KB |
subtask_3_1.txt | WA | 68 ms | 12248 KB |
subtask_3_2.txt | WA | 68 ms | 12248 KB |
subtask_3_3.txt | WA | 68 ms | 12248 KB |
subtask_3_4.txt | WA | 59 ms | 10328 KB |
subtask_3_5.txt | WA | 23 ms | 3416 KB |
subtask_3_6.txt | WA | 68 ms | 12248 KB |
subtask_3_7.txt | WA | 68 ms | 12248 KB |
subtask_3_8.txt | WA | 26 ms | 4056 KB |
subtask_3_9.txt | WA | 68 ms | 12248 KB |
subtask_4_1.txt | WA | 69 ms | 12248 KB |
subtask_4_10.txt | WA | 69 ms | 12248 KB |
subtask_4_11.txt | WA | 68 ms | 12248 KB |
subtask_4_12.txt | WA | 68 ms | 12120 KB |
subtask_4_13.txt | WA | 68 ms | 12248 KB |
subtask_4_2.txt | WA | 68 ms | 12120 KB |
subtask_4_3.txt | WA | 68 ms | 12120 KB |
subtask_4_4.txt | WA | 69 ms | 12248 KB |
subtask_4_5.txt | WA | 68 ms | 12248 KB |
subtask_4_6.txt | WA | 68 ms | 12248 KB |
subtask_4_7.txt | WA | 83 ms | 12248 KB |
subtask_4_8.txt | WA | 68 ms | 12120 KB |
subtask_4_9.txt | WA | 68 ms | 12248 KB |