結果

問題 No.233 めぐるはめぐる (3)
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-06-27 00:03:50
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 178 ms / 1,000 ms
コード長 7,884 bytes
コンパイル時間 2,869 ms
コンパイル使用メモリ 113,340 KB
実行使用メモリ 42,004 KB
最終ジャッジ日時 2023-09-22 02:38:52
合計ジャッジ時間 6,518 ms
ジャッジサーバーID
(参考情報)
judge13 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 119 ms
35,432 KB
testcase_01 AC 102 ms
34,760 KB
testcase_02 AC 79 ms
26,332 KB
testcase_03 AC 105 ms
34,964 KB
testcase_04 AC 178 ms
38,016 KB
testcase_05 AC 142 ms
40,064 KB
testcase_06 AC 135 ms
42,004 KB
testcase_07 AC 173 ms
38,000 KB
testcase_08 AC 176 ms
38,132 KB
testcase_09 AC 62 ms
22,600 KB
testcase_10 AC 62 ms
22,580 KB
testcase_11 AC 63 ms
22,584 KB
testcase_12 AC 102 ms
36,860 KB
testcase_13 AC 118 ms
35,532 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #

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;

namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var n = int.Parse(Console.ReadLine());
            const string sss = "inabameguru";
            const string otaku = "aiueo";


            var a = "iaaeuu".ToCharArray();
            var b = "nbmgr".ToCharArray();
            Array.Sort(a); Array.Sort(b);
            var P = new HashMap<string, int>();
            var Rev = new string[1000];
            do
            {
                var t = new string(a);
                if (P.ContainsKey(t))
                    continue;
                else P[t] = P.Count;
            } while (MathEx.NextPermutation(a, 0, a.Length));
            var cnt = P.Count;
            do
            {
                var t = new string(b);
                if (P.ContainsKey(t))
                    continue;
                else P[t] = P.Count;
            } while (MathEx.NextPermutation(b, 0, b.Length));
            foreach (var kv in P)
                Rev[kv.Value] = kv.Key;
            var S = new HashSet<string>();
            for (int _ = 0; _ < n; _++)
            {
                S.Add(Console.ReadLine());
            }
            for (int i = 0; i < cnt; i++)
                for (int j = cnt; j < P.Count; j++)
                    for (int k = 0; k < sss.Length; k += 2)
                    {

                        var p = Rev[i];
                        var q = Rev[j];
                        var r = k / 2;
                        var u = 0;
                        var v = 0;
                        var ans = new StringBuilder();
                        if (r == 0)
                        {
                            ans.Append(p[u++]);
                        }
                        while (ans.Length < sss.Length)
                        {
                            ans.Append(q[v++]);
                            ans.Append(p[u++]);
                            if (u == r)
                                ans.Append(p[u++]);
                        }
                        if (S.Contains(ans.ToString()))
                            continue;
                        IO.Printer.Out.WriteLine(ans.ToString());
                        return;
                    }


            IO.Printer.Out.WriteLine("NO");
        }
        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 next_permutation
static public partial class MathEx
{

    static public bool NextPermutation<T>(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

#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 Triplet<T>

public struct Triplet<T>
{
    public T I, J, K;
    public Triplet(T i, T j, T k) : this() { I = i; J = j; K = k; }
    public Triplet(params T[] arg) : this(arg[0], arg[1], arg[2]) { }
    public override string ToString() { return string.Format("{0} {1} {2}", I, J, K); }
}
#endregion
0