結果
問題 | No.297 カードの数式 |
ユーザー | 紙ぺーぱー |
提出日時 | 2015-11-06 22:50:42 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 7,198 bytes |
コンパイル時間 | 1,203 ms |
コンパイル使用メモリ | 119,008 KB |
実行使用メモリ | 27,440 KB |
最終ジャッジ日時 | 2024-09-13 13:25:37 |
合計ジャッジ時間 | 2,924 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 34 ms
25,188 KB |
testcase_01 | AC | 31 ms
27,208 KB |
testcase_02 | AC | 30 ms
22,704 KB |
testcase_03 | AC | 34 ms
27,228 KB |
testcase_04 | WA | - |
testcase_05 | AC | 34 ms
27,044 KB |
testcase_06 | AC | 33 ms
25,132 KB |
testcase_07 | AC | 30 ms
27,068 KB |
testcase_08 | AC | 30 ms
25,060 KB |
testcase_09 | AC | 31 ms
26,840 KB |
testcase_10 | AC | 31 ms
24,804 KB |
testcase_11 | AC | 31 ms
27,096 KB |
testcase_12 | WA | - |
testcase_13 | AC | 30 ms
25,024 KB |
testcase_14 | AC | 30 ms
24,804 KB |
testcase_15 | AC | 31 ms
25,188 KB |
testcase_16 | AC | 30 ms
27,204 KB |
testcase_17 | AC | 31 ms
25,188 KB |
testcase_18 | AC | 31 ms
25,160 KB |
testcase_19 | AC | 34 ms
27,052 KB |
testcase_20 | WA | - |
testcase_21 | AC | 34 ms
27,188 KB |
testcase_22 | AC | 30 ms
22,960 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
コンパイルメッセージ
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.Diagnostics; using System.Collections.Generic; using Debug = System.Diagnostics.Debug; using StringBuilder = System.Text.StringBuilder; using System.Numerics; using Number = System.Int32; namespace Program { public class Solver { public void Solve() { var n = sc.Integer(); var p = 0; var m = 0; var a = new List<int>(); for (int i = 0; i < n; i++) { var c = sc.Char(); if (c == '+') p++; else if (c == '-') m++; else a.Add(c - '0'); } a.Sort(); long max = 0; { var ptr = 0; for (int i = 0; i < m; i++) max -= a[ptr++]; for (int i = m; i < m + p; i++) max += a[ptr++]; long v = 0; for (int i = ptr; i < a.Count; i++) v = v * 10 + a[ptr++]; max += long.Parse(v.ToString().Reverse().AsString()); } if (m == 0) { var b = a.Where(x => x != 0).ToArray(); var len = b.Length; var k = p + 1; var val = new int[k]; for (int i = 0; i < b.Length; i++) { val[i % k] = val[i % k] * 10 + b[i]; } IO.Printer.Out.WriteLine("{0} {1}", max, val.Sum()); } else { long min = 0; var ptr = 0; for (int i = 0; i < p + 1; i++) min += a[ptr++]; for (int j = p + 1; j < p + 1 + m - 1; j++) min -= a[ptr++]; long v = 0; for (int i = ptr; i < a.Count; i++) v = v * 10 + a[ptr++]; min -= long.Parse(v.ToString().Reverse().AsString()); IO.Printer.Out.WriteLine("{0} {1}", max, min); } } 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 main 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 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, T[] source) { base.Write(format, source.OfType<object>().ToArray()); } public void WriteLine<T>(string format, 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 string ScanLine() { var sb = new StringBuilder(); for (var b = Char(); b != '\n'; b = (char)read()) if (b == 0) break; else if (b != '\r') 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); } } } #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 #region Trinity<ST,FT,TT> static public class Trinity { static public Trinity<FT, ST, TT> Create<FT, ST, TT>(FT f, ST s, TT t) where FT : IComparable<FT> where ST : IComparable<ST> where TT : IComparable<TT> { return new Trinity<FT, ST, TT>(f, s, t); } } public struct Trinity<FT, ST, TT> : IComparable<Trinity<FT, ST, TT>> where FT : IComparable<FT> where ST : IComparable<ST> where TT : IComparable<TT> { public FT I; public ST J; public TT K; public Trinity(FT i, ST j, TT k) : this() { I = i; J = j; K = k; } public int CompareTo(Trinity<FT, ST, TT> other) { var cmp = I.CompareTo(other.I); if (cmp != 0) return cmp; cmp = J.CompareTo(other.J); if (cmp != 0) return cmp; return K.CompareTo(other.K); } public override string ToString() { return string.Format("{0} {1} {2}", I, J, K); } } #endregion