結果
問題 | No.2304 Distinct Elements |
ユーザー |
|
提出日時 | 2023-05-12 22:51:59 |
言語 | C# (.NET 8.0.404) |
結果 |
AC
|
実行時間 | 916 ms / 3,000 ms |
コード長 | 18,682 bytes |
コンパイル時間 | 8,765 ms |
コンパイル使用メモリ | 167,540 KB |
実行使用メモリ | 185,776 KB |
最終ジャッジ日時 | 2024-11-28 19:27:41 |
合計ジャッジ時間 | 31,895 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 58 |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (95 ms)。 MSBuild のバージョン 17.9.6+a4ecab324 (.NET) main -> /home/judge/data/code/bin/Release/net8.0/main.dll main -> /home/judge/data/code/bin/Release/net8.0/publish/
ソースコード
using System;using System.ComponentModel;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;using ModInt = StaticModInt<Mod998244353>;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 int[n];for (int i = 0; i < n; i++) a[i] = ri;Array.Sort(a);var st = new SlopeTrick();for (int i = 0; i < n; i++){st.ClearRight();st.Shift(1);st.AddAbs(a[i]);}Write(st.Min);}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 interface IStaticMod{uint Mod { get; }bool IsPrime { get; }}public readonly struct Mod1000000007 : IStaticMod{public uint Mod => 1000000007;public bool IsPrime => true;}public readonly struct Mod998244353 : IStaticMod{public uint Mod => 998244353;public bool IsPrime => true;}public readonly struct StaticModInt<T> : IEquatable<StaticModInt<T>>, IFormattable where T : struct, IStaticMod{internal readonly uint _v;private static readonly T op = default;public int Value => (int)_v;public static int Mod => (int)op.Mod;public static StaticModInt<T> Zero => default;public static StaticModInt<T> One => new StaticModInt<T>(1u);[MethodImpl(256)]public static StaticModInt<T> Raw(int v){var u = unchecked((uint)v);return new StaticModInt<T>(u);}[MethodImpl(256)]public StaticModInt(long v) : this(Round(v)) { }[MethodImpl(256)]public StaticModInt(ulong v) : this((uint)(v % op.Mod)) { }[MethodImpl(256)]private StaticModInt(uint v) => _v = v;[MethodImpl(256)]private static uint Round(long v){var x = v % op.Mod;if (x < 0) x += op.Mod;return (uint)x;}[MethodImpl(256)]public static StaticModInt<T> operator ++(StaticModInt<T> v){var x = v._v + 1;if (x == op.Mod) x = 0;return new StaticModInt<T>(x);}[MethodImpl(256)]public static StaticModInt<T> operator --(StaticModInt<T> v){var x = v._v;if (x == 0) x = op.Mod;return new StaticModInt<T>(x - 1);}[MethodImpl(256)]public static StaticModInt<T> operator +(StaticModInt<T> lhs, StaticModInt<T> rhs){var v = lhs._v + rhs._v;if (v >= op.Mod) v -= op.Mod;return new StaticModInt<T>(v);}[MethodImpl(256)]public static StaticModInt<T> operator -(StaticModInt<T> lhs, StaticModInt<T> rhs){unchecked{var v = lhs._v - rhs._v;if (v >= op.Mod) v += op.Mod;return new StaticModInt<T>(v);}}[MethodImpl(256)]public static StaticModInt<T> operator *(StaticModInt<T> lhs, StaticModInt<T> rhs) => new StaticModInt<T>((uint)((ulong)lhs._v * rhs._v % op.Mod));[MethodImpl(256)]public static StaticModInt<T> operator /(StaticModInt<T> lhs, StaticModInt<T> rhs) => lhs * rhs.Inv();[MethodImpl(256)]public static StaticModInt<T> operator +(StaticModInt<T> v) => v;[MethodImpl(256)]public static StaticModInt<T> operator -(StaticModInt<T> v) => new StaticModInt<T>(v._v == 0 ? 0 : op.Mod - v._v);[MethodImpl(256)]public static bool operator ==(StaticModInt<T> lhs, StaticModInt<T> rhs) => lhs._v == rhs._v;[MethodImpl(256)]public static bool operator !=(StaticModInt<T> lhs, StaticModInt<T> rhs) => lhs._v != rhs._v;[MethodImpl(256)]public static implicit operator StaticModInt<T>(int v) => new StaticModInt<T>(v);[MethodImpl(256)]public static implicit operator StaticModInt<T>(uint v) => new StaticModInt<T>((long)v);[MethodImpl(256)]public static implicit operator StaticModInt<T>(long v) => new StaticModInt<T>(v);[MethodImpl(256)]public static implicit operator StaticModInt<T>(ulong v) => new StaticModInt<T>(v);[MethodImpl(256)]public static implicit operator long(StaticModInt<T> v) => v._v;[MethodImpl(256)]public static implicit operator ulong(StaticModInt<T> v) => v._v;[MethodImpl(256)]public StaticModInt<T> Pow(long n){var x = this;var r = new StaticModInt<T>(1U);while (n > 0){if ((n & 1) > 0) r *= x;x *= x;n >>= 1;}return r;}[MethodImpl(256)]public StaticModInt<T> Inv(){var (x, y, g) = ExtGcd(_v, op.Mod);return new StaticModInt<T>(x);}[MethodImpl(256)]static (long x, long y, long g) ExtGcd(long a, long b){if (b == 0) return a >= 0 ? (1, 0, a) : (-1, 0, -a);long c = SafeMod(a, b);var (x2, y2, g) = ExtGcd(b, c);long x = SafeMod(y2, b);long y = (g - a * x) / b;return (x, y, g);}[MethodImpl(256)]static long SafeMod(long x, long m){long r = x % m;if (r < 0) r += m;return r;}[MethodImpl(256)]public override string ToString() => _v.ToString();[MethodImpl(256)]public string ToString(string format, IFormatProvider formatProvider) => _v.ToString(format, formatProvider);[MethodImpl(256)]public override bool Equals(object obj) => obj is StaticModInt<T> m && Equals(m);[MethodImpl(256)]public bool Equals(StaticModInt<T> other) => _v == other._v;[MethodImpl(256)]public override int GetHashCode() => _v.GetHashCode();}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()); }}class SlopeTrick{private const long INF = (long)1 << 60;PriorityQueue<long, long> l, r;long min;long l_add, r_add;[MethodImpl(256)] private long LPeek() => l.Count > 0 ? l.Peek() + l_add : -INF;[MethodImpl(256)] private long RPeek() => r.Count > 0 ? r.Peek() + r_add : INF;[MethodImpl(256)] private long LPop() => l.Count > 0 ? l.Dequeue() + l_add : -INF;[MethodImpl(256)] private long RPop() => r.Count > 0 ? r.Dequeue() + r_add : INF;[MethodImpl(256)] private void LPush(long a) => l.Enqueue(a - l_add);[MethodImpl(256)] private void RPush(long a) => r.Enqueue(a - r_add);public SlopeTrick(long _min = 0){min = _min;l = new PriorityQueue<long, long>(x => x);r = new PriorityQueue<long, long>(x => -x);l_add = 0;r_add = 0;}public long Count => l.Count + r.Count;public long Min => min;[MethodImpl(256)]public (long l, long r) MinX() => (LPeek(), RPeek());[MethodImpl(256)]public SortedSet<long> Inflection(){var x = new SortedSet<long>();foreach (var v in l) x.Add(v);foreach (var v in r) x.Add(v);return x;}[MethodImpl(256)]public void AddConst(long a) => min += a;[MethodImpl(256)]public void AddXMinusA(long a){if (LPeek() > a) min += LPeek() - a;LPush(a);RPush(LPop());}[MethodImpl(256)]public void AddAMinusX(long a){if (RPeek() < a) min += a - RPeek();RPush(a);LPush(RPop());}[MethodImpl(256)]public void AddAbs(long a){AddXMinusA(a);AddAMinusX(a);}[MethodImpl(256)]public void ClearRight() => r.Clear();[MethodImpl(256)]public void ClearLeft() => l.Clear();[MethodImpl(256)]public void Shift(long a, long b){l_add += a;r_add += b;}[MethodImpl(256)]public void Shift(long a) => Shift(a, a);[MethodImpl(256)]public long Val(long a){long ret = min;while (l.Count > 0) ret += Math.Max(0, LPop() - a);while (r.Count > 0) ret += Math.Max(0, a - RPop());return ret;}public void Fix(long a, long b){while (LPeek() > b){min += LPop() - b;LPush(b);}while (RPeek() < a){min += a - RPop();RPush(a);}}}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();}