結果

問題 No.142 単なる配列の操作に関する実装問題
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2017-02-06 22:18:41
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,585 ms / 5,000 ms
コード長 13,987 bytes
コンパイル時間 1,001 ms
コンパイル使用メモリ 112,768 KB
実行使用メモリ 29,824 KB
最終ジャッジ日時 2024-06-06 16:21:07
合計ジャッジ時間 8,168 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 301 ms
29,568 KB
testcase_01 AC 1,249 ms
29,568 KB
testcase_02 AC 1,585 ms
29,696 KB
testcase_03 AC 291 ms
29,824 KB
testcase_04 AC 1,374 ms
29,568 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.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Point = System.Numerics.Complex;
using Number = System.Int64;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var bitset = new BitSet(n);
            for (long s = sc.Integer(), x = sc.Long(), y = sc.Long(), z = sc.Long(), i = 0; i < n; i++, s = (x * s + y) % z)
                if ((s & 1) == 1) bitset[(int)i] = true;
            var q = sc.Integer();
            for (int _ = 0; _ < q; _++)
            {
                var s = sc.Integer() - 1;
                var t = sc.Integer();
                var u = sc.Integer() - 1;
                var v = sc.Integer();
                bitset.XorTo(bitset, s, u, t - s);
            }
            var ans = new char[n];
            for (int i = 0; i < n; i++)
                ans[i] = bitset[i] ? 'O' : 'E';
            IO.Printer.Out.WriteLine(ans.AsString());
        }
        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
#region BitArray
public struct BitSet
{
    const ulong ALL = ulong.MaxValue;
    const int SIZE = 2000000;
    const int size = SIZE / 64 + 50;
    static public readonly ulong[] mask = new ulong[65];
    static BitSet()
    {
        mask[0] = 0;
        for (int i = 0; i < 64; i++)
            mask[i + 1] = (mask[i] << 1) | 1ul;
    }
    ulong[] bits;
    int n;
    public BitSet(int N) : this()
    {
        n = N;
        bits = new ulong[size];
    }
    public int[] Items
    {
        get
        {
            var ret = new int[n];
            for (int i = 0; i < n; i++)
                if (this[i]) ret[i] = 1;
            return ret;
        }
    }
    public bool this[int index]
    {
        get { return (bits[index / 64] >> (index % 64) & 1) == 1; }
        set
        {
            if (value)
                bits[index / 64] |= 1ul << (index % 64);
            else bits[index / 64] &= ~(1ul << (index % 64));
        }
    }

    void align(ref int p, ref int q, ref int len)
    {
        var xr = Math.Min(SIZE, p + len);
        len = xr - p;

        if (q < 0)
        {
            p += Math.Abs(q);
            len -= Math.Abs(q);
            q = 0;
        }
        var yr = Math.Min(SIZE, q + len);
        len = yr - q;



    }

