結果

問題 No.457 (^^*)
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2016-12-08 01:06:59
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 246 ms / 2,000 ms
コード長 7,306 bytes
コンパイル時間 2,620 ms
コンパイル使用メモリ 113,664 KB
実行使用メモリ 19,200 KB
最終ジャッジ日時 2024-05-06 02:06:16
合計ジャッジ時間 3,540 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 28 ms
18,816 KB
testcase_01 AC 29 ms
18,816 KB
testcase_02 AC 28 ms
19,072 KB
testcase_03 AC 29 ms
18,816 KB
testcase_04 AC 26 ms
18,816 KB
testcase_05 AC 30 ms
18,944 KB
testcase_06 AC 30 ms
18,816 KB
testcase_07 AC 30 ms
18,944 KB
testcase_08 AC 31 ms
19,072 KB
testcase_09 AC 32 ms
19,200 KB
testcase_10 AC 59 ms
18,688 KB
testcase_11 AC 154 ms
18,764 KB
testcase_12 AC 246 ms
18,688 KB
testcase_13 AC 173 ms
18,512 KB
testcase_14 AC 180 ms
19,148 KB
testcase_15 AC 244 ms
18,640 KB
testcase_16 AC 177 ms
19,016 KB
testcase_17 AC 173 ms
18,888 KB
testcase_18 AC 28 ms
18,816 KB
testcase_19 AC 29 ms
18,688 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.Linq.Expressions;
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;
using V = System.Int32;
namespace Program
{
    public class Solver
    {
        int otaku(string s)
        {
            var ans = 0;
            for (int i = 0; i < s.Length; i++)
            {
                if (s[i] != '(') continue;
                var ptr = 0;
                for (int j = i + 1; j < s.Length; j++)
                {
                    if (ptr == 0 && s[j] == '*') ptr++;
                    else if (ptr == 1 && s[j] == '^') ptr++;
                    else if (ptr == 2 && s[j] == '^') ptr++;
                    else if (ptr == 3 && s[j] == ')') ans++;
                }
            }

            return ans;
        }
        public void Solve()
        {
            var s = sc.Scan();
            var nyan = otaku(s);
            var unko = otaku(s.Select(x => x == '(' ? ')' : x == ')' ? '(' : x).Reverse().AsString());
            IO.Printer.Out.WriteLine("{0} {1}", unko, nyan);
            return;
            var n = sc.Integer();
            n = 1000000;
            var rand = new Random();
            const double E = Math.E;
            var Q = Enumerate(11, x => Enumerate(11, y => new List<KeyValuePair<int, double>>()));
            for (int i = 0; i < n; i++)
            {
                /*
                var a = sc.Integer();
                var b = sc.Integer();
                var t = sc.Double();
                //**/

                var a = rand.Next(0, 11);
                var b = rand.Next(0, 11);
                if (a == 0 && b == 0) a = 1;
                var t = rand.NextDouble() * 10;
                //*/
                Q[a][b].Add(new KeyValuePair<C, double>(i, t));
            }
            var ans = new double[n];
            for (int a = 0; a < 11; a++)
                for (int b = 0; b < 11; b++)
                {
                    if (Q[a][b].Count == 0) continue;
                    Q[a][b].Sort((ll, rr) => ll.Value.CompareTo(rr.Value));
                    //*/
                    var l = 0.0; var max = 1024.0;
                    if (a == 0) max = Math.Pow(Math.Pow(E, 10), 1.0 / b);
                    else max = Math.Pow(10, 1.0 / a);
                    foreach (var x in Q[a][b])
                    {
                        var t = x.Value;
                        if (b != 0)
                            t = Math.Pow(E, t);
                        var r = max;
                        for (int _ = 0; _ < 35 && r > l + 1e-9; _++)
                        {
                            var m = (l + r) / 2;
                            double u;
                            if (b != 0)
                                u = Math.Pow(Math.Pow(m, Math.Pow(m, a)), b);
                            else u = Math.Pow(m, a);
                            if (u <= t) l = m;
                            else r = m;
                        }
                        ans[x.Key] = l;
                    }
                }
            foreach (var x in ans)
                IO.Printer.Out.WriteLine(x);


        }
        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
0