#225141 (C#(csc)) No.619 CardShuffle

提出ソース

結果

問題	No.619 CardShuffle
コンテスト
ユーザー	くれちー
提出日時	2017-12-20 04:40:08
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	231 ms / 3,000 ms
コード長	14,602 bytes
コンパイル時間	1,358 ms
コンパイル使用メモリ	125,104 KB
実行使用メモリ	26,624 KB
最終ジャッジ日時	2024-12-22 22:43:06
合計ジャッジ時間	7,655 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

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

ファイルパターン	結果
sample	AC * 1
other	AC * 35

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

コンパイルメッセージ

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;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;
using System.Text;
using static System.Math;
using static Extensions;
using static MathExtensions;

public static class Program
{
    public struct Expr
    {
        public long A, B, C;
        public bool HasOnlyA;

        public Expr(long a)
        {
            A = a; B = default(long); C = default(long);
            HasOnlyA = true;
        }

        public Expr(long a, long b, long c)
        {
            A = a; B = b; C = c;
            HasOnlyA = false;
        }

        public static Expr Concat(Expr l, Expr r) => l.HasOnlyA
            ? r.HasOnlyA
                ? new Expr(l.A * r.A % Mod)
                : new Expr(l.A * r.A % Mod, r.B, r.C)
            : r.HasOnlyA
                ? new Expr(l.A, l.B, l.C * r.A % Mod)
                : new Expr(l.A, (l.B + l.C * r.A + r.B) % Mod, r.C);
    }

    public struct ExprMonoid : IMonoid<Expr>
    {
        public Expr Unit => new Expr(1);
        public Expr Append(Expr l, Expr r) => Expr.Concat(l, r);
    }

    public static void Solve()
    {
        var n = I;
        var c = Repeat(n, () => C).ToArray();

        Expr Create(int i) => i == 0 || c[i - 1] == '+'
            ? new Expr(1, 0, c[i] - '0')
            : new Expr(c[i] - '0');

        var segtree = new SegmentTree<Expr, ExprMonoid>(
            Indexer.Create(i => Create(i << 1), (n + 1) >> 1));
        var q = I;

        Repeat(q, () =>
        {
            var (t, x, y) = (C, I - 1, I - 1);
            if (t == '!')
            {
                Swap(ref c[x], ref c[y]);
                segtree[(x + 1) >> 1] = Create(x + (x & 1));
                segtree[(y + 1) >> 1] = Create(y + (y & 1));
            }
            else
            {
                var e = segtree[(x + 2) >> 1, (y + 1) >> 1];
                Console.WriteLine(((c[x] - '0') * e.A + e.B + e.C) % Mod);
            }
        });
    }

    #region Scanners
    static Scanner _scanner;
    static char C => _scanner.NextChar();
    static string S => _scanner.NextString();
    static int I => _scanner.NextInt();
    static long L => _scanner.NextLong();
    static BigInteger B => _scanner.NextBigInteger();
    static double D => _scanner.NextDouble();
    static decimal M => _scanner.NextDecimal();
    #endregion

    public static void Main()
    {
        var sw = new StreamWriter(Console.OpenStandardOutput());
        sw.NewLine = "\n";
#if DEBUG
        sw.AutoFlush = true;
#else
        sw.AutoFlush = false;
#endif
        Console.SetOut(sw);
        _scanner = new Scanner(Console.OpenStandardInput());
        Solve();
        Console.Out.Flush();
    }
}

public static partial class Extensions
{
    public const int Mod = 1000000007;
}

#region Library
public class Scanner
{
    private readonly Stream _stream;
    private const int _bufferSize = 1024;
    private readonly byte[] _buf = new byte[_bufferSize];
    private int _len, _ptr;

    public Scanner(Stream stream)
    {
        _stream = stream;
    }

    public byte ReadByte()
    {
        if (_ptr >= _len)
        {
            _len = _stream.Read(_buf, 0, _bufferSize);
            _ptr = 0;
        }
        return _buf[_ptr++];
    }

    public char ReadChar() => (char)ReadByte();

    public string ReadLine()
    {
        var r = new StringBuilder();
        if (_ptr == 0) r.Append(ReadChar());
        for (; _ptr < _len; _ptr++) r.Append((char)_buf[_ptr]);
        return r.ToString();
    }

    public char NextChar() => char.Parse(NextString());

    public string NextString()
    {
        var r = new StringBuilder();
        var b = ReadChar();
        while (b != ' ' && b != '\n')
        {
            r.Append(b);
            b = ReadChar();
        }
        return r.ToString();
    }

    public int NextInt() => (int)NextLong();

    public long NextLong()
    {
        var r = 0L;
        var b = ReadByte();
        var n = b == '-';
        if (n) b = ReadByte();
        while (b != ' ' && b != '\n')
        {
            r = r * 10 + b - '0';
            b = ReadByte();
        }
        return n ? -r : r;
    }

    public BigInteger NextBigInteger()
    {
        var r = new BigInteger();
        var b = ReadByte();
        var n = b == '-';
        if (n) b = ReadByte();
        while (b != ' ' && b != '\n')
        {
            r = r * 10 + b - '0';
            b = ReadByte();
        }
        return n ? -r : r;
    }

    public double NextDouble()
    {
        var i = 0L;
        var b = ReadByte();
        var n = b == '-';
        if (n) b = ReadByte();
        while (b != '.' && b != ' ' && b != '\n')
        {
            i = i * 10 + b - '0';
            b = ReadByte();
        }
        if (b != '.') return n ? -i : i;
        b = ReadByte();
        var f = 0L;
        var p = 0;
        while (b != ' ' && b != '\n')
        {
            f = f * 10 + b - '0';
            b = ReadByte();
            p++;
        }
        var r = i + (double)f / MathExtensions.Pow(10, p);
        return n ? -r : r;
    }

    public decimal NextDecimal() => decimal.Parse(NextString());

    public T Next<T>(Converter<string, T> parser) => parser(NextString());
}

public class Indexer<T> : IReadOnlyList<T>
{
    private Func<int, T> _func;

    public Indexer(Func<int, T> func, int count)
    {
        _func = func;
        this.Count = count;
    }

    public int Count { get; }

    public T this[int i] => _func(i);

    public IEnumerator<T> GetEnumerator()
    {
        for (var i = 0; i < this.Count; i++) yield return this[i];
    }

    IEnumerator IEnumerable.GetEnumerator() => this.GetEnumerator();
}

public static class Indexer
{
    public static Indexer<T> Create<T>(Func<int, T> func, int count)
        => new Indexer<T>(func, count);
}

public interface IMonoid<T>
{
    T Unit { get; }
    T Append(T left, T right);
}

public class SegmentTree<T, TMonoid> : IReadOnlyList<T> where TMonoid : struct, IMonoid<T>
{
    private readonly TMonoid _monoid;
    private readonly T[] _tree;
    private readonly int _size;

    public SegmentTree(int length)
    {
        _monoid = default(TMonoid);
        if (length > (int.MaxValue >> 1) + 1) throw new ArgumentException();
        _size = 1;
        while (_size < length) _size <<= 1;
        _tree = Enumerable.Repeat(_monoid.Unit, _size << 1).ToArray();
        this.Length = length;
    }

    public SegmentTree(IReadOnlyList<T> collection)
    {
        _monoid = default(TMonoid);
        if (collection.Count > (int.MaxValue >> 1) + 1) throw new ArgumentException();
        _size = 1;
        while (_size < collection.Count) _size <<= 1;
        _tree = new T[_size << 1];
        for (var i = 0; i < _size; i++)
            _tree[i + _size] = i < collection.Count ? collection[i] : _monoid.Unit;
        for (var i = _size - 1; i > 0; i--)
            _tree[i] = _monoid.Append(_tree[i << 1], _tree[(i << 1) + 1]);
        this.Length = collection.Count;
    }

    public int Length { get; }

    int IReadOnlyCollection<T>.Count => this.Length;

    public T this[int i]
    {
        get => _tree[i + _size];
        set
        {
            _tree[i += _size] = value;
            for (i >>= 1; i > 0; i >>= 1)
                _tree[i] = _monoid.Append(_tree[i << 1], _tree[(i << 1) + 1]);
        }
    }

    public T this[int l, int r]
    {
        get
        {
            var lacc = _monoid.Unit;
            var racc = _monoid.Unit;
            for (l += _size, r += _size + 1; l < r; l >>= 1, r >>= 1)
            {
                if ((l & 1) != 0) lacc = _monoid.Append(lacc, _tree[l++]);
                if ((r & 1) != 0) racc = _monoid.Append(_tree[--r], racc);
            }
            return _monoid.Append(lacc, racc);
        }
    }

    public IEnumerator<T> GetEnumerator()
    {
        for (var i = 0; i < this.Length; i++) yield return this[i];
    }

    IEnumerator IEnumerable.GetEnumerator() => this.GetEnumerator();
}

[DebuggerStepThrough]
public static partial class Extensions
{
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void Assert(bool condition)
    {
        if (!condition) throw new Exception("Assertion failed");
    }

