#682074 (C#(csc)) No.1619 Coccinellidae

提出ソース

結果

問題	No.1619 Coccinellidae
ユーザー	fairy_lettuce
提出日時	2021-07-22 23:04:22
言語	C#(csc) (csc 3.9.0)
結果	RE
実行時間	-
コード長	15,145 bytes
コンパイル時間	2,410 ms
コンパイル使用メモリ	123,996 KB
実行使用メモリ	38,156 KB
最終ジャッジ日時	2024-07-17 19:41:07
合計ジャッジ時間	4,509 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	28 ms 24,940 KB
testcase_01	RE	-
testcase_02	AC	95 ms 38,024 KB
testcase_03	AC	28 ms 27,048 KB
testcase_04	RE	-
testcase_05	AC	68 ms 35,056 KB
testcase_06	RE	-
testcase_07	RE	-
testcase_08	AC	67 ms 34,964 KB
testcase_09	WA	-
testcase_10	RE	-
testcase_11	AC	78 ms 34,316 KB
testcase_12	AC	26 ms 25,124 KB
testcase_13	RE	-
testcase_14	AC	104 ms 35,604 KB
testcase_15	AC	29 ms 25,264 KB
testcase_16	AC	28 ms 25,264 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

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

ソースコード

raw source code

using System;
using System.IO;
using System.Collections.Generic;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;
using System.Text;
using System.Globalization;
using System.Threading;

using static System.Math;

namespace FertiLib.Contest.D
{
	public class Solver
	{
		Scanner sr;
		StreamWriter sw;

		bool isMultipleTestCases = false;

		public void Solve()
		{
			var (n, m, k) = sr.ReadValue<int, long, long>();
			var surplus = m - n * (n + 1L) / 2;
			var ans = new long[n];
			var level = LevelSearch(k);
			ans[n - 1 - level] = n + surplus;
			var left = k - (level * (level - 1L) / 2 + (level > 0 ? 1 : 0));
			for (int i = 0; i < n - 1 - level; i++)
			{
				ans[i] = i + 1;
			}
			if (level > 0)
			{
				ans[n - 1 - level + 1 + left] = n - level;
			}
			var cur = n - level + 1;
			for (int i = n - 1; i >= 0; i--)
			{
				if (cur >= n) break;
				if (ans[i] == 0)
				{
					ans[i] = cur++;
				}
			}
			if (ans.Sum() != m)
			{
				//throw new Exception();
			}
			if (Inversion(ans) != k)
			{
				throw new Exception();
			}
			Console.WriteLine(ans.Join("\n"));
		}

		public long Inversion(long[] a)
		{
			var ret = 0L;
			var set = new Set<long>();
			for (int i = 0; i < a.Length; i++)
			{
				if (i > 0) ret += set.Count - set.UpperBound(a[i]);
				set.Add(a[i]);
			}
			return ret;
		}

		public int LevelSearch(long k)
		{
			var ok = 100005L;
			var ng = -1L;
			while (ok - ng > 1)
			{
				var mid = ng + (ok - ng) / 2;
				if (mid * (mid + 1) / 2 >= k) ok = mid;
				else ng = mid;
			}
			return (int)ok;
		}

		public Solver(Scanner cin, StreamWriter cout)
		{
			this.sr = cin;
			this.sw = cout;
		}

		public void Start()
		{
			int _t = 1;
			if (isMultipleTestCases) _t = sr.ReadInt();
			while (_t-- > 0) Solve();
		}

		public static void YESNO(bool condition) => Console.WriteLine(condition ? "YES" : "NO");
		public static void YesNo(bool condition) => Console.WriteLine(condition ? "Yes" : "No");
		public static void yesno(bool condition) => Console.WriteLine(condition ? "yes" : "no");

		public static T SignOutput<T>(int x, T pos, T zero, T neg) => x == 0 ? zero : (x > 0 ? pos : neg);

		public static T[] CreateArray<T>(int n, Func<int, T> func) => Enumerable.Range(0, n).Select(p => func(p)).ToArray();
		public static T[][] CreateArray<T>(int h, int w, Func<int, int, T> func) => Enumerable.Range(0, h).Select(i => Enumerable.Range(0, w).Select(j => func(i, j)).ToArray()).ToArray();
	}

	public class Set<T> : IEnumerable<T> where T : IComparable<T>
	{
		Node root;
		readonly IComparer<T> comparer;
		readonly Node nil;
		public bool IsMultiSet { get; set; }

		public Set() : this(Comparer<T>.Default) { }
		public Set(IComparer<T> comparer)
		{
			nil = new Node(default);
			root = nil;
			this.comparer = comparer;
		}
		public Set(Comparison<T> comparison) : this(Comparer<T>.Create(comparison)) { }

		public T this[int index]
		{
			get
			{
				if (index < 0 || root.Count < index) throw new ArgumentOutOfRangeException();
				return Find(root, index);
			}
		}

		public bool Add(T x) => Insert(ref root, x);
		public bool Remove(T x) => Erase(ref root, x);
		public void RemoveAt(int index)
		{
			if (index < 0 || Count < index) throw new ArgumentOutOfRangeException();
			EraseAt(ref root, index);
		}
		public bool Contains(T x) => this.Count == 0 ? false : EqualRange(x) > 0;
		public int LowerBound(T x) => BinarySearch(root, x, false);
		public int UpperBound(T x) => BinarySearch(root, x, true);
		public int EqualRange(T x) => UpperBound(x) - LowerBound(x);

		public void Clear() => root = nil;

		public T Min() => root.Min.Value;
		public T Max() => root.Max.Value;

		public T[] Items
		{
			get
			{
				var a = new T[root.Count];
				var k = 0;
				Walk(root, a, ref k);
				return a;
			}
		}
		public int Count => root.Count;
		public int Height => root.Height;

		public IEnumerator<T> GetEnumerator() { return Items.AsEnumerable().GetEnumerator(); }
		System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator() => GetEnumerator();

		bool Insert(ref Node p, T x)
		{
			if (p.Count == 0)
			{
				p = new Node(x);
				p.Left = p.Right = nil;
				p.Update();
				return true;
			}
			bool ret;
			var t = comparer.Compare(p.Value, x);
			if (t > 0)
			{
				ret = Insert(ref p.Left, x);
			}
			else if (t < 0)
			{
				ret = Insert(ref p.Right, x);
			}
			else
			{
				if (IsMultiSet == true) ret = Insert(ref p.Left, x);
				else return false;
			}
			Balance(ref p);
			return ret;
		}

		bool Erase(ref Node p, T x)
		{
			if (p.Count == 0) return false;
			var t = comparer.Compare(p.Value, x);
			bool ret;
			if (t < 0) ret = Erase(ref p.Right, x);
			else if (t > 0) ret = Erase(ref p.Left, x);
			else
			{
				ret = true;
				if (p.Right.Count == 0) { p = p.Left; return true; }
				if (p.Left.Count == 0) { p = p.Right; return true; }

				p.Value = p.Left.Max.Value;
				Erase(ref p.Left, p.Left.Max.Value);
			}
			Balance(ref p);

			return ret;
		}

		void EraseAt(ref Node p, int index)
		{
			var count = p.Left.Count;
			if (index < count) EraseAt(ref p.Left, index);
			else if (index > count) EraseAt(ref p.Right, index - count - 1);
			else
			{
				if (p.Left.Count == 0) { p = p.Right; return; }
				if (p.Right.Count == 0) { p = p.Left; return; }

				p.Value = p.Left.Max.Value;
				EraseAt(ref p.Left, index - 1);
			}

			Balance(ref p);
		}

		void Walk(Node t, T[] a, ref int k)
		{
			if (t.Count == 0) return;
			Walk(t.Left, a, ref k);
			a[k++] = t.Value;
			Walk(t.Right, a, ref k);
		}

		void Balance(ref Node p)
		{
			var balance = p.Left.Height - p.Right.Height;
			if (balance < -1)
			{
				if (p.Right.Left.Height - p.Right.Right.Height > 0) RotateR(ref p.Right);
				RotateL(ref p);
			}
			else if (balance > 1)
			{
				if (p.Left.Left.Height - p.Left.Right.Height < 0) RotateL(ref p.Left);
				RotateR(ref p);
			}
			else p.Update();
		}

		T Find(Node p, int index)
		{
			if (index < p.Left.Count) return Find(p.Left, index);
			if (index > p.Left.Count) return Find(p.Right, index - p.Left.Count - 1);
			return p.Value;
		}

		void RotateL(ref Node p)
		{
			var r = p.Right;
			p.Right = r.Left;
			r.Left = p;
			p.Update();
			r.Update();
			p = r;
		}

