#25898 (C#(csc)) No.206 数の積集合を求めるクエリ

提出ソース

結果

問題	No.206 数の積集合を求めるクエリ
ユーザー	紙ぺーぱー
提出日時	2015-05-10 01:58:52
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	844 ms / 7,000 ms
コード長	7,376 bytes
コンパイル時間	2,647 ms
コンパイル使用メモリ	112,024 KB
実行使用メモリ	31,460 KB
最終ジャッジ日時	2023-09-19 09:37:19
合計ジャッジ時間	12,909 ms
ジャッジサーバーID （参考情報）	judge11 / judge14

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	51 ms 22,540 KB
testcase_01	AC	52 ms 20,628 KB
testcase_02	AC	51 ms 20,352 KB
testcase_03	AC	52 ms 20,448 KB
testcase_04	AC	51 ms 20,440 KB
testcase_05	AC	51 ms 22,360 KB
testcase_06	AC	52 ms 20,540 KB
testcase_07	AC	51 ms 22,496 KB
testcase_08	AC	52 ms 22,204 KB
testcase_09	AC	52 ms 20,436 KB
testcase_10	AC	53 ms 20,464 KB
testcase_11	AC	52 ms 20,324 KB
testcase_12	AC	53 ms 20,544 KB
testcase_13	AC	53 ms 20,404 KB
testcase_14	AC	53 ms 20,380 KB
testcase_15	AC	53 ms 20,328 KB
testcase_16	AC	53 ms 20,448 KB
testcase_17	AC	70 ms 29,204 KB
testcase_18	AC	64 ms 26,664 KB
testcase_19	AC	70 ms 27,016 KB
testcase_20	AC	66 ms 26,748 KB
testcase_21	AC	67 ms 28,812 KB
testcase_22	AC	66 ms 27,004 KB
testcase_23	AC	70 ms 26,996 KB
testcase_24	AC	838 ms 29,480 KB
testcase_25	AC	844 ms 31,460 KB
testcase_26	AC	830 ms 29,136 KB
testcase_27	AC	768 ms 28,912 KB
testcase_28	AC	837 ms 31,276 KB
testcase_29	AC	837 ms 31,252 KB
testcase_30	AC	841 ms 29,076 KB

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

コンパイルメッセージ

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.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var l = sc.Integer();
            var m = sc.Integer();
            var n = sc.Integer();
            var a = new bool[100256];
            var b = new bool[100256];
            foreach (var x in sc.Integer(l))
                a[x - 1] = true;
            foreach (var x in sc.Integer(m))
                b[x - 1] = true;
            var va = new Bit256[100256];
            var vb = new Bit256[100256];
            const ulong e = 1;

            for (int i = 0; i < 256; i++)
            {
                if (i < 64)
                {
                    if (a[i]) va[0].a |= e << i;
                    if (b[i]) vb[0].a |= e << i;
                }
                else if (i < 128)
                {
                    if (a[i]) va[0].b |= e << i;
                    if (b[i]) vb[0].b |= e << i;
                }
                else if (i < 192)
                {
                    if (a[i]) va[0].c |= e << i;
                    if (b[i]) vb[0].c |= e << i;
                }
                else
                {
                    if (a[i]) va[0].d |= e << i;
                    if (b[i]) vb[0].d |= e << i;
                }
            }

            for (int i = 1; i < n; i++)
            {
                va[i] = va[i - 1] >> 1;
                va[i].d |= a[i + 255] ? e << 63 : 0;
                vb[i] = vb[i - 1] >> 1;
                vb[i].d |= b[i + 255] ? e << 63 : 0;
            }
            var q = sc.Integer();
            var ans = new int[q];
            for (int i = 0; i < n; i += 256)
            {
                for (int j = 0; j < q && i + j <= n; j++)
                    ans[j] += Bit256.PopCount(va[i + j] & vb[i]);
            }
            foreach (var x in ans)
                IO.Printer.Out.WriteLine(x);
        }
        static public int PopCount(ulong i)
        {
            i = i - ((i >> 1) & 0x5555555555555555UL);
            i = (i & 0x3333333333333333ul) + ((i >> 2) & 0x3333333333333333ul);
            return (int)(unchecked(((i + (i >> 4)) & 0xF0F0F0F0F0F0F0Ful) * 0x101010101010101ul) >> 56);
        }
        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 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, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, IEnumerable<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); 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 long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            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() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        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); }
    }
}
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
public struct Bit256
{
    public ulong a, b, c, d;
    public Bit256(ulong w, ulong x, ulong y, ulong z) : this() { a = w; b = x; c = y; d = z; }
    public static Bit256 operator >>(Bit256 l, int r) { return new Bit256((l.a >> r) | (l.b << 64 - r), (l.b >> r) | (l.c << 64 - r), (l.c >> r) | (l.d << 64 - r), l.d >> r); }
    public static Bit256 operator <<(Bit256 l, int r) { return new Bit256(l.a << r, (l.b << r) | (l.a >> 64 - r), (l.c << r) | (l.b >> 64 - r), (l.d << r) | (l.c >> 64 - r)); }
    public static Bit256 operator &(Bit256 l, Bit256 r) { return new Bit256(l.a & r.a, l.b & r.b, l.c & r.c, l.d & r.d); }
    public static Bit256 operator |(Bit256 l, Bit256 r) { return new Bit256(l.a | r.a, l.b | r.b, l.c | r.c, l.d | r.d); }
    public static Bit256 operator ^(Bit256 l, Bit256 r) { return new Bit256(l.a ^ r.a, l.b ^ r.b, l.c ^ r.c, l.d ^ r.d); }
    public static int PopCount(Bit256 bit) { return popCount(bit.a) + popCount(bit.b) + popCount(bit.c) + popCount(bit.d); }
    static int popCount(ulong i)
    {
        i = i - ((i >> 1) & 0x5555555555555555UL);
        i = (i & 0x3333333333333333ul) + ((i >> 2) & 0x3333333333333333ul);
        return (int)(unchecked(((i + (i >> 4)) & 0xF0F0F0F0F0F0F0Ful) * 0x101010101010101ul) >> 56);
    }
    public override string ToString()
    {
        return string.Format("{0:X16}{1:X16}{2:X16}{3:X16}", d, c, b, a);
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード