結果

問題 No.1251 絶対に間違ってはいけない最小化問題
ユーザー azukunazukun
提出日時 2020-10-09 22:31:56
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 249 ms / 2,000 ms
コード長 4,435 bytes
コンパイル時間 1,735 ms
コンパイル使用メモリ 66,524 KB
実行使用メモリ 47,320 KB
最終ジャッジ日時 2023-09-27 18:25:06
合計ジャッジ時間 21,629 ms
ジャッジサーバーID
(参考情報)
judge14 / judge15
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
21,608 KB
testcase_01 AC 61 ms
21,616 KB
testcase_02 AC 61 ms
21,616 KB
testcase_03 AC 61 ms
21,688 KB
testcase_04 AC 62 ms
21,536 KB
testcase_05 AC 63 ms
23,816 KB
testcase_06 AC 64 ms
23,832 KB
testcase_07 AC 61 ms
21,732 KB
testcase_08 AC 63 ms
23,596 KB
testcase_09 AC 61 ms
23,644 KB
testcase_10 AC 64 ms
19,640 KB
testcase_11 AC 61 ms
21,660 KB
testcase_12 AC 61 ms
21,620 KB
testcase_13 AC 63 ms
21,712 KB
testcase_14 AC 63 ms
23,764 KB
testcase_15 AC 62 ms
21,792 KB
testcase_16 AC 61 ms
23,740 KB
testcase_17 AC 61 ms
21,720 KB
testcase_18 AC 236 ms
44,644 KB
testcase_19 AC 233 ms
42,152 KB
testcase_20 AC 168 ms
43,872 KB
testcase_21 AC 80 ms
22,876 KB
testcase_22 AC 178 ms
47,320 KB
testcase_23 AC 74 ms
22,780 KB
testcase_24 AC 199 ms
45,312 KB
testcase_25 AC 168 ms
46,664 KB
testcase_26 AC 99 ms
27,116 KB
testcase_27 AC 76 ms
22,756 KB
testcase_28 AC 239 ms
44,892 KB
testcase_29 AC 240 ms
44,960 KB
testcase_30 AC 249 ms
44,892 KB
testcase_31 AC 241 ms
45,072 KB
testcase_32 AC 239 ms
46,996 KB
testcase_33 AC 242 ms
44,812 KB
testcase_34 AC 243 ms
46,832 KB
testcase_35 AC 243 ms
44,844 KB
testcase_36 AC 247 ms
46,940 KB
testcase_37 AC 243 ms
45,028 KB
testcase_38 AC 241 ms
44,888 KB
testcase_39 AC 244 ms
46,872 KB
testcase_40 AC 243 ms
44,936 KB
testcase_41 AC 242 ms
43,016 KB
testcase_42 AC 247 ms
44,848 KB
testcase_43 AC 60 ms
23,664 KB
testcase_44 AC 62 ms
23,640 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading;

// (づ°ω°)づミe★゜・。。・゜゜・。。・゜☆゜・。。・゜゜・。。・゜
public class Solver
{
    public void Solve()
    {
        int n = ReadInt();
        var a = ReadIntArray();
        var b = ReadIntArray();

        Array.Sort(a, b);

        long rsum = 0, rb = 0;
        for (int i = 1; i < n; i++)
        {
            rsum += 1L * b[i] * (a[i] - a[0]);
            rb += b[i];
        }

        int best = 0;
        long ans = rsum;
        long lsum = 0, lb = 0;
        for (int i = 1; i < n; i++)
        {
            rsum -= rb * (a[i] - a[i - 1]);
            rb -= b[i];
            lb += b[i - 1];
            lsum += lb * (a[i] - a[i - 1]);
            if (lsum + rsum < ans)
            {
                ans = lsum + rsum;
                best = i;
            }
        }

        Write(a[best], ans);
    }

    #region Main

    protected static TextReader reader;
    protected static TextWriter writer;
    static void Main()
    {
#if DEBUG
        reader = new StreamReader("..\\..\\input.txt");
        //reader = new StreamReader(Console.OpenStandardInput());
        writer = Console.Out;
        //writer = new StreamWriter("..\\..\\output.txt");
#else
        reader = new StreamReader(Console.OpenStandardInput());
        writer = new StreamWriter(Console.OpenStandardOutput());
        //reader = new StreamReader("input.txt");
        //writer = new StreamWriter("output.txt");
#endif
        try
        {
            new Solver().Solve();
            //var thread = new Thread(new Solver().Solve, 1024 * 1024 * 128);
            //thread.Start();
            //thread.Join();
        }
        catch (Exception ex)
        {
#if DEBUG
            Console.WriteLine(ex);
#else
            throw;
#endif
        }
        reader.Close();
        writer.Close();
    }

    #endregion

    #region Read / Write
    private static Queue<string> currentLineTokens = new Queue<string>();
    private static string[] ReadAndSplitLine() { return reader.ReadLine().Split(new[] { ' ', '\t', }, StringSplitOptions.RemoveEmptyEntries); }
    public static string ReadToken() { while (currentLineTokens.Count == 0) currentLineTokens = new Queue<string>(ReadAndSplitLine()); return currentLineTokens.Dequeue(); }
    public static int ReadInt() { return int.Parse(ReadToken()); }
    public static long ReadLong() { return long.Parse(ReadToken()); }
    public static double ReadDouble() { return double.Parse(ReadToken(), CultureInfo.InvariantCulture); }
    public static int[] ReadIntArray() { return ReadAndSplitLine().Select(int.Parse).ToArray(); }
    public static long[] ReadLongArray() { return ReadAndSplitLine().Select(long.Parse).ToArray(); }
    public static double[] ReadDoubleArray() { return ReadAndSplitLine().Select(s => double.Parse(s, CultureInfo.InvariantCulture)).ToArray(); }
    public static int[][] ReadIntMatrix(int numberOfRows) { int[][] matrix = new int[numberOfRows][]; for (int i = 0; i < numberOfRows; i++) matrix[i] = ReadIntArray(); return matrix; }
    public static int[][] ReadAndTransposeIntMatrix(int numberOfRows)
    {
        int[][] matrix = ReadIntMatrix(numberOfRows); int[][] ret = new int[matrix[0].Length][];
        for (int i = 0; i < ret.Length; i++) { ret[i] = new int[numberOfRows]; for (int j = 0; j < numberOfRows; j++) ret[i][j] = matrix[j][i]; }
        return ret;
    }
    public static string[] ReadLines(int quantity) { string[] lines = new string[quantity]; for (int i = 0; i < quantity; i++) lines[i] = reader.ReadLine().Trim(); return lines; }
    public static void WriteArray<T>(IEnumerable<T> array) { writer.WriteLine(string.Join(" ", array)); }
    public static void Write(params object[] array) { WriteArray(array); }
    public static void WriteLines<T>(IEnumerable<T> array) { foreach (var a in array) writer.WriteLine(a); }
    private class SDictionary<TKey, TValue> : Dictionary<TKey, TValue>
    {
        public new TValue this[TKey key]
        {
            get { return ContainsKey(key) ? base[key] : default(TValue); }
            set { base[key] = value; }
        }
    }
    private static T[] Init<T>(int size) where T : new() { var ret = new T[size]; for (int i = 0; i < size; i++) ret[i] = new T(); return ret; }
    #endregion
}
0