		void RotateR(ref Node p)
		{
			var l = p.Left;
			p.Left = l.Right;
			l.Right = p;
			p.Update();
			l.Update();
			p = l;
		}

		int BinarySearch(Node p, T x, bool isUpperBound)
		{
			if (p.Count == 0) throw new NullReferenceException();

			var node = p;

			var ret = 0;

			while (p.Count != 0)
			{
				var cmp = p.Value.CompareTo(x);
				if (cmp > 0 || (!isUpperBound && cmp == 0))
				{
					p = p.Left;
				}
				else
				{
					ret += p.Left.Count + 1;
					p = p.Right;
				}
			}

			return ret;
		}

		public override string ToString()
		{
			return string.Join(", ", Items);
		}

		class Node
		{
			public Node Left, Right;
			public T Value { get; set; }

			public int Count { get; private set; }
			public int Height { get; private set; }

			public Node Min
			{
				get
				{
					if (Left.Count == 0) return this;
					else return Left.Min;
				}
			}

			public Node Max
			{
				get
				{
					if (Right.Count == 0) return this;
					else return Right.Max;
				}
			}

			public Node(T value) => Value = value;

			public void Update()
			{
				Count = Left.Count + Right.Count + 1;
				Height = Math.Max(Left.Height, Right.Height) + 1;
			}

			public override string ToString() => $"Count = {Count}, Value = {Value}";
		}
	}

	public static class Program
	{
		public static void Main(string[] args)
		{
			var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
			Console.SetOut(sw);
			var cin = new Scanner();
			var solver = new Solver(cin, sw);
			solver.Start();
			Console.Out.Flush();
		}
	}

	public static class Extention
	{
		public static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);

		public static int UpperBound<T>(this IList<T> list, T value) => list.BinarySearch(value, true, 0, list.Count, Comparer<T>.Default);
		public static int LowerBound<T>(this IList<T> list, T value) => list.BinarySearch(value, false, 0, list.Count, Comparer<T>.Default);
		public static int BinarySearch<T>(this IList<T> list, T value, bool isUpperBound, int index, int length, Comparer<T> comparer)
		{
			var ng = index - 1;
			var ok = index + length;
			while (ok - ng > 1)
			{
				var mid = ng + (ok - ng) / 2;
				var res = comparer.Compare(list[mid], value);
				if (res < 0 || (isUpperBound && res == 0)) ng = mid;
				else ok = mid;
			}
			return ok;
		}

