結果

問題 No.2248 max(C)-min(C)
ユーザー KumaTachiRenKumaTachiRen
提出日時 2023-03-17 22:06:38
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 2,450 ms / 3,000 ms
コード長 11,977 bytes
コンパイル時間 7,534 ms
コンパイル使用メモリ 158,080 KB
実行使用メモリ 187,224 KB
最終ジャッジ日時 2023-10-18 14:55:49
合計ジャッジ時間 77,114 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 75 ms
27,296 KB
testcase_01 AC 75 ms
27,296 KB
testcase_02 AC 76 ms
27,296 KB
testcase_03 AC 85 ms
27,672 KB
testcase_04 AC 83 ms
27,588 KB
testcase_05 AC 81 ms
27,576 KB
testcase_06 AC 97 ms
28,360 KB
testcase_07 AC 100 ms
28,464 KB
testcase_08 AC 99 ms
28,464 KB
testcase_09 AC 100 ms
28,464 KB
testcase_10 AC 80 ms
27,576 KB
testcase_11 AC 99 ms
28,464 KB
testcase_12 AC 87 ms
27,700 KB
testcase_13 AC 92 ms
27,900 KB
testcase_14 AC 98 ms
28,444 KB
testcase_15 AC 100 ms
28,444 KB
testcase_16 AC 84 ms
27,668 KB
testcase_17 AC 98 ms
28,388 KB
testcase_18 AC 2,096 ms
68,404 KB
testcase_19 AC 313 ms
35,268 KB
testcase_20 AC 2,433 ms
74,040 KB
testcase_21 AC 2,294 ms
83,516 KB
testcase_22 AC 1,576 ms
63,692 KB
testcase_23 AC 1,009 ms
48,200 KB
testcase_24 AC 429 ms
36,820 KB
testcase_25 AC 2,188 ms
83,112 KB
testcase_26 AC 1,925 ms
67,668 KB
testcase_27 AC 2,174 ms
83,036 KB
testcase_28 AC 260 ms
33,072 KB
testcase_29 AC 2,004 ms
67,860 KB
testcase_30 AC 809 ms
47,208 KB
testcase_31 AC 2,450 ms
74,040 KB
testcase_32 AC 477 ms
37,552 KB
testcase_33 AC 752 ms
46,876 KB
testcase_34 AC 2,414 ms
74,040 KB
testcase_35 AC 2,420 ms
74,032 KB
testcase_36 AC 2,419 ms
74,040 KB
testcase_37 AC 1,243 ms
59,664 KB
testcase_38 AC 2,423 ms
74,040 KB
testcase_39 AC 2,414 ms
74,040 KB
testcase_40 AC 2,418 ms
74,032 KB
testcase_41 AC 2,029 ms
68,160 KB
testcase_42 AC 2,405 ms
74,040 KB
testcase_43 AC 2,120 ms
82,916 KB
testcase_44 AC 2,424 ms
74,040 KB
testcase_45 AC 1,861 ms
67,060 KB
testcase_46 AC 979 ms
47,796 KB
testcase_47 AC 2,412 ms
74,040 KB
testcase_48 AC 2,039 ms
77,484 KB
testcase_49 AC 2,438 ms
74,040 KB
testcase_50 AC 2,427 ms
74,032 KB
testcase_51 AC 2,450 ms
74,040 KB
testcase_52 AC 2,415 ms
74,040 KB
testcase_53 AC 423 ms
187,224 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (102 ms)。
MSBuild のバージョン 17.7.3+8ec440e68 (.NET)
  main -> /home/judge/data/code/bin/Release/net7.0/main.dll
  main -> /home/judge/data/code/bin/Release/net7.0/publish/

ソースコード

diff # 

using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Diagnostics.Contracts;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using System.Text;
using static Functions;

static class Program
{
    static public void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver();
        Console.Out.Flush();
    }
}

public class Solver
{
    public Solver()
    {
        Solve();
    }

