結果

問題 No.945 YKC饅頭
コンテスト
ユーザー EmKjp
提出日時 2019-12-11 23:09:34
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 267 ms / 2,000 ms
コード長 6,831 bytes
コンパイル時間 958 ms
コンパイル使用メモリ 118,016 KB
実行使用メモリ 42,836 KB
最終ジャッジ日時 2024-06-24 08:07:00
合計ジャッジ時間 10,302 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 74
権限があれば一括ダウンロードができます
コンパイルメッセージ
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;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    class Query {
        public int Left, Right, Id;
        public int Kind;
    }

    int ToIndex(string s) {
        if (s == "Y") return 0;
        if (s == "K") return 1;
        if (s == "C") return 2;
        throw new NotSupportedException();
    }

    public void Run() {
        var N = ni();
        var M = ni();

        var Q = new Query[M];

        for (int i = 0; i < M; i++) {
            var query = new Query {
                Id = i,
                Left = ni() - 1,
                Right = ni() - 1,
                Kind = ToIndex(ns()),
            };
            Q[i] = query;
        }

        var removed = new bool[N];
        var ans = new int[3];
        var d = new DisjointSet(N);

        foreach (var q in Q) {
            var current = q.Left;
            while (current <= q.Right) {
                if (removed[current]) {
                    current = d.right[d.Root(current)] + 1;
                } else {
                    ans[q.Kind]++;
                    removed[current] = true;
                    if (current - 1 >= 0 && removed[current - 1]) {
                        d.Unite(current - 1, current);
                    }
                    if (current + 1 < N && removed[current + 1]) {
                        d.Unite(current + 1, current);
                    }
                }
            }
        }

        cout.WriteLine(string.Join(" ", ans));
    }

}


public class DisjointSet {
    private readonly long[] group;
    public readonly int[] left;
    public readonly int[] right;
    public int GroupCount { get; private set; }
    public DisjointSet(int n, int[] size = null) {
        group = new long[n];
        left = new int[n];
        right = new int[n];
        Clear(size);
        GroupCount = n;
    }
    public bool Unite(int x, int y) {
        x = Root(x); y = Root(y);
        if (x == y) {
            return false;
        }

        if (group[y] < group[x]) {
            return Unite(y, x);
        }
        left[x] = Math.Min(left[x], left[y]);
        right[x] = Math.Max(right[x], right[y]);
        group[x] += group[y];
        group[y] = x;
        GroupCount--;
        return true;
    }
    public bool IsSameSet(int x, int y) { return Root(x) == Root(y); }
    public int Root(int x) { return group[x] < 0 ? x : (int)(group[x] = Root((int)group[x])); }
    public long Size(int x) { return -group[Root(x)]; }
    public void Clear(int[] size = null) {
        for (int i = 0; i < group.Length; i++) {
            group[i] = -(size == null ? 1 : size[i]);
            left[i] = i;
            right[i] = i;
        }
    }
};
// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    public static T Dump<T>(this T obj) {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ', '\t' };
    private bool StockTokens() {
        while (true) {
            string line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            string[] tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (string token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}
0