結果

問題 No.1328 alligachi-problem
ユーザー EmKjpEmKjp
提出日時 2020-12-25 02:07:47
言語 C#(csc)
(csc 3.9.0)
結果
TLE  
実行時間 -
コード長 8,263 bytes
コンパイル時間 1,072 ms
コンパイル使用メモリ 118,260 KB
実行使用メモリ 120,180 KB
最終ジャッジ日時 2024-09-21 17:26:39
合計ジャッジ時間 17,551 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 33 ms
31,368 KB
testcase_01 AC 29 ms
25,520 KB
testcase_02 AC 31 ms
26,340 KB
testcase_03 AC 32 ms
24,116 KB
testcase_04 AC 36 ms
28,024 KB
testcase_05 AC 36 ms
26,240 KB
testcase_06 AC 32 ms
25,988 KB
testcase_07 AC 33 ms
26,252 KB
testcase_08 AC 31 ms
25,740 KB
testcase_09 AC 620 ms
120,024 KB
testcase_10 AC 481 ms
108,892 KB
testcase_11 AC 617 ms
118,112 KB
testcase_12 AC 606 ms
118,228 KB
testcase_13 AC 620 ms
120,044 KB
testcase_14 AC 615 ms
118,228 KB
testcase_15 AC 491 ms
111,068 KB
testcase_16 AC 622 ms
120,180 KB
testcase_17 AC 618 ms
120,032 KB
testcase_18 AC 619 ms
120,152 KB
testcase_19 AC 624 ms
112,420 KB
testcase_20 AC 640 ms
112,136 KB
testcase_21 AC 641 ms
112,532 KB
testcase_22 AC 634 ms
112,292 KB
testcase_23 AC 491 ms
103,052 KB
testcase_24 AC 565 ms
112,300 KB
testcase_25 AC 559 ms
112,404 KB
testcase_26 TLE -
testcase_27 -- -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;
using System.Threading;

internal partial class Solver {
    public static void Shuffle<T>(Random random, IList<T> array) {
        for (int i = 1; i < array.Count; i++) {
            int r = random.Next(i + 1);
            var t = array[i];
            array[i] = array[r];
            array[r] = t;
        }
    }
    public void Run() {
        var n = ni();
        var c = new char[n];
        var x = new char[n];
        var y = new int[n];
        var rre = Enumerable.Range(0, n + 1).Select(_ => new HashSet<int>()).ToArray();
        var rbe = Enumerable.Range(0, n + 1).Select(_ => new HashSet<int>()).ToArray();
        var bbe = Enumerable.Range(0, n + 1).Select(_ => new HashSet<int>()).ToArray();
        var bre = Enumerable.Range(0, n + 1).Select(_ => new HashSet<int>()).ToArray();
        for (int i = 0; i < n; i++) {
            c[i] = ns()[0];
            x[i] = ns()[0];
            y[i] = ni();
            if (x[i] == 'R' && c[i] == 'R') rre[y[i]].Add(i);
            if (x[i] == 'R' && c[i] == 'B') rbe[y[i]].Add(i);
            if (x[i] == 'B' && c[i] == 'B') bbe[y[i]].Add(i);
            if (x[i] == 'B' && c[i] == 'R') bre[y[i]].Add(i);
        }
        int r = 0;
        int b = 0;
        var ans = new List<int>();

        while (true) {
            int target = -1;

            if (target == -1 && rre[r].Count > 0) {
                if (rre[r].Count + rbe[r].Count - 1 == 0) {
                    target = rre[r].First();
                    rre[r].Remove(target);
                }
            }

            if (target == -1 && bre[b].Count > 0) {
                if (rre[r].Count + rbe[r].Count == 0) {
                    target = bre[b].First();
                    bre[b].Remove(target);
                }
            }

            if (target == -1 && bbe[b].Count > 0) {
                if (bbe[b].Count + bre[b].Count - 1 == 0) {
                    target = bbe[b].First();
                    bbe[b].Remove(target);
                }
            }

            if (target == -1 && rbe[r].Count > 0) {
                if (bbe[b].Count + bre[b].Count == 0) {
                    target = rbe[r].First();
                    rbe[r].Remove(target);
                }
            }

            if (target == -1) break;
            if (c[target] == 'R') r++;
            else b++;
            ans.Add(target + 1);
        }

        if (ans.Count == n) {
            cout.WriteLine("Yes");
            cout.WriteLine(ans.JoinToString());
        } else {
            cout.WriteLine("No");
        }
    }
}


// PREWRITEN CODE BEGINS FROM HERE

static public class StringExtensions {
    static public string JoinToString<T>(this IEnumerable<T> source, string separator = " ") {
        return string.Join(separator, source);
    }
}

internal partial class Solver : Scanner {
    static readonly int? StackSizeInMebiByte = null; //50;
    public static void StartAndJoin(Action action, int maxStackSize) {
        var thread = new Thread(new ThreadStart(action), maxStackSize);
        thread.Start();
        thread.Join();
    }

    public static void Main() {
#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 });
        if (StackSizeInMebiByte.HasValue) {
            StartAndJoin(() => new Solver(Console.In, Console.Out).Run(), StackSizeInMebiByte.Value * 1024 * 1024);
        } else {
            new Solver(Console.In, Console.Out).Run();
        }
        Console.Out.Flush();
#endif
    }

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

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
        cerr = Console.Error;
    }

    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
}

#if DEBUG
internal static class LinqPadExtension {
    public static string TextDump<T>(this T obj) {
        if (obj is IEnumerable) return (obj as IEnumerable).Cast<object>().JoinToString().Dump();
        else return obj.ToString().Dump();
    }
    public static T Dump<T>(this T obj) {
        return LINQPad.Extensions.Dump(obj);
    }
}
#endif

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

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

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

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    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 (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}
0