    void Solve()
    {
        int n = ri;
        var a = new long[n];
        var b = new long[n];
        for (int i = 0; i < n; i++) a[i] = ri;
        for (int i = 0; i < n; i++) b[i] = ri;

        var c = new long[n, 4];

        for (int i = 0; i < n; i++)
        {
            if (a[i] > b[i]) Swap(ref a[i], ref b[i]);
            c[i, 0] = a[i];
            c[i, 1] = (a[i] + b[i]) / 2;
            c[i, 2] = b[i];
            c[i, 3] = INF;
        }

        var x = new List<long>();
        var pq = new PriorityQueue<long, (int i, int j, long v)>(x => -x.v);
        for (int i = 0; i < n; i++)
            for (int j = 0; j < 3; j++)
            {
                x.Add(c[i, j]);
                pq.Enqueue((i, j, c[i, j]));
            }
        x.Sort();

        long max = a.Max();
        long ans = a.Max() - a.Min();
        foreach (var u in x)
        {
            while (pq.Count > 0 && pq.Peek().v < u)
            {
                var (i, j, v) = pq.Dequeue();
                Chmax(ref max, c[i, j + 1]);
            }
            Chmin(ref ans, max - u);
        }
        Write(ans);
    }

    const long INF = 1L << 60;
    int ri { get { return (int)sc.Integer(); } }
    long rl { get { return sc.Integer(); } }
    ulong rul { get { return sc.UInteger(); } }
    double rd { get { return sc.Double(); } }
    string rs { get { return sc.Scan(); } }
    string rline { get { return sc.Line(); } }
    public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    T[] RepArray<T>(T t, int count) => Enumerable.Repeat(t, count).ToArray();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void WriteJoin<T>(string s, IEnumerable<T> t) => Console.WriteLine(string.Join(s, t));
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void WriteMat<T>(T[,] a)
    {
        int sz1 = a.GetLength(0);
        int sz2 = a.GetLength(1);
        for (int i = 0; i < sz1; i++)
        {
            var s = new List<string>();
            for (int j = 0; j < sz2; j++) s.Add(a[i, j].ToString());
            WriteJoin(" ", s);
        }
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(object t) => Console.WriteLine(t.ToString());
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str) => Console.WriteLine(str);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str, object arg1) => Console.WriteLine(str, arg1);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str, object arg1, object arg2) => Console.WriteLine(str, arg1, arg2);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str, object arg1, object arg2, object arg3) => Console.WriteLine(str, arg1, arg2, arg3);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str, params object[] arg) => Console.WriteLine(str, arg);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void WriteFlush(object t)
    { Console.WriteLine(t.ToString()); Console.Out.Flush(); }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void WriteError(object t) => Console.Error.WriteLine(t.ToString());
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void YN(bool t) => Console.WriteLine(t ? "YES" : "NO");
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Yn(bool t) => Console.WriteLine(t ? "Yes" : "No");
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void yn(bool t) => Console.WriteLine(t ? "yes" : "no");
}

public static class Functions
{
    public static int Popcount(ulong x)
    {
        x = (x & 0x5555555555555555UL) + ((x >> 1) & 0x5555555555555555UL);
        x = (x & 0x3333333333333333UL) + ((x >> 2) & 0x3333333333333333UL);
        x = (x & 0x0f0f0f0f0f0f0f0fUL) + ((x >> 4) & 0x0f0f0f0f0f0f0f0fUL);
        x = (x & 0x00ff00ff00ff00ffUL) + ((x >> 8) & 0x00ff00ff00ff00ffUL);
        x = (x & 0x0000ffff0000ffffUL) + ((x >> 16) & 0x0000ffff0000ffffUL);
        x = (x & 0x00000000ffffffffUL) + ((x >> 32) & 0x00000000ffffffffUL);
        return (int)x;
    }
    public static int Popcount(int x)
    {
        x = (x & 0x55555555) + ((x >> 1) & 0x55555555);
        x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
        x = (x & 0x0f0f0f0f) + ((x >> 4) & 0x0f0f0f0f);
        x = (x & 0x00ff00ff) + ((x >> 8) & 0x00ff00ff);
        x = (x & 0x0000ffff) + ((x >> 16) & 0x0000ffff);
        return x;
    }
    public static int Ctz(long x)
    {
        if (x == 0) return -1;
        return Popcount((ulong)((x & -x) - 1));
    }
    public static int SafeMod(int x, int m)
    {
        int r = x % m;
        return r < 0 ? r + m : r;
    }
    public static long SafeMod(long x, long m)
    {
        long r = x % m;
        return r < 0 ? r + m : r;
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static int Sign(long x) => x == 0 ? 0 : (x < 0 ? -1 : 1);
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static int DigitSum(long n, int d = 10) { long s = 0; while (n > 0) { s += n % d; n /= d; } return (int)s; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static long Floor(long a, long b) => a >= 0 ? a / b : (a + 1) / b - 1;
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static long Ceil(long a, long b) => a > 0 ? (a - 1) / b + 1 : a / b;
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static int Gcd(int a, int b) => b == 0 ? a : Gcd(b, a % b);
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b);
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Swap(ref long x, ref long y) { x ^= y; y ^= x; x ^= y; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Swap<T>(ref T x, ref T y) { T t = y; y = x; x = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static T Clamp<T>(T x, T l, T r) where T : IComparable<T> => x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r);
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static T Clamp<T>(ref T x, T l, T r) where T : IComparable<T> => x = x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r);
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Chmin<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) > 0) x = y; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Chmax<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) < 0) x = y; }
    public static int LowerBound<T>(T[] arr, Func<T, int> comp, int l = -1, int r = -1) => LowerBound<T>(arr.AsSpan<T>(), comp, l, r);
    public static int LowerBound<T>(Span<T> data, Func<T, int> comp, int l = -1, int r = -1)
    {
        if (data.Length == 0) return -1;
        if (l == -1) l = 0;
        if (r == -1) r = data.Length;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(data[x]) < 0) l = x + 1;
            else r = x;
        }
        return l;
    }
}

