結果
問題 | No.73 helloworld |
ユーザー |
![]() |
提出日時 | 2015-01-31 01:09:43 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 29 ms / 5,000 ms |
コード長 | 2,726 bytes |
コンパイル時間 | 2,150 ms |
コンパイル使用メモリ | 109,952 KB |
実行使用メモリ | 19,328 KB |
最終ジャッジ日時 | 2024-06-28 22:13:44 |
合計ジャッジ時間 | 3,158 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 14 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;using System.IO;using System.Text;using System.Linq;using System.Diagnostics;using System.Collections.Generic;using Enu = System.Linq.Enumerable;class Program{static readonly string helloworld = "helloworld";void Solve(){var count = reader.IntArray(26);var need = new int[26];helloworld.ToList().ForEach(c => need[c - 'a']++);if (helloworld.Any(c => count[c - 'a'] < need[c - 'a'])){Console.WriteLine(0);return;}long ans = 1;int countL = count['l' - 'a'];int countO = count['o' - 'a'];for (int LL = 2; LL < countL; LL++)for (int OL = 1; OL < countO; OL++){int LR = countL - LL;int OR = countO - OL;long curr = LL * (LL - 1) / 2 * LR * OR * OL;ans = Math.Max(ans, curr);}helloworld.Where(c => need[c - 'a'] == 1).ToList().ForEach(c => ans *= count[c - 'a']);Console.WriteLine(ans);}static void Main() { new Program().Solve(); }Reader reader = new Reader(Console.In);class Reader{private readonly TextReader reader;private readonly char[] separator = { ' ' };private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries;private string[] A = new string[0];private int i;public Reader(TextReader r) { reader = r; }public bool HasNext() { return Enqueue(); }public string String() { return Dequeue(); }public int Int() { return int.Parse(Dequeue()); }public long Long() { return long.Parse(Dequeue()); }public double Double() { return double.Parse(Dequeue()); }public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); }public int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); }public int[][] IntGrid(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }public string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); }public string Line() { return reader.ReadLine().Trim(); }private string[] Split(string s) { return s.Split(separator, removeOp); }private bool Enqueue(){if (i < A.Length) return true;string line = reader.ReadLine();if (line == null) return false;if (line == "") return Enqueue();A = Split(line);i = 0;return true;}private string Dequeue() { Enqueue(); return A[i++]; }}}