		public static bool Chmax<T>(ref this T a, T b) where T : struct, IComparable<T>
		{
			if (a.CompareTo(b) >= 0) return false;
			a = b;
			return true;
		}
		public static bool Chmin<T>(ref this T a, T b) where T : struct, IComparable<T>
		{
			if (a.CompareTo(b) <= 0) return false;
			a = b;
			return true;
		}
	}

	public class Scanner
	{
		string[] s;
		int i;

		char[] separator = new char[] { ' ' };

		public Scanner()
		{
			s = new string[0];
			i = 0;
		}

		public string Read() => ReadString();

		public string ReadString()
		{
			if (i < s.Length) return s[i++];
			string st = Console.ReadLine();
			while (st == "") st = Console.ReadLine();
			s = st.Split(separator, StringSplitOptions.RemoveEmptyEntries);
			if (s.Length == 0) return ReadString();
			i = 0;
			return s[i++];
		}

		public string[] ReadStringArray(int N)
		{
			string[] Array = new string[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = ReadString();
			}
			return Array;
		}

		public int ReadInt() => int.Parse(ReadString());

		public int[] ReadIntArray(int N, int add = 0)
		{
			int[] Array = new int[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = ReadInt() + add;
			}
			return Array;
		}

		public long ReadLong() => long.Parse(ReadString());

		public long[] ReadLongArray(int N, long add = 0)
		{
			long[] Array = new long[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = ReadLong() + add;
			}
			return Array;
		}

		public double ReadDouble() => double.Parse(ReadString());

		public double[] ReadDoubleArray(int N, double add = 0)
		{
			double[] Array = new double[N];
			for (int i = 0; i < N; i++)
			{
				Array[i] = ReadDouble() + add;
			}
			return Array;
		}

		public T1 ReadValue<T1>() => (T1)Convert.ChangeType(ReadString(), typeof(T1));

		public (T1, T2) ReadValue<T1, T2>()
		{
			var inputs = ReadStringArray(2);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			return (v1, v2);
		}

		public (T1, T2, T3) ReadValue<T1, T2, T3>()
		{
			var inputs = ReadStringArray(3);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
			return (v1, v2, v3);
		}

		public (T1, T2, T3, T4) ReadValue<T1, T2, T3, T4>()
		{
			var inputs = ReadStringArray(4);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
			var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
			return (v1, v2, v3, v4);
		}

		public (T1, T2, T3, T4, T5) ReadValue<T1, T2, T3, T4, T5>()
		{
			var inputs = ReadStringArray(5);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
			var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
			var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
			return (v1, v2, v3, v4, v5);
		}

		public (T1, T2, T3, T4, T5, T6) ReadValue<T1, T2, T3, T4, T5, T6>()
		{
			var inputs = ReadStringArray(6);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
			var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
			var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
			var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6));
			return (v1, v2, v3, v4, v5, v6);
		}

		public (T1, T2, T3, T4, T5, T6, T7) ReadValue<T1, T2, T3, T4, T5, T6, T7>()
		{
			var inputs = ReadStringArray(7);
			var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
			var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
			var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
			var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
			var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
			var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6));
			var v7 = (T7)Convert.ChangeType(inputs[6], typeof(T7));
			return (v1, v2, v3, v4, v5, v6, v7);
		}

		public T1[] ReadValueArray<T1>(int N)
		{
			var v1 = new T1[N];
			for (int i = 0; i < N; i++)
			{
				v1[i] = ReadValue<T1>();
			}
			return v1;
		}

		public (T1[], T2[]) ReadValueArray<T1, T2>(int N)
		{
			var (v1, v2) = (new T1[N], new T2[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2) = ReadValue<T1, T2>();
				v1[i] = t1;
				v2[i] = t2;
			}
			return (v1, v2);
		}

		public (T1[], T2[], T3[]) ReadValueArray<T1, T2, T3>(int N)
		{
			var (v1, v2, v3) = (new T1[N], new T2[N], new T3[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2, t3) = ReadValue<T1, T2, T3>();
				v1[i] = t1;
				v2[i] = t2;
				v3[i] = t3;
			}
			return (v1, v2, v3);
		}

		public (T1[], T2[], T3[], T4[]) ReadValueArray<T1, T2, T3, T4>(int N)
		{
			var (v1, v2, v3, v4) = (new T1[N], new T2[N], new T3[N], new T4[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2, t3, t4) = ReadValue<T1, T2, T3, T4>();
				v1[i] = t1;
				v2[i] = t2;
				v3[i] = t3;
				v4[i] = t4;
			}
			return (v1, v2, v3, v4);
		}

		public (T1[], T2[], T3[], T4[], T5[]) ReadValueArray<T1, T2, T3, T4, T5>(int N)
		{
			var (v1, v2, v3, v4, v5) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2, t3, t4, t5) = ReadValue<T1, T2, T3, T4, T5>();
				v1[i] = t1;
				v2[i] = t2;
				v3[i] = t3;
				v4[i] = t4;
				v5[i] = t5;
			}
			return (v1, v2, v3, v4, v5);
		}

		public (T1[], T2[], T3[], T4[], T5[], T6[]) ReadValueArray<T1, T2, T3, T4, T5, T6>(int N)
		{
			var (v1, v2, v3, v4, v5, v6) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N], new T6[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2, t3, t4, t5, t6) = ReadValue<T1, T2, T3, T4, T5, T6>();
				v1[i] = t1;
				v2[i] = t2;
				v3[i] = t3;
				v4[i] = t4;
				v5[i] = t5;
				v6[i] = t6;
			}
			return (v1, v2, v3, v4, v5, v6);
		}

		public (T1[], T2[], T3[], T4[], T5[], T6[], T7[]) ReadValueArray<T1, T2, T3, T4, T5, T6, T7>(int N)
		{
			var (v1, v2, v3, v4, v5, v6, v7) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N], new T6[N], new T7[N]);
			for (int i = 0; i < N; i++)
			{
				var (t1, t2, t3, t4, t5, t6, t7) = ReadValue<T1, T2, T3, T4, T5, T6, T7>();
				v1[i] = t1;
				v2[i] = t2;
				v3[i] = t3;
				v4[i] = t4;
				v5[i] = t5;
				v6[i] = t6;
				v7[i] = t7;
			}
			return (v1, v2, v3, v4, v5, v6, v7);
		}
	}
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード