結果
問題 | No.1170 Never Want to Walk |
ユーザー | terry_u16 |
提出日時 | 2020-08-14 22:05:14 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 304 ms / 2,000 ms |
コード長 | 14,939 bytes |
コンパイル時間 | 2,953 ms |
コンパイル使用メモリ | 123,752 KB |
実行使用メモリ | 57,880 KB |
最終ジャッジ日時 | 2024-10-10 15:20:28 |
合計ジャッジ時間 | 9,293 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
25,788 KB |
testcase_01 | AC | 37 ms
25,392 KB |
testcase_02 | AC | 36 ms
25,400 KB |
testcase_03 | AC | 36 ms
25,400 KB |
testcase_04 | AC | 36 ms
25,396 KB |
testcase_05 | AC | 35 ms
25,472 KB |
testcase_06 | AC | 36 ms
27,596 KB |
testcase_07 | AC | 35 ms
23,604 KB |
testcase_08 | AC | 35 ms
23,352 KB |
testcase_09 | AC | 36 ms
25,392 KB |
testcase_10 | AC | 35 ms
25,260 KB |
testcase_11 | AC | 35 ms
25,220 KB |
testcase_12 | AC | 41 ms
27,692 KB |
testcase_13 | AC | 42 ms
23,864 KB |
testcase_14 | AC | 41 ms
25,728 KB |
testcase_15 | AC | 41 ms
23,736 KB |
testcase_16 | AC | 42 ms
25,600 KB |
testcase_17 | AC | 41 ms
25,904 KB |
testcase_18 | AC | 42 ms
26,036 KB |
testcase_19 | AC | 41 ms
25,900 KB |
testcase_20 | AC | 42 ms
27,820 KB |
testcase_21 | AC | 41 ms
25,600 KB |
testcase_22 | AC | 41 ms
25,724 KB |
testcase_23 | AC | 41 ms
25,860 KB |
testcase_24 | AC | 42 ms
25,724 KB |
testcase_25 | AC | 42 ms
25,596 KB |
testcase_26 | AC | 41 ms
25,724 KB |
testcase_27 | AC | 293 ms
57,480 KB |
testcase_28 | AC | 287 ms
57,128 KB |
testcase_29 | AC | 295 ms
57,676 KB |
testcase_30 | AC | 290 ms
57,644 KB |
testcase_31 | AC | 290 ms
55,252 KB |
testcase_32 | AC | 290 ms
55,388 KB |
testcase_33 | AC | 300 ms
55,152 KB |
testcase_34 | AC | 297 ms
57,880 KB |
testcase_35 | AC | 299 ms
57,688 KB |
testcase_36 | AC | 291 ms
55,188 KB |
testcase_37 | AC | 299 ms
52,984 KB |
testcase_38 | AC | 304 ms
56,004 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Collections.Generic; using System.IO; using System.Linq; using System.Text; using System.Runtime.CompilerServices; using System.Runtime.InteropServices; using YukicoderContest261.Extensions; using YukicoderContest261.Questions; namespace YukicoderContest261.Questions { public class QuestionC : AtCoderQuestionBase { public override IEnumerable<object> Solve(TextReader inputStream) { var (n, nearLimit, farLimit) = inputStream.ReadValue<int, int, int>(); var x = inputStream.ReadIntArray(); var unionFind = new UnionFindTree(n); for (int i = 0; i < x.Length; i++) { var near = SearchExtensions.GetGreaterEqualIndex(x, x[i] + nearLimit); var far = SearchExtensions.GetLessEqualIndex(x, x[i] + farLimit); for (int j = far; j >= near; j--) { if (unionFind.IsInSameGroup(i, j)) { break; } else { unionFind.Unite(i, j); } } } for (int i = 0; i < n; i++) { yield return unionFind.GetGroupSizeOf(i); } } // See https://kumikomiya.com/competitive-programming-with-c-sharp/ public class UnionFindTree { private UnionFindNode[] _nodes; public int Count => _nodes.Length; public int Groups { get; private set; } public UnionFindTree(int count) { _nodes = Enumerable.Range(0, count).Select(i => new UnionFindNode(i)).ToArray(); Groups = _nodes.Length; } public int this[Index index] { get => _nodes[index].ID; } public void Unite(int index1, int index2) { var succeed = _nodes[index1].Unite(_nodes[index2]); if (succeed) { Groups--; } } public bool IsInSameGroup(int index1, int index2) => _nodes[index1].IsInSameGroup(_nodes[index2]); public int GetGroupSizeOf(int index) => _nodes[index].GetGroupSize(); private class UnionFindNode { private int _height; // rootのときのみ有効 private int _groupSize; // 同上 private UnionFindNode _parent; public int ID { get; } public UnionFindNode(int id) { _height = 0; _groupSize = 1; _parent = this; ID = id; } public UnionFindNode FindRoot() { if (_parent != this) // not ref equals { var root = _parent.FindRoot(); _parent = root; } return _parent; } public int GetGroupSize() => FindRoot()._groupSize; public bool Unite(UnionFindNode other) { var thisRoot = this.FindRoot(); var otherRoot = other.FindRoot(); if (thisRoot == otherRoot) { return false; } if (thisRoot._height < otherRoot._height) { thisRoot._parent = otherRoot; otherRoot._groupSize += thisRoot._groupSize; otherRoot._height = Math.Max(thisRoot._height + 1, otherRoot._height); return true; } else { otherRoot._parent = thisRoot; thisRoot._groupSize += otherRoot._groupSize; thisRoot._height = Math.Max(otherRoot._height + 1, thisRoot._height); return true; } } public bool IsInSameGroup(UnionFindNode other) => this.FindRoot() == other.FindRoot(); public override string ToString() => $"{ID} root:{FindRoot().ID}"; } } } } namespace YukicoderContest261 { class Program { static void Main(string[] args) { IAtCoderQuestion question = new QuestionC(); var answers = question.Solve(Console.In); var writer = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; Console.SetOut(writer); foreach (var answer in answers) { Console.WriteLine(answer); } Console.Out.Flush(); } } public static class SearchExtensions { class LowerBoundComparer<T> : IComparer<T> where T : IComparable<T> { public int Compare(T x, T y) => 0 <= x.CompareTo(y) ? 1 : -1; } class UpperBoundComparer<T> : IComparer<T> where T : IComparable<T> { public int Compare(T x, T y) => 0 < x.CompareTo(y) ? 1 : -1; } // https://trsing.hatenablog.com/entry/2019/08/27/211038 public static int GetGreaterEqualIndex<T>(this ReadOnlySpan<T> span, T inclusiveMin) where T : IComparable<T> => ~span.BinarySearch(inclusiveMin, new UpperBoundComparer<T>()); public static int GetGreaterThanIndex<T>(this ReadOnlySpan<T> span, T exclusiveMin) where T : IComparable<T> => ~span.BinarySearch(exclusiveMin, new LowerBoundComparer<T>()); public static int GetLessEqualIndex<T>(this ReadOnlySpan<T> span, T inclusiveMax) where T : IComparable<T> => ~span.BinarySearch(inclusiveMax, new LowerBoundComparer<T>()) - 1; public static int GetLessThanIndex<T>(this ReadOnlySpan<T> span, T exclusiveMax) where T : IComparable<T> => ~span.BinarySearch(exclusiveMax, new UpperBoundComparer<T>()) - 1; public static int GetGreaterEqualIndex<T>(this Span<T> span, T inclusiveMin) where T : IComparable<T> => ((ReadOnlySpan<T>)span).GetGreaterEqualIndex(inclusiveMin); public static int GetGreaterThanIndex<T>(this Span<T> span, T exclusiveMin) where T : IComparable<T> => ((ReadOnlySpan<T>)span).GetGreaterThanIndex(exclusiveMin); public static int GetLessEqualIndex<T>(this Span<T> span, T inclusiveMax) where T : IComparable<T> => ((ReadOnlySpan<T>)span).GetLessEqualIndex(inclusiveMax); public static int GetLessThanIndex<T>(this Span<T> span, T exclusiveMax) where T : IComparable<T> => ((ReadOnlySpan<T>)span).GetLessThanIndex(exclusiveMax); public static int BoundaryBinarySearch(Predicate<int> predicate, int ok, int ng) { // めぐる式二分探索 while (Math.Abs(ok - ng) > 1) { int mid = (ok + ng) / 2; if (predicate(mid)) { ok = mid; } else { ng = mid; } } return ok; } public static long BoundaryBinarySearch(Predicate<long> predicate, long ok, long ng) { while (Math.Abs(ok - ng) > 1) { long mid = (ok + ng) / 2; if (predicate(mid)) { ok = mid; } else { ng = mid; } } return ok; } public static double Bisection(Func<double, double> f, double a, double b, double eps = 1e-9) { if (f(a) * f(b) >= 0) { throw new ArgumentException("f(a)とf(b)は異符号である必要があります。"); } const int maxLoop = 100; double mid = (a + b) / 2; for (int i = 0; i < maxLoop; i++) { if (f(a) * f(mid) < 0) { b = mid; } else { a = mid; } mid = (a + b) / 2; if (Math.Abs(b - a) < eps) { break; } } return mid; } } } #region Base Class namespace YukicoderContest261.Questions { public interface IAtCoderQuestion { IEnumerable<object> Solve(string input); IEnumerable<object> Solve(TextReader inputStream); } public abstract class AtCoderQuestionBase : IAtCoderQuestion { public IEnumerable<object> Solve(string input) { var stream = new MemoryStream(Encoding.Unicode.GetBytes(input)); var reader = new StreamReader(stream, Encoding.Unicode); return Solve(reader); } public abstract IEnumerable<object> Solve(TextReader inputStream); } } #endregion #region Extensions namespace YukicoderContest261.Extensions { public static class StringExtensions { public static string Join<T>(this IEnumerable<T> source) => string.Concat(source); public static string Join<T>(this IEnumerable<T> source, char separator) => string.Join(separator, source); public static string Join<T>(this IEnumerable<T> source, string separator) => string.Join(separator, source); } public static class TextReaderExtensions { public static int ReadInt(this TextReader reader) => int.Parse(ReadString(reader)); public static long ReadLong(this TextReader reader) => long.Parse(ReadString(reader)); public static double ReadDouble(this TextReader reader) => double.Parse(ReadString(reader)); public static string ReadString(this TextReader reader) => reader.ReadLine(); public static int[] ReadIntArray(this TextReader reader, char separator = ' ') => ReadStringArray(reader, separator).Select(int.Parse).ToArray(); public static long[] ReadLongArray(this TextReader reader, char separator = ' ') => ReadStringArray(reader, separator).Select(long.Parse).ToArray(); public static double[] ReadDoubleArray(this TextReader reader, char separator = ' ') => ReadStringArray(reader, separator).Select(double.Parse).ToArray(); public static string[] ReadStringArray(this TextReader reader, char separator = ' ') => reader.ReadLine().Split(separator); // Supports primitive type only. public static T1 ReadValue<T1>(this TextReader reader) => (T1)Convert.ChangeType(reader.ReadLine(), typeof(T1)); public static (T1, T2) ReadValue<T1, T2>(this TextReader reader, char separator = ' ') { var inputs = ReadStringArray(reader, separator); var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1)); var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2)); return (v1, v2); } public static (T1, T2, T3) ReadValue<T1, T2, T3>(this TextReader reader, char separator = ' ') { var inputs = ReadStringArray(reader, separator); 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 static (T1, T2, T3, T4) ReadValue<T1, T2, T3, T4>(this TextReader reader, char separator = ' ') { var inputs = ReadStringArray(reader, separator); 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 static (T1, T2, T3, T4, T5) ReadValue<T1, T2, T3, T4, T5>(this TextReader reader, char separator = ' ') { var inputs = ReadStringArray(reader, separator); 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 static (T1, T2, T3, T4, T5, T6) ReadValue<T1, T2, T3, T4, T5, T6>(this TextReader reader, char separator = ' ') { var inputs = ReadStringArray(reader, separator); 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 static (T1, T2, T3, T4, T5, T6, T7) ReadValue<T1, T2, T3, T4, T5, T6, T7>(this TextReader reader, char separator = ' ') { var inputs = ReadStringArray(reader, separator); 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 static (T1, T2, T3, T4, T5, T6, T7, T8) ReadValue<T1, T2, T3, T4, T5, T6, T7, T8>(this TextReader reader, char separator = ' ') { var inputs = ReadStringArray(reader, separator); 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)); var v8 = (T8)Convert.ChangeType(inputs[7], typeof(T8)); return (v1, v2, v3, v4, v5, v6, v7, v8); } } } #endregion