    /// <summary>
    /// a->b. a[p,p+len)->b[q,q+len)
    /// </summary>
    public void XorTo(BitSet b, int p, int q, int len)//xor b[l,l+len)^=a[r,r+len)
    {
        align(ref p, ref q, ref len);
        var lx = p / 64;
        var ly = p % 64;
        var rx = (p + len) / 64;
        var ry = (p + len) % 64;

        var d = p - q;
        var dx = d / 64;
        var dy = d % 64;
        if (dy < 0) { dy += 64; dx--; }

        if (p > q)
        {
            if (lx == rx)
            {
                if (dy > 0 && lx - dx - 1 >= 0) b.bits[lx - dx - 1] ^= (bits[lx] & (mask[ry] & (ALL ^ mask[ly]))) << (64 - dy);
                b.bits[lx - dx] ^= (bits[lx] & (mask[ry] & (ALL ^ mask[ly]))) >> dy;
            }
            else
            {
                if (dy > 0 && lx - dx - 1 >= 0) b.bits[lx - dx - 1] ^= (bits[lx] & (ALL ^ mask[ly])) << (64 - dy);
                b.bits[lx - dx] ^= (bits[lx] & (ALL ^ mask[ly])) >> dy;
                for (var i = lx + 1; i < rx; i++)
                {
                    if (dy > 0) b.bits[i - dx - 1] ^= bits[i] << (64 - dy);
                    b.bits[i - dx] ^= bits[i] >> dy;
                }
                if (dy > 0) b.bits[rx - dx - 1] ^= (bits[rx] & (mask[ry])) << (64 - dy);
                b.bits[rx - dx] ^= (bits[rx] & (mask[ry])) >> dy;
            }
        }
        else
        {
            if (lx == rx)
            {
                b.bits[lx - dx] ^= (bits[lx] & (mask[ry] & (ALL ^ mask[ly]))) >> dy;
                if (dy > 0) b.bits[lx - dx - 1] ^= (bits[lx] & (mask[ry] & (ALL ^ mask[ly]))) << (64 - dy);
            }
            else
            {
                b.bits[rx - dx] ^= (bits[rx] & (mask[ry])) >> dy;
                if (dy > 0) b.bits[rx - dx - 1] ^= (bits[rx] & (mask[ry])) << (64 - dy);
                for (var i = rx - 1; i > lx; i--)
                {
                    b.bits[i - dx] ^= bits[i] >> dy;
                    if (dy > 0) b.bits[i - dx - 1] ^= bits[i] << (64 - dy);
                }
                b.bits[lx - dx] ^= (bits[lx] & (ALL ^ mask[ly])) >> dy;
                if (dy > 0 && lx - dx - 1 >= 0) b.bits[lx - dx - 1] ^= (bits[lx] & (ALL ^ mask[ly])) << (64 - dy);
            }
        }
    }
    /// <summary>
    /// a->b. a[p,p+len)->b[q,q+len)
    /// </summary>
    public void AndTo(BitSet b, int p, int q, int len)//and b[l,l+len)&=a[r,r+len)
    {
        align(ref p, ref q, ref len);
        var lx = p / 64;
        var ly = p % 64;
        var rx = (p + len) / 64;
        var ry = (p + len) % 64;

        var d = p - q;
        var dx = d / 64;
        var dy = d % 64;
        if (dy < 0) { dy += 64; dx--; }

        if (p > q)
        {
            if (lx == rx)
            {
                if (dy > 0 && lx - dx - 1 >= 0) b.bits[lx - dx - 1] &= (bits[lx] & (mask[ry] & (ALL ^ mask[ly]))) << (64 - dy);
                b.bits[lx - dx] &= (bits[lx] & (mask[ry] & (ALL ^ mask[ly]))) >> dy;
            }
            else
            {
                if (dy > 0 && lx - dx - 1 >= 0) b.bits[lx - dx - 1] &= (bits[lx] & (ALL ^ mask[ly])) << (64 - dy);
                b.bits[lx - dx] &= (bits[lx] & (ALL ^ mask[ly])) >> dy;
                for (var i = lx + 1; i < rx; i++)
                {
                    if (dy > 0) b.bits[i - dx - 1] &= bits[i] << (64 - dy);
                    b.bits[i - dx] &= bits[i] >> dy;
                }
                if (dy > 0) b.bits[rx - dx - 1] &= (bits[rx] & (mask[ry])) << (64 - dy);
                b.bits[rx - dx] &= (bits[rx] & (mask[ry])) >> dy;
            }
        }
        else
        {
            if (lx == rx)
            {
                b.bits[lx - dx] &= (bits[lx] & (mask[ry] & (ALL ^ mask[ly]))) >> dy;
                if (dy > 0) b.bits[lx - dx - 1] &= (bits[lx] & (mask[ry] & (ALL ^ mask[ly]))) << (64 - dy);
            }
            else
            {
                b.bits[rx - dx] &= (bits[rx] & (mask[ry])) >> dy;
                if (dy > 0) b.bits[rx - dx - 1] &= (bits[rx] & (mask[ry])) << (64 - dy);
                for (var i = rx - 1; i > lx; i--)
                {
                    b.bits[i - dx] &= bits[i] >> dy;
                    if (dy > 0) b.bits[i - dx - 1] ^= bits[i] << (64 - dy);
                }
                b.bits[lx - dx] &= (bits[lx] & (ALL ^ mask[ly])) >> dy;
                if (dy > 0 && lx - dx - 1 >= 0) b.bits[lx - dx - 1] &= (bits[lx] & (ALL ^ mask[ly])) << (64 - dy);
            }
        }
    }
    /// <summary>
    /// a->b. a[p,p+len)->b[q,q+len)
    /// </summary>
    public void OrTo(BitSet b, int p, int q, int len)//and b[l,l+len)&=a[r,r+len)
    {
        align(ref p, ref q, ref len);
        var lx = p / 64;
        var ly = p % 64;
        var rx = (p + len) / 64;
        var ry = (p + len) % 64;

        var d = p - q;
        var dx = d / 64;
        var dy = d % 64;
        if (dy < 0) { dy += 64; dx--; }

        if (p > q)
        {
            if (lx == rx)
            {
                if (dy > 0 && lx - dx - 1 >= 0) b.bits[lx - dx - 1] |= (bits[lx] & (mask[ry] & (ALL ^ mask[ly]))) << (64 - dy);
                b.bits[lx - dx] |= (bits[lx] & (mask[ry] & (ALL ^ mask[ly]))) >> dy;
            }
            else
            {
                if (dy > 0 && lx - dx - 1 >= 0) b.bits[lx - dx - 1] |= (bits[lx] & (ALL ^ mask[ly])) << (64 - dy);
                b.bits[lx - dx] |= (bits[lx] & (ALL ^ mask[ly])) >> dy;
                for (var i = lx + 1; i < rx; i++)
                {
                    if (dy > 0) b.bits[i - dx - 1] |= bits[i] << (64 - dy);
                    b.bits[i - dx] |= bits[i] >> dy;
                }
                if (dy > 0) b.bits[rx - dx - 1] |= (bits[rx] & (mask[ry])) << (64 - dy);
                b.bits[rx - dx] |= (bits[rx] & (mask[ry])) >> dy;
            }
        }
        else
        {
            if (lx == rx)
            {
                b.bits[lx - dx] |= (bits[lx] & (mask[ry] & (ALL ^ mask[ly]))) >> dy;
                if (dy > 0) b.bits[lx - dx - 1] |= (bits[lx] & (mask[ry] & (ALL ^ mask[ly]))) << (64 - dy);
            }
            else
            {
                b.bits[rx - dx] |= (bits[rx] & (mask[ry])) >> dy;
                if (dy > 0) b.bits[rx - dx - 1] |= (bits[rx] & (mask[ry])) << (64 - dy);
                for (var i = rx - 1; i > lx; i--)
                {
                    b.bits[i - dx] |= bits[i] >> dy;
                    if (dy > 0) b.bits[i - dx - 1] |= bits[i] << (64 - dy);
                }
                b.bits[lx - dx] |= (bits[lx] & (ALL ^ mask[ly])) >> dy;
                if (dy > 0 && lx - dx - 1 >= 0) b.bits[lx - dx - 1] |= (bits[lx] & (ALL ^ mask[ly])) << (64 - dy);
            }
        }
    }
}
#endregion
#region DisjointSet
public class DisjointSet
{
    int[] par;
    byte[] rank;
    public DisjointSet(int n)
    {
        par = new int[n];
        for (int i = 0; i < n; i++)
            par[i] = -1;
        rank = new byte[n];
    }
    public int this[int id]
    {
        get
        {
            if ((par[id] < 0)) return id;
            return par[id] = this[par[id]];
        }
    }
    public bool Unite(int x, int y)
    {
        x = this[x]; y = this[y];
        if (x == y) return false;
        if (rank[x] < rank[y])
        {
            par[y] += par[x];
            par[x] = y;
        }
        else
        {
            par[x] += par[y];
            par[y] = x;
            if (rank[x] == rank[y])
                rank[x]++;
        }
        return true;
    }
    public int Size(int x) { return -par[this[x]]; }
    public bool IsUnited(int x, int y) { return this[x] == this[y]; }

}
#endregion
0