public class StreamScanner
{
    public StreamScanner(Stream stream) { str = stream; }
    private 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) throw new EndOfStreamException();
        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 Line()
    {
        var sb = new StringBuilder();
        for (var b = Char(); b != 10 && !isEof; b = (char)read()) sb.Append(b);
        return sb.ToString();
    }
    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 Integer()
    {
        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 ulong UInteger()
    {
        ulong ret = 0; byte b = 0;
        do b = read();
        while (b < '0' || '9' < b);
        for (; true; b = read())
        {
            if (b < '0' || '9' < b) return ret;
            else ret = ret * 10 + b - '0';
        }
    }
    public double Double() { return double.Parse(Scan()); }
}

public class PriorityQueue<TKey, TValue> : IEnumerable<TValue>
{
    public int Count { get; private set; } = 0;
    private readonly List<KeyValuePair<TKey, TValue>> _data;
    private readonly Func<TValue, TKey> _keySelector;
    private readonly IComparer<TKey> _keyComparer;
    public PriorityQueue(Func<TValue, TKey> keySelector) : this(keySelector, Comparer<TKey>.Default) { }
    public PriorityQueue(Func<TValue, TKey> keySelector, IComparer<TKey> keyComparer)
    {
        _keySelector = keySelector;
        _keyComparer = keyComparer;
        _data = new List<KeyValuePair<TKey, TValue>>();
    }
    public void Clear()
    {
        Count = 0;
        _data.Clear();
    }
    public void Enqueue(TValue item)
    {
        _data.Add(new KeyValuePair<TKey, TValue>(_keySelector(item), item));
        var childIndex = Count;
        Count++;
        while (childIndex > 0)
        {
            var parentIndex = (childIndex - 1) / 2;
            if (Compare(_data[childIndex].Key, _data[parentIndex].Key) >= 0)
                break;
            Swap(childIndex, parentIndex);
            childIndex = parentIndex;
        }
    }
    public TValue Dequeue()
    {
        Count--;
        var lastIndex = Count;
        var firstItem = _data[0];
        _data[0] = _data[lastIndex];
        _data.RemoveAt(lastIndex--);
        var parentIndex = 0;
        while (true)
        {
            var childIndex = parentIndex * 2 + 1;
            if (childIndex > lastIndex)
                break;
            var rightChild = childIndex + 1;
            if (rightChild <= lastIndex && Compare(_data[rightChild].Key, _data[childIndex].Key) < 0)
                childIndex = rightChild;
            if (Compare(_data[parentIndex].Key, _data[childIndex].Key) <= 0)
                break;
            Swap(parentIndex, childIndex);
            parentIndex = childIndex;
        }
        return firstItem.Value;
    }
    public TValue Peek() { return _data[0].Value; }
    private void Swap(int a, int b)
    {
        var tmp = _data[a];
        _data[a] = _data[b];
        _data[b] = tmp;
    }
    private int Compare(TKey a, TKey b) { return _keyComparer.Compare(b, a); }
    public IEnumerator<TValue> GetEnumerator()
    {
        return _data.Select(r => r.Value).GetEnumerator();
    }
    IEnumerator IEnumerable.GetEnumerator() => GetEnumerator();
}
0