結果

問題 No.1170 Never Want to Walk
ユーザー ひばちひばち
提出日時 2020-08-15 23:39:14
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 201 ms / 2,000 ms
コード長 6,960 bytes
コンパイル時間 1,198 ms
コンパイル使用メモリ 120,160 KB
実行使用メモリ 44,288 KB
最終ジャッジ日時 2024-10-11 03:38:58
合計ジャッジ時間 7,404 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 30 ms
19,456 KB
testcase_01 AC 30 ms
19,200 KB
testcase_02 AC 30 ms
19,328 KB
testcase_03 AC 31 ms
19,200 KB
testcase_04 AC 30 ms
19,456 KB
testcase_05 AC 31 ms
19,456 KB
testcase_06 AC 31 ms
19,200 KB
testcase_07 AC 31 ms
19,456 KB
testcase_08 AC 30 ms
19,328 KB
testcase_09 AC 29 ms
19,456 KB
testcase_10 AC 30 ms
19,456 KB
testcase_11 AC 29 ms
19,072 KB
testcase_12 AC 34 ms
19,456 KB
testcase_13 AC 35 ms
19,840 KB
testcase_14 AC 35 ms
19,456 KB
testcase_15 AC 35 ms
19,712 KB
testcase_16 AC 34 ms
19,584 KB
testcase_17 AC 36 ms
19,968 KB
testcase_18 AC 35 ms
20,096 KB
testcase_19 AC 35 ms
19,840 KB
testcase_20 AC 33 ms
19,712 KB
testcase_21 AC 34 ms
19,712 KB
testcase_22 AC 36 ms
20,096 KB
testcase_23 AC 35 ms
19,712 KB
testcase_24 AC 37 ms
19,840 KB
testcase_25 AC 35 ms
19,456 KB
testcase_26 AC 36 ms
19,968 KB
testcase_27 AC 193 ms
43,392 KB
testcase_28 AC 189 ms
43,008 KB
testcase_29 AC 191 ms
43,904 KB
testcase_30 AC 191 ms
43,520 KB
testcase_31 AC 190 ms
43,520 KB
testcase_32 AC 195 ms
43,264 KB
testcase_33 AC 196 ms
43,264 KB
testcase_34 AC 196 ms
44,032 KB
testcase_35 AC 194 ms
43,648 KB
testcase_36 AC 191 ms
43,136 KB
testcase_37 AC 189 ms
43,392 KB
testcase_38 AC 201 ms
44,288 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using SC = Scanner;

class Solver
{
    public SC sc = new SC();
    public void Solve()
    {
        int N, A, B;
        sc.Make(out N, out A, out B);
        var X = sc.ArrInt;
        var uf = new UnionFind(N);
        int r = 0, rr = 0;
        for (int i = 0; i < N; i++)
        {
            while (r < N && X[r] - X[i] < A) r++;
            while (rr < N && X[rr] - X[i] <= B) rr++;
            if (r < rr)
            {
                uf.RangeUnion(r, rr - 1);
                uf.Union(i, r);
            }
        }
        for (int i = 0; i < N; i++)
        {
            Console.WriteLine(uf.Size(i));
        }
    }

}

public class UnionFind
{
    public int GroupCount { get; private set; }
    protected int[] data;
    int[] lft, rgt;
    public virtual int this[int i] => Find(i);
    public UnionFind(int size)
    {
        data = Create(size, () => -1);
        lft = Create(size, id => id);
        rgt = Create(size, id => id);
        GroupCount = size;
    }
    protected int Find(int i) => data[i] < 0 ? i : (data[i] = Find(data[i]));
    public int Size(int i) => -data[Find(i)];
    public virtual bool Union(int u, int v)
    {
        u = Find(u); v = Find(v);
        if (u == v) return false;
        if (data[u] > data[v]) swap(ref u, ref v);
        GroupCount--;
        chmin(ref lft[u], lft[v]);
        chmax(ref rgt[u], rgt[v]);
        data[u] += data[v];
        data[v] = u;
        return true;
    }
    public int Left(int i) => lft[Find(i)];
    public int Right(int i) => rgt[Find(i)];
    public void RangeUnion(int l, int r)
    {
        if (r <= l) return;
        while (Right(l) < r)
        {
            Union(l, Right(l)+1);
        }
    }
}
#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        var sol = new Solver();
        //var th = new Thread(sol.Solve, 1 << 26);th.Start();th.Join();
        sol.Solve();
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) > 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static void Out<T>(this IList<T> A, out T a) => a = A[0];
    public static void Out<T>(this IList<T> A, out T a, out T b) { a = A[0]; b = A[1]; }
    public static void Out<T>(this IList<T> A, out T a, out T b, out T c) { A.Out(out a, out b); c = A[2]; }
    public static void Out<T>(this IList<T> A, out T a, out T b, out T c, out T d) { A.Out(out a, out b, out c); d = A[3]; }
    public static string Concat<T>(this IEnumerable<T> A, string sp) => string.Join(sp, A);
    public static char ToChar(this int s, char begin = '0') => (char)(s + begin);
    public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> A) => A.OrderBy(v => Guid.NewGuid());
    public static int CompareTo<T>(this T[] A, T[] B, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; for (var i = 0; i < Min(A.Length, B.Length); i++) { int c = cmp(A[i], B[i]); if (c > 0) return 1; else if (c < 0) return -1; } if (A.Length == B.Length) return 0; if (A.Length > B.Length) return 1; else return -1; }
    public static int ArgMax<T>(this IList<T> A, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; T max = A[0]; int rt = 0; for (int i = 1; i < A.Count; i++) if (cmp(max, A[i]) < 0) { max = A[i]; rt = i; } return rt; }
    public static T PopBack<T>(this List<T> A) { var v = A[A.Count - 1]; A.RemoveAt(A.Count - 1); return v; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    public void Make<T1, T2, T3, T4, T5, T6, T7>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6, out T7 v7) { Make(out v1, out v2, out v3, out v4, out v5, out v6); v7 = Next<T7>(); }
    public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}

#endregion
0