#346348 (C#(csc)) No.403 2^2^2

提出ソース

結果

問題	No.403 2^2^2
ユーザー	EmKjp
提出日時	2019-05-12 12:21:26
言語	C#(csc) (csc 3.9.0)
結果	WA
実行時間	-
コード長	6,227 bytes
コンパイル時間	1,068 ms
コンパイル使用メモリ	115,620 KB
実行使用メモリ	26,704 KB
最終ジャッジ日時	2024-07-02 01:29:26
合計ジャッジ時間	2,977 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	31 ms 18,176 KB
testcase_01	AC	30 ms 18,304 KB
testcase_02	AC	31 ms 18,432 KB
testcase_03	AC	31 ms 18,304 KB
testcase_04	AC	31 ms 18,432 KB
testcase_05	AC	30 ms 18,432 KB
testcase_06	AC	32 ms 18,432 KB
testcase_07	AC	32 ms 18,048 KB
testcase_08	AC	31 ms 18,432 KB
testcase_09	WA	-
testcase_10	AC	30 ms 18,560 KB
testcase_11	AC	30 ms 18,304 KB
testcase_12	AC	31 ms 18,432 KB
testcase_13	AC	33 ms 18,560 KB
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	AC	32 ms 18,304 KB
testcase_19	AC	31 ms 18,432 KB
testcase_20	AC	32 ms 18,304 KB
testcase_21	AC	32 ms 18,432 KB
testcase_22	AC	33 ms 18,176 KB
testcase_23	AC	32 ms 18,560 KB
testcase_24	AC	31 ms 18,176 KB
testcase_25	WA	-
testcase_26	AC	31 ms 18,304 KB
testcase_27	AC	30 ms 18,432 KB
testcase_28	AC	32 ms 18,432 KB
testcase_29	WA	-

権限があれば一括ダウンロードができます

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

raw source code

using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Numerics;

partial class Solver
{
    long Mod = 1000000000 + 7;
    BigInteger Solve(long a, long b, long c)
    {
        var right = BigInteger.ModPow(b, c, Mod - 1);
        if (right == 1) right = Mod - 1;
        return BigInteger.ModPow(a, right, Mod);
    }

    public void Run()
    {
        var S = ns();
        var arr = S.Split('^');
        var A = long.Parse(arr[0]);
        var B = long.Parse(arr[1]);
        var C = long.Parse(arr[2]);
        var ans1 = BigInteger.ModPow(BigInteger.ModPow(A, B, Mod), C, Mod);

        var ans2 = Solve(A, B, C);
        cout.WriteLine("{0} {1}", ans1, ans2);
    }

}

public struct NodeValue
{
    public long Left { get; set; }
    public long Middle { get; set; }
    public long Right { get; set; }
    public long Sum { get; set; }
    public long MaxValue => new[] { Left, Middle, Right }.Max();

    public NodeValue(long x)
    {
        Left = Middle = Right = Sum = x; ;
    }

    public static NodeValue Merge(NodeValue x, NodeValue y)
    {
        return new NodeValue
        {
            Sum = x.Sum + y.Sum,
            Left = Math.Max(x.Left, x.Sum + y.Left),
            Middle = Math.Max(Math.Max(x.Middle, y.Middle), x.Right + y.Left),
            Right = Math.Max(y.Right, y.Sum + x.Right),
        };
    }
}


public abstract class SegmentTree<TNodeValue> where TNodeValue : struct
{
    protected int N { get; private set; }
    protected TNodeValue?[] node;
    protected static int Left(int p) { return p * 2 + 1; }
    protected static int Right(int p) { return p * 2 + 2; }

    public SegmentTree() { }

    public void Build(IList<TNodeValue> array)
    {
        Build(array.Count, i => array[i]);
    }

    virtual public void Build(int _n, Func<int, TNodeValue> create)
    {
        N = 1;
        while (N < _n) N *= 2;
        node = new TNodeValue?[2 * N];

        for (int i = 0; i < _n; i++) node[i + N - 1] = create(i);
        for (int i = N - 2; i >= 0; i--) node[i] = Merge(node[Left(i)], node[Right(i)]);
    }

    protected TNodeValue? Merge(TNodeValue? left, TNodeValue? right)
    {
        if (left != null && right != null) return Merge(left.Value, right.Value);
        if (left == null) return right;
        if (right == null) return left;
        return null;
    }

    protected abstract TNodeValue Merge(TNodeValue left, TNodeValue right);

    public void Update(int index, TNodeValue val)
    {
        int p = index + N - 1;
        node[p] = val;
        while (p > 0)
        {
            p = (p - 1) / 2;
            node[p] = Merge(node[Left(p)], node[Right(p)]);
        }
    }

    protected virtual TNodeValue? Query(int begin, int end, int k, int l, int r)
    {
        if (r <= begin || end <= l) return null;
        if (begin <= l && r <= end) return node[k];
        int mid = (l + r) / 2;
        return Merge(
            Query(begin, end, Left(k), l, mid),
            Query(begin, end, Right(k), mid, r)
        );
    }

    public TNodeValue Query(int begin, int end)
    {
        return Query(begin, end, 0, 0, N).Value;
    }
};

public class AnonymousSegmentTree<TNodeValue> : SegmentTree<TNodeValue> where TNodeValue : struct
{
    readonly Func<TNodeValue, TNodeValue, TNodeValue> _mergeMethod;

    public AnonymousSegmentTree(Func<TNodeValue, TNodeValue, TNodeValue> merge)
    {
        _mergeMethod = merge;
    }

    protected override TNodeValue Merge(TNodeValue left, TNodeValue right)
    {
        return _mergeMethod(left, right);
    }
}
// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner
{
    public static void Main(string[] args)
    {
        new Solver(Console.In, Console.Out).Run();
    }

    TextReader cin;
    TextWriter cout;

    public Solver(TextReader reader, TextWriter writer)
        : base(reader)
    {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer)
    {
    }

    public int ni() { return NextInt(); }
    public int[] ni(int n) { return NextIntArray(n); }
    public long nl() { return NextLong(); }
    public long[] nl(int n) { return NextLongArray(n); }
    public double nd() { return NextDouble(); }
    public string ns() { return Next(); }
    public string[] ns(int n) { return NextArray(n); }
}

public class Scanner
{
    private TextReader Reader;
    private Queue<String> TokenQueue = new Queue<string>();
    private CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In)
    {
    }

    public Scanner(TextReader reader)
    {
        this.Reader = reader;
    }

    public int NextInt() { return Int32.Parse(Next(), ci); }
    public long NextLong() { return Int64.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size)
    {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size)
    {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size)
    {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public String Next()
    {
        if (TokenQueue.Count == 0)
        {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext()
    {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }

    private bool StockTokens()
    {
        while (true)
        {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード