結果

問題 No.619 CardShuffle
ユーザー くれちーくれちー
提出日時 2017-12-11 22:20:35
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 427 ms / 3,000 ms
コード長 16,988 bytes
コンパイル時間 2,246 ms
コンパイル使用メモリ 126,208 KB
実行使用メモリ 43,780 KB
最終ジャッジ日時 2024-06-02 04:02:27
合計ジャッジ時間 10,531 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 30 ms
25,068 KB
testcase_01 AC 32 ms
24,948 KB
testcase_02 AC 32 ms
27,104 KB
testcase_03 AC 30 ms
27,044 KB
testcase_04 AC 31 ms
24,948 KB
testcase_05 AC 31 ms
27,040 KB
testcase_06 AC 31 ms
27,036 KB
testcase_07 AC 31 ms
24,752 KB
testcase_08 AC 31 ms
25,008 KB
testcase_09 AC 31 ms
24,860 KB
testcase_10 AC 31 ms
25,004 KB
testcase_11 AC 31 ms
24,864 KB
testcase_12 AC 33 ms
25,008 KB
testcase_13 AC 32 ms
27,424 KB
testcase_14 AC 31 ms
24,936 KB
testcase_15 AC 31 ms
22,708 KB
testcase_16 AC 372 ms
43,560 KB
testcase_17 AC 382 ms
41,516 KB
testcase_18 AC 368 ms
43,432 KB
testcase_19 AC 370 ms
43,780 KB
testcase_20 AC 342 ms
43,432 KB
testcase_21 AC 427 ms
41,500 KB
testcase_22 AC 422 ms
41,768 KB
testcase_23 AC 425 ms
43,428 KB
testcase_24 AC 418 ms
43,744 KB
testcase_25 AC 378 ms
41,376 KB
testcase_26 AC 295 ms
41,532 KB
testcase_27 AC 300 ms
43,560 KB
testcase_28 AC 302 ms
43,700 KB
testcase_29 AC 296 ms
41,636 KB
testcase_30 AC 278 ms
43,560 KB
testcase_31 AC 30 ms
25,132 KB
testcase_32 AC 337 ms
41,784 KB
testcase_33 AC 350 ms
41,260 KB
testcase_34 AC 307 ms
43,424 KB
testcase_35 AC 121 ms
31,164 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.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using static System.Math;
using static Extensions;
using static MathExtensions;

public struct Expr
{
    public static readonly Monoid<Expr> Monoid
        = new Monoid<Expr>(new Expr(1), Concat);

    public ModInt32 A { get; }
    public ModInt32 B { get; }
    public ModInt32 C { get; }
    public bool HasOnlyA { get; }

    public Expr(int a) : this(new ModInt32(a)) { }

    public Expr(int a, int b, int c)
        : this(new ModInt32(a), new ModInt32(b), new ModInt32(c)) { }

    public Expr(ModInt32 a)
    {
        this.HasOnlyA = true;
        this.A = a; this.B = new ModInt32(0); this.C = new ModInt32(0);
    }

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

    public int Evaluate(int l) => (l * this.A + this.B + this.C).Value;

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

    public override string ToString()
        => this.HasOnlyA ? $"{this.A}" : $"{this.A} {this.B} {this.C}";
}

public static class Program
{
    public static void Solve()
    {
        var n = I;
        Assert(3 <= n && n <= 100000 - 1);

        var c = Repeat(n, () => C).ToArray();
        Repeat(n, i => Assert(((i & 1) == 0 ? "0123456789" : "+*").Contains(c[i])));

        Expr Create(int i)
        {
            var r = c[i] - '0';
            return i == 0 || c[i - 1] == '+' ? new Expr(1, 0, r) : new Expr(r);
        }

        var segtree = new SegmentTree<Expr>(
            Repeat((n + 1) / 2, i => Create(i * 2)).ToArray(), Expr.Monoid);
        
        var q = I;
        Assert(1 <= q && q <= 100000);

        Repeat(q, i =>
        {
            var (t, x, y) = (C, I, I);
            if (i == q - 1) Assert(t == '?');
            else Assert("!?".Contains(t));
            Assert(1 <= x && x < y && y <= n);

            if (t == '!')
            {
                Assert(x % 2 == y % 2);
                Swap(ref c[--x], ref c[--y]);
                segtree[(x + 1) / 2] = Create(x + x % 2);
                segtree[(y + 1) / 2] = Create(y + x % 2);
            }
            else
            {
                Assert(x % 2 == 1 && y % 2 == 1);
                var fxy = segtree[(x + 1) / 2, y / 2].Evaluate(c[x - 1] - '0');
                Console.WriteLine(fxy);
            }
        });
    }

    #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
{
}

#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 Monoid<T>
{
    public Monoid(T unit, Func<T, T, T> append)
    {
        this.Unit = unit;
        this.Append = append;
    }

    public T Unit { get; }

    public Func<T, T, T> Append { get; }
}

public static class Monoid
{
    public static Monoid<T> Create<T>(T unit, Func<T, T, T> append) => new Monoid<T>(unit, append);

    public static readonly Monoid<int> Min_Int32 = new Monoid<int>(int.MaxValue, Min);
    public static readonly Monoid<int> Max_Int32 = new Monoid<int>(int.MinValue, Max);

    public static readonly Monoid<long> Min_Int64 = new Monoid<long>(long.MaxValue, Min);
    public static readonly Monoid<long> Max_Int64 = new Monoid<long>(long.MinValue, Max);
}

public class SegmentTree<T> : IReadOnlyList<T>
{
    private readonly T[] _tree;
    private readonly int _size;

    public SegmentTree(int length, Monoid<T> monoid)
    {
        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.Monoid = monoid;
        this.Length = length;
    }

    public SegmentTree(IList<T> collection, Monoid<T> monoid)
    {
        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.Monoid = monoid;
        this.Length = collection.Count;
    }

    public Monoid<T> Monoid { get; }

    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] = this.Monoid.Append(_tree[i << 1], _tree[(i << 1) + 1]);
        }
    }

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

public struct ModInt32 : IEquatable<ModInt32>
{
    private long _value;

    public ModInt32(long value, int mod = 1000000007)
    {
        _value = value % mod;
        this.Mod = mod;
    }

    public int Value => (int)_value;

    public int Mod { get; private set; }

    public static ModInt32 operator +(ModInt32 value) => value;

    public static ModInt32 operator -(ModInt32 value)
    {
        if (value._value == 0) return value;
        var r = new ModInt32 { _value = value.Mod - value._value, Mod = value.Mod };
        return r;
    }

    public static ModInt32 operator +(long left, ModInt32 right)
        => new ModInt32(left, right.Mod) + right;

    public static ModInt32 operator +(ModInt32 left, long right)
        => left + new ModInt32(right, left.Mod);

    public static ModInt32 operator +(ModInt32 left, ModInt32 right)
    {
        var r = new ModInt32 { _value = left._value + right._value, Mod = left.Mod };
        if (r._value > r.Mod) r._value -= r.Mod;
        return r;
    }

    public static ModInt32 operator -(long left, ModInt32 right)
        => new ModInt32(left, right.Mod) - right;

    public static ModInt32 operator -(ModInt32 left, long right)
        => left - new ModInt32(right, left.Mod);

    public static ModInt32 operator -(ModInt32 left, ModInt32 right)
    {
        var r = new ModInt32 { _value = left._value - right._value, Mod = left.Mod };
        if (r._value < 0) r._value += r.Mod;
        return left;
    }

    public static ModInt32 operator *(long left, ModInt32 right)
        => new ModInt32(left, right.Mod) * right;

    public static ModInt32 operator *(ModInt32 left, long right)
        => left * new ModInt32(right, left.Mod);

    public static ModInt32 operator *(ModInt32 left, ModInt32 right)
        => new ModInt32(left._value * right._value);

    public bool Equals(ModInt32 other)
        => _value == other._value && this.Mod == other.Mod;

    public override bool Equals(object obj)
        => obj is ModInt32 other ? this.Equals(other) : false;

    public override int GetHashCode() => _value.GetHashCode() ^ this.Mod;

    public override string ToString() => _value.ToString();
}

[DebuggerStepThrough]
public static partial class Extensions
{
    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());

    public static void ForEach<T>(this IEnumerable<T> source, Action<T> action)
    {
        foreach (var item in source) action(item);
    }

    public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, _> func)
    {
        foreach (var item in source) func(item);
    }

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

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

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

    public static void Repeat(int count, Action action)
    {
        for (var i = 0; i < count; i++) action();
    }

    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
0