Submission #749203


Source Code Expand

using System;
using System.Linq;
using System.Linq.Expressions;
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.Int32;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var k = 1;
            while (k < 2 * (n + 1)) k *= 2;
            var A = new Complex[k];
            var B = new Complex[k];
            for (int i = 0; i < n; i++)
            {
                A[i + 1] = new Complex(sc.Integer(), 0);
                B[i + 1] = new Complex(sc.Integer(), 0);
            }
            var ret = MathEX.Convolute(A, B);
            for (int i = 1; i <= 2 * n; i++)
                IO.Printer.Out.WriteLine((long)(ret[i].Real + 1e-4));
        }
        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 FFT
static public partial class MathEX
{
    static private void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    static public Complex[] Convolute(Complex[] A, Complex[] B)
    {
        var n = A.Length;
        var ret = new Complex[n];
        FFT(A); FFT(B);
        for (int i = 0; i < n; i++)
            ret[i] = A[i] * B[i];
        InvFFT(ret);
        return ret;
    }
    static public void FFT(Complex[] a)
    {
        fft(a.Length, 2 * Math.PI / a.Length, a);
    }
    static public void InvFFT(Complex[] a)
    {
        var n = a.Length;
        fft(n, -2 * Math.PI / a.Length, a);
        for (int i = 0; i < n; i++)
            a[i] /= n;
    }
    static private void fft(int n, double theta, Complex[] a)
    {
        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;
        }

        {
            int i = 0;
            for (int 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]);
            }
        }
    }
}

#endregion

Submission Info

Submission Time
Task C - 高速フーリエ変換
User camypaper
Language C# (Mono 3.2.1.0)
Score 100
Code Size 6571 Byte
Status AC
Exec Time 895 ms
Memory 24936 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 1
AC × 33
Set Name Test Cases
Sample 00_sample_01
All 00_sample_01, 01_00_01, 01_01_19, 01_02_31, 01_03_22, 01_04_31, 01_05_40, 01_06_15, 01_07_39, 01_08_28, 01_09_30, 01_10_23, 01_11_33, 01_12_11, 01_13_28, 01_14_41, 01_15_26, 01_16_49, 01_17_34, 01_18_02, 01_19_33, 01_20_29, 02_00_51254, 02_01_82431, 02_02_17056, 02_03_34866, 02_04_6779, 02_05_65534, 02_06_65535, 02_07_65536, 02_08_65537, 02_09_65538, 02_10_100000
Case Name Status Exec Time Memory
00_sample_01 AC 169 ms 8880 KB
01_00_01 AC 111 ms 8872 KB
01_01_19 AC 111 ms 8876 KB
01_02_31 AC 108 ms 8872 KB
01_03_22 AC 108 ms 8872 KB
01_04_31 AC 106 ms 8872 KB
01_05_40 AC 106 ms 8872 KB
01_06_15 AC 113 ms 8868 KB
01_07_39 AC 111 ms 8868 KB
01_08_28 AC 110 ms 8872 KB
01_09_30 AC 108 ms 8864 KB
01_10_23 AC 110 ms 8868 KB
01_11_33 AC 110 ms 8864 KB
01_12_11 AC 109 ms 8912 KB
01_13_28 AC 113 ms 8872 KB
01_14_41 AC 114 ms 8912 KB
01_15_26 AC 109 ms 8868 KB
01_16_49 AC 109 ms 8876 KB
01_17_34 AC 109 ms 8872 KB
01_18_02 AC 107 ms 8920 KB
01_19_33 AC 109 ms 8872 KB
01_20_29 AC 108 ms 8832 KB
02_00_51254 AC 459 ms 18784 KB
02_01_82431 AC 883 ms 24904 KB
02_02_17056 AC 265 ms 13132 KB
02_03_34866 AC 440 ms 17864 KB
02_04_6779 AC 142 ms 9904 KB
02_05_65534 AC 487 ms 18788 KB
02_06_65535 AC 480 ms 18796 KB
02_07_65536 AC 854 ms 24904 KB
02_08_65537 AC 861 ms 24932 KB
02_09_65538 AC 852 ms 24900 KB
02_10_100000 AC 895 ms 24936 KB