#592477 (C#(csc)) No.1315 渦巻洞穴

• 問題: No.1315 渦巻洞穴
• ユーザー: EmKjp
• 提出日時: 2020-12-12 17:07:53
• 言語: C#(csc) (csc 3.9.0)
• 結果: WA
• 実行時間: -
• コード長: 9,786 bytes
• コンパイル時間: 1,918 ms
• コンパイル使用メモリ: 118,936 KB
• 実行使用メモリ: 36,688 KB
• 最終ジャッジ日時: 2024-09-19 21:57:42
• 合計ジャッジ時間: 7,886 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
sample	AC * 1 WA * 2
other	AC * 31 WA * 48

コンパイルメッセージ

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;
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 int[] dxs = new int[] { 1, 0, -1, 0 };
    public int[] dys = new int[] { 0, 1, 0, -1 };
    public string ds = "RULD";

    (int X, int Y) ToXY(int n) {
        if (n == 1) return (0, 0);
        // 1,1,2,2,3,3,
        int dir = 0;
        int row = 0, col = 0;
        int step = 1;
        n--;
        while (n > 0) {
            for (int i = 0; i < 2; i++) {
                var s = Math.Min(step, n);
                row += dys[dir] * s;
                col += dxs[dir] * s;
                dir = (dir + 1) % 4;
                n -= s;
            }
            step++;
        }
        return (col, row);
    }

    char DirToChar(int dx, int dy) {
        for (int i = 0; i < 4; i++) {
            if (dx == dxs[i] && dy == dys[i]) return ds[i];
        }
        throw new Exception();
    }

    public void Run() {
        var s = ni();
        var t = ni();
        var (sx, sy) = ToXY(s);
        var (tx, ty) = ToXY(t);

        if ((Math.Abs(sx - tx) + Math.Abs(sy - ty)) % 2 == 0) {
            // 1 を迂回する

            var points = new List<(int x, int y)>();
            while (sx != 0 || sy != 0) {
                points.Add((sx, sy));
                if (sx > 0) {
                    sx--;
                } else if (sx < 0) {
                    sx++;
                } else if (sy > 0) {
                    sy--;
                } else if (sy < 0) {
                    sy++;
                } else throw new Exception();
            }
            while (sx != tx || sy != ty) {
                points.Add((sx, sy));
                if (sx < tx) sx++;
                else if (sx > tx) sx--;
                else if (sy < ty) sy++;
                else if (sy > ty) sy--;
                else throw new Exception();
            }
            points.Add((tx, ty));
            var degree = new HashMap<(int, int), int>();
            (int, int)? prev = null;
            var points2 = new List<(int x, int y)>();
            foreach (var p in points) {
                points2.Add(p);
                degree[p]++;
                if (prev.HasValue) {
                    if (prev == (0, 0)) {
                        if (degree[prev.Value] % 2 == 0) {
                            points2.Add(prev.Value);
                            points2.Add(p);

                            degree[prev.Value]++;
                            degree[p]++;
                        }
                    } else {
                        if (degree[prev.Value] % 2 != 0) {
                            points2.Add(prev.Value);
                            points2.Add(p);

                            degree[prev.Value]++;
                            degree[p]++;
                        }
                    }
                }

                prev = p;
            }
            var ans = string.Concat(points2.Zip(points2.Skip(1), (p1, p2) => DirToChar(p2.x - p1.x, p2.y - p1.y)));
            int minStep = 1;
            cout.WriteLine(minStep);
            cout.WriteLine(ans.Length);
            cout.WriteLine(ans);
        } else {
            var ans = new StringBuilder();
            int step = 0;
            while (sx < tx) { sx++; ans.Append((++step) % 2 == 1 ? "RLR" : "R"); }
            while (sx > tx) { sx--; ans.Append((++step) % 2 == 1 ? "LRL" : "L"); }
            while (sy < ty) { sy++; ans.Append((++step) % 2 == 1 ? "UDU" : "U"); }
            while (sy > ty) { sy--; ans.Append((++step) % 2 == 1 ? "DUD" : "D"); }

            int minStep = 0;
            cout.WriteLine(minStep);
            cout.WriteLine(ans.Length);
            cout.WriteLine(ans);
        }
    }
}



public class HashMap<TKey, TValue> : Dictionary<TKey, TValue> {
    public new TValue this[TKey index] {
        get {
            TValue value;
            if (TryGetValue(index, out value)) {
                return value;
            } else {
                return base[index] = default(TValue);
            }
        }
        set {
            base[index] = value;
        }
    }
}

// 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;
        }
    }
}