結果
問題 | No.437 cwwゲーム |
ユーザー | 紙ぺーぱー |
提出日時 | 2016-12-22 22:16:41 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 6,060 bytes |
コンパイル時間 | 1,128 ms |
コンパイル使用メモリ | 118,052 KB |
実行使用メモリ | 47,908 KB |
最終ジャッジ日時 | 2024-12-14 14:57:19 |
合計ジャッジ時間 | 39,784 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 24 ms
30,596 KB |
testcase_01 | AC | 24 ms
32,628 KB |
testcase_02 | AC | 146 ms
32,496 KB |
testcase_03 | AC | 24 ms
30,672 KB |
testcase_04 | AC | 25 ms
30,596 KB |
testcase_05 | TLE | - |
testcase_06 | TLE | - |
testcase_07 | TLE | - |
testcase_08 | TLE | - |
testcase_09 | TLE | - |
testcase_10 | TLE | - |
testcase_11 | TLE | - |
testcase_12 | TLE | - |
testcase_13 | AC | 1,331 ms
47,908 KB |
testcase_14 | AC | 145 ms
30,468 KB |
testcase_15 | TLE | - |
testcase_16 | TLE | - |
testcase_17 | AC | 143 ms
25,692 KB |
testcase_18 | AC | 144 ms
23,780 KB |
testcase_19 | AC | 24 ms
23,520 KB |
testcase_20 | AC | 25 ms
25,688 KB |
testcase_21 | AC | 25 ms
23,684 KB |
testcase_22 | AC | 24 ms
23,392 KB |
testcase_23 | AC | 1,322 ms
25,680 KB |
testcase_24 | AC | 25 ms
23,516 KB |
testcase_25 | AC | 1,328 ms
23,400 KB |
testcase_26 | AC | 1,334 ms
23,520 KB |
testcase_27 | AC | 24 ms
23,528 KB |
testcase_28 | AC | 24 ms
23,524 KB |
testcase_29 | AC | 24 ms
23,780 KB |
testcase_30 | AC | 24 ms
23,644 KB |
testcase_31 | AC | 24 ms
23,652 KB |
testcase_32 | AC | 25 ms
24,032 KB |
testcase_33 | AC | 144 ms
25,680 KB |
testcase_34 | AC | 24 ms
23,648 KB |
testcase_35 | AC | 144 ms
23,784 KB |
testcase_36 | AC | 24 ms
23,644 KB |
testcase_37 | AC | 24 ms
23,780 KB |
testcase_38 | AC | 25 ms
25,688 KB |
testcase_39 | AC | 26 ms
23,632 KB |
testcase_40 | AC | 25 ms
21,556 KB |
testcase_41 | AC | 146 ms
23,760 KB |
testcase_42 | AC | 144 ms
23,508 KB |
testcase_43 | AC | 144 ms
45,712 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; using Point = System.Numerics.Complex; using Number = System.Int64; using C = System.Int32; namespace Program { public class Solver { public void Solve() { var s = sc.Scan(); var ans = 0; var p = Enumerate(s.Length, x => x); do { var v = 0; for (int i = 0; i + 2 < s.Length; i += 3) { if (p[i] < p[i + 1] && p[i + 1] < p[i + 2] && s[p[i]] != '0' && s[p[i]] != s[p[i + 1]] && s[p[i + 1]] == s[p[i + 2]]) v += (s[p[i]] - '0') * 100 + (s[p[i + 1]] - '0') * 10 + s[p[i + 2]] - '0'; else break; } if (ans < v) { Debug.WriteLine(p.AsJoinedString()); ans = Math.Max(ans, v); } } while (p.NextPermutation(0, s.Length)); 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 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 != 0 && b != '-' && (b < '0' || '9' < b)); if (b == 0) return long.MinValue; 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() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; } 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 next_permutation static public partial class MathEx { static public bool NextPermutation<T>(this T[] array, int first, int last) where T : IComparable<T> { if (first == last) return false; var i = last; if (--i == first) return false; while (true) { var ii = i--; if (array[i].CompareTo(array[ii]) < 0) { var j = last; while (array[i].CompareTo(array[--j]) >= 0) { } var temp = array[i]; array[i] = array[j]; array[j] = temp; Array.Reverse(array, ii, last - ii); return true; } if (i == first) { Array.Reverse(array, first, last - first); return false; } } } } #endregion