    public static string AsString(this IEnumerable<char> source) => new string(source.ToArray());

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void ForEach<T>(this IEnumerable<T> source, Action<T> action)
    {
        foreach (var item in source) action(item);
    }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, _> func)
    {
        foreach (var item in source) func(item);
    }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void ForEach<T>(this IEnumerable<T> source, Action<T, int> action)
    {
        var i = 0;
        foreach (var item in source) action(item, i++);
    }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, int, _> func)
    {
        var i = 0;
        foreach (var item in source) func(item, i++);
    }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T Iterate<T>(int count, T seed, Func<T, T> func)
    {
        var r = seed;
        for (var i = 0; i < count; i++) r = func(r);
        return r;
    }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void Repeat(int count, Action action)
    {
        for (var i = 0; i < count; i++) action();
    }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void Repeat(int count, Action<int> action)
    {
        for (var i = 0; i < count; i++) action(i);
    }

    public static IEnumerable<T> Repeat<T>(Func<T> func)
    {
        for (var i = 0; ; i++) yield return func();
    }

    public static IEnumerable<T> Repeat<T>(int count, Func<T> func)
    {
        for (var i = 0; i < count; i++) yield return func();
    }

    public static IEnumerable<T> Repeat<T>(Func<int, T> func)
    {
        for (var i = 0; ; i++) yield return func(i);
    }

    public static IEnumerable<T> Repeat<T>(int count, Func<int, T> func)
    {
        for (var i = 0; i < count; i++) yield return func(i);
    }

    public static void Swap<T>(ref T x, ref T y)
    {
        var tmp = x; x = y; y = tmp;
    }

    public static (T1[], T2[]) Unzip<T1, T2>(this ICollection<(T1, T2)> source)
    {
        var ts1 = new T1[source.Count];
        var ts2 = new T2[source.Count];
        var i = 0;
        foreach (var (t1, t2) in source) { ts1[i] = t1; ts2[i] = t2; i++; }
        return (ts1, ts2);
    }

    public static (T1[], T2[], T3[]) Unzip<T1, T2, T3>(this ICollection<(T1, T2, T3)> source)
    {
        var ts1 = new T1[source.Count];
        var ts2 = new T2[source.Count];
        var ts3 = new T3[source.Count];
        var i = 0;
        foreach (var (t1, t2, t3) in source) { ts1[i] = t1; ts2[i] = t2; ts3[i] = t3; i++; }
        return (ts1, ts2, ts3);
    }

    public static (T1[], T2[], T3[], T4[]) Unzip<T1, T2, T3, T4>(this ICollection<(T1, T2, T3, T4)> source)
    {
        var ts1 = new T1[source.Count];
        var ts2 = new T2[source.Count];
        var ts3 = new T3[source.Count];
        var ts4 = new T4[source.Count];
        var i = 0;
        foreach (var (t1, t2, t3, t4) in source) { ts1[i] = t1; ts2[i] = t2; ts3[i] = t3; ts4[i] = t4; i++; }
        return (ts1, ts2, ts3, ts4);
    }

    public static IEnumerable<T> Zip<T1, T2, T3, T>(this IEnumerable<T1> first, IEnumerable<T2> second, IEnumerable<T3> thrid, Func<T1, T2, T3, T> resultSelector)
    {
        using (var e1 = first.GetEnumerator())
        using (var e2 = second.GetEnumerator())
        using (var e3 = thrid.GetEnumerator())
        {
            while (e1.MoveNext() && e2.MoveNext() && e3.MoveNext())
                yield return resultSelector(e1.Current, e2.Current, e3.Current);
        }
    }

    public static IEnumerable<T> Zip<T1, T2, T3, T4, T>(this IEnumerable<T1> first, IEnumerable<T2> second, IEnumerable<T3> thrid, IEnumerable<T4> fourth, Func<T1, T2, T3, T4, T> resultSelector)
    {
        using (var e1 = first.GetEnumerator())
        using (var e2 = second.GetEnumerator())
        using (var e3 = thrid.GetEnumerator())
        using (var e4 = fourth.GetEnumerator())
        {
            while (e1.MoveNext() && e2.MoveNext() && e3.MoveNext() && e4.MoveNext())
                yield return resultSelector(e1.Current, e2.Current, e3.Current, e4.Current);
        }
    }
}

[DebuggerStepThrough]
public static class MathExtensions
{
    public static int Gcd(int left, int right)
    {
        int r;
        while ((r = left % right) != 0) { left = right; right = r; }
        return right;
    }

    public static long Gcd(long left, long right)
    {
        long r;
        while ((r = left % right) != 0L) { left = right; right = r; }
        return right;
    }

    public static BigInteger Gcd(BigInteger left, BigInteger right)
        => BigInteger.GreatestCommonDivisor(left, right);

    public static int HighestOneBit(int x)
    {
        x |= x >> 01;
        x |= x >> 02;
        x |= x >> 04;
        x |= x >> 08;
        x |= x >> 16;
        return x - (x >> 1);
    }

    public static long HighestOneBit(long x)
    {
        x |= x >> 01;
        x |= x >> 02;
        x |= x >> 04;
        x |= x >> 08;
        x |= x >> 16;
        x |= x >> 32;
        return x - (x >> 1);
    }

    public static int Lcm(int left, int right) => left / Gcd(left, right) * right;

    public static long Lcm(long left, long right) => left / Gcd(left, right) * right;

    public static BigInteger Lcm(BigInteger left, BigInteger right)
        => left / Gcd(left, right) * right;

    public static int Pow(int value, int exponent)
    {
        var r = 1;
        while (exponent > 0)
        {
            if ((exponent & 1) == 1) r *= value;
            value *= value;
            exponent >>= 1;
        }
        return r;
    }

    public static long Pow(long value, int exponent)
    {
        var r = 1L;
        while (exponent > 0)
        {
            if ((exponent & 1) == 1) r *= value;
            value *= value;
            exponent >>= 1;
        }
        return r;
    }

    public static long Fact(int value)
    {
        var r = 1L;
        for (var i = 2; i <= value; i++) r *= i;
        return r;
    }
}
#endregion

yukicoder

結果

コンパイルメッセージ

ソースコード