#352373 (C#(csc)) No.837 Noelちゃんと星々2

• 問題: No.837 Noelちゃんと星々2
• ユーザー: EmKjp
• 提出日時: 2019-06-15 17:07:09
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 93 ms / 2,000 ms
• コード長: 8,067 bytes
• コンパイル時間: 2,494 ms
• コンパイル使用メモリ: 110,080 KB
• 実行使用メモリ: 36,480 KB
• 最終ジャッジ日時: 2024-06-11 14:24:00
• 合計ジャッジ時間: 4,116 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

ファイルパターン	結果
sample	AC * 4
other	AC * 29

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

using System;
using System.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;
using E = System.Linq.Enumerable;

partial class Solver
{
    public void Run()
    {
        var N = ni();
        var Y = nl(N);

        Array.Sort(Y);

        var S = new SumTable(Y);

        long ans = long.MaxValue;

        if (Y.First() == Y.Last())
        {
            ans = 1;
        }
        else
        {
            for (int i = 1; i < N; i++)
            {
                // (0..i), (i..N)
                var n1 = i;
                var n2 = N - i;
                var mid1 = Y[n1 / 2];
                var mid2 = Y[i + n2 / 2];

                var sub = 0L;

                var l1 = n1 / 2;
                var u1 = n1 - l1;
                var l2 = n2 / 2;
                var u2 = n2 - l2;

                sub += mid1 * l1 - S.Sum(0, n1 / 2);
                sub += S.Sum(n1 / 2, i) - mid1 * u1;

                sub += mid2 * l2 - S.Sum(i, i + n2 / 2);
                sub += S.Sum(i + n2 / 2, N) - mid2 * u2;

                ans = Math.Min(ans, sub);
            }
        }
        cout.WriteLine(ans);
    }
}

public class SumTable
{
    private readonly long[] sumArray;
    public SumTable(long[] array)
    {
        sumArray = new long[array.Length + 1];
        Array.Copy(array, 0, sumArray, 1, array.Length);
        for (int i = 1; i < sumArray.Length; i++)
        {
            sumArray[i] += sumArray[i - 1];
        }
    }

    public long Sum(int begin, int end)
    {
        if (begin >= end) return 0;
        return sumArray[end] - sumArray[begin];
    }
}

public class ModMatrix
{
    public int Row { get; private set; }
    public int Col { get; private set; }
    public int Mod { get; private set; }
    private long[] Data;
    public ModMatrix(int row, int col, int mod)
    {
        this.Row = row;
        this.Col = col;
        this.Data = new long[Row * Col];
        this.Mod = mod;
    }

    public ModMatrix(long[,] array, int mod)
        : this(array.GetLength(0), array.GetLength(1), mod)
    {
        int index = 0;
        for (int i = 0; i < Row; i++)
        {
            for (int j = 0; j < Col; j++)
            {
                Data[index++] = array[i, j] % mod;
            }
        }
    }

    public long this[int row, int col]
    {
        set
        {
            Data[row * Col + col] = value;
        }
        get
        {
            return Data[row * Col + col];
        }
    }

    static public ModMatrix UnitMatrix(int n, int mod)
    {
        var matrix = new ModMatrix(n, n, mod);
        for (int i = 0; i < n; i++)
        {
            matrix[i, i] = 1;
        }
        return matrix;
    }

    static public ModMatrix operator +(ModMatrix A, ModMatrix B)
    {
        if (A.Mod != B.Mod) throw new InvalidOperationException("A.Mod must be equal to B.Mod");
        var C = new ModMatrix(A.Row, A.Col, A.Mod);
        for (int i = 0; i < C.Data.Length; i++)
        {
            C.Data[i] = (A.Data[i] + B.Data[i] + A.Mod) % A.Mod;
        }
        return C;
    }

    static public ModMatrix operator -(ModMatrix A, ModMatrix B)
    {
        if (A.Mod != B.Mod) throw new InvalidOperationException("A.Mod must be equal to B.Mod");
        var C = new ModMatrix(A.Row, A.Col, A.Mod);
        for (int i = 0; i < C.Data.Length; i++)
        {
            C.Data[i] = (A.Data[i] - B.Data[i] + A.Mod) % A.Mod;
        }
        return C;
    }

    static public ModMatrix operator *(ModMatrix A, ModMatrix B)
    {
        if (A.Mod != B.Mod) throw new InvalidOperationException("A.Mod must be equal to B.Mod");
        var C = new ModMatrix(A.Row, B.Col, A.Mod);
        for (int i = 0; i < A.Row; i++)
        {
            for (int j = 0; j < B.Col; j++)
            {
                var val = C[i, j];
                for (int k = 0; k < A.Col; k++) val = (val + A[i, k] * B[k, j]) % A.Mod;
                if (val < 0) val += A.Mod;
                C[i, j] = val;
            }
        }
        return C;
    }

    static public ModMatrix Pow(ModMatrix A, long n)
    {
        if (n == 0) return UnitMatrix(A.Row, A.Mod);
        if (n == 1) return A;
        ModMatrix result = A.Clone(), t = A.Clone(); n--;
        for (; n > 0; n >>= 1)
        {
            if ((n & 1) != 0) result = result * t;
            t = t * t;
        }

        return result;
    }

    public ModMatrix Clone()
    {
        return new ModMatrix(Row, Col, Mod) { Data = Data.Clone() as long[] };
    }
}
// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner
{
    public static void Main(string[] args)
    {
#if LOCAL
        new Solver(Console.In, Console.Out).Run();
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader)
    {
        this.cin = reader;
        this.cout = writer;
    }
    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
}

public static class LinqPadExtension
{
    static public T Dump<T>(this T obj)
    {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}
public class Scanner
{
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In)
    {
    }

    public Scanner(TextReader reader)
    {
        this.Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size)
    {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size)
    {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size)
    {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public double[] NextDoubleArray(int size)
    {
        var array = new double[size];
        for (int i = 0; i < size; i++) array[i] = NextDouble();
        return array;
    }

    public string Next()
    {
        if (TokenQueue.Count == 0)
        {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext()
    {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }
    static readonly char[] _separator = new[] { ' ' };
    private bool StockTokens()
    {
        while (true)
        {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}