結果

問題 No.1307 Rotate and Accumulate
ユーザー EmKjp
提出日時 2020-12-04 08:28:58
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 901 ms / 5,000 ms
コード長 8,058 bytes
コンパイル時間 3,725 ms
コンパイル使用メモリ 114,132 KB
実行使用メモリ 48,776 KB
最終ジャッジ日時 2024-09-14 18:41:21
合計ジャッジ時間 13,208 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 19
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Globalization;
using System.IO;
using System.Text;
using System.Linq;
using E = System.Linq.Enumerable;
using System.Threading;
using System.Numerics;
internal partial class Solver {
    public void Run() {
        var n = ni();
        var q = ni();
        var a = nl(n);
        var r = ni(q);
        var h = new long[Math.Max(a.Max(), n) + 1];
        foreach (var x in r) {
            h[x % n]++;
        }
        a = a.Concat(a).ToArray();
        Array.Reverse(h);
        var conv = Convolution.Calculate(a, h);
        cout.WriteLine(conv.Skip(h.Length - 1).Take(n).JoinToString(" "));
    }
}
public static class Convolution {
    private static void Swap<T>(ref T a, ref T b) { var t = a; a = b; b = t; }
    private static void FFT(Complex[] a, bool reverse) {
        int n = a.Length;
        double theta = 2 * Math.PI / n * (reverse ? -1 : 1);
        for (int m = n; m >= 2; m >>= 1) {
            int mh = m >> 1;
            for (int i = 0; i < mh; i++) {
                var w = Complex.Exp(i * theta * Complex.ImaginaryOne);
                for (int j = i; j < n; j += m) {
                    int k = j + mh;
                    var x = a[j] - a[k];
                    a[j] += a[k];
                    a[k] = w * x;
                }
            }
            theta *= 2;
        }
        for (int i = 0, j = 1; j < n - 1; j++) {
            for (int k = n >> 1; k > (i ^= k); k >>= 1) {
                ;
            }
            if (j < i) {
                Swap(ref a[i], ref a[j]);
            }
        }
    }
    /// <returns>
    /// result[i] = sum a[x] * b[y] where x + y == i
    /// </returns>
    public static long[] Calculate(long[] a, long[] b) {
        int rN = a.Length + b.Length - 1;
        int n = 1;
        while (n <= rN) {
            n <<= 1;
        }
        var paddedA = new Complex[n];
        var paddedB = new Complex[n];
        for (int i = 0; i < a.Length; i++) {
            paddedA[i] = a[i];
        }
        for (int i = 0; i < b.Length; i++) {
            paddedB[i] = b[i];
        }
        FFT(paddedA, reverse: false);
        FFT(paddedB, reverse: false);
        for (int i = 0; i < n; i++) {
            paddedA[i] *= paddedB[i];
        }
        FFT(paddedA, reverse: true);
        long[] result = new long[rN];
        for (int i = 0; i < rN; i++) {
            result[i] = (long)Math.Round(paddedA[i].Real / n);
        }
        return result;
    }
}
// PREWRITEN CODE BEGINS FROM HERE
static public class StringExtensions {
    static public string JoinToString<T>(this IEnumerable<T> source, string separator = " ") {
        return string.Join(separator, source);
    }
}
internal partial class Solver : Scanner {
    static readonly int? StackSizeInMebiByte = null; //50;
    public static void StartAndJoin(Action action, int maxStackSize) {
        var thread = new Thread(new ThreadStart(action), maxStackSize);
        thread.Start();
        thread.Join();
    }
    public static void Main() {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        if (StackSizeInMebiByte.HasValue) {
            StartAndJoin(() => new Solver(Console.In, Console.Out).Run(), StackSizeInMebiByte.Value * 1024 * 1024);
        } else {
            new Solver(Console.In, Console.Out).Run();
        }
        Console.Out.Flush();
#endif
    }
#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
    private readonly TextWriter cerr;
#pragma warning restore IDE0052
    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
        cerr = Console.Error;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }
#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}
#if DEBUG
internal static class LinqPadExtension {
    public static string TextDump<T>(this T obj) {
        if (obj is IEnumerable) return (obj as IEnumerable).Cast<object>().JoinToString().Dump();
        else return obj.ToString().Dump();
    }
    public static T Dump<T>(this T obj) {
        return LINQPad.Extensions.Dump(obj);
    }
}
#endif
public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;
    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);
    public Scanner()
        : this(Console.In) {
    }
    public Scanner(TextReader reader) {
        Reader = reader;
    }
    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }
        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }
        return array;
    }
    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }
        return array;
    }
    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }
        return array;
    }
    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }
    public bool HasNext() {
        if (Token != null) {
            return true;
        }
        return StockToken();
    }
    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }
            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }
            return false;
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0