結果

問題 No.1508 Avoid being hit
ユーザー りあんりあん
提出日時 2021-05-14 23:25:50
言語 C#(csc)
(csc 3.9.0)
結果
RE  
実行時間 -
コード長 9,869 bytes
コンパイル時間 3,323 ms
コンパイル使用メモリ 121,400 KB
実行使用メモリ 53,032 KB
最終ジャッジ日時 2024-10-02 05:16:39
合計ジャッジ時間 11,924 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 AC 33 ms
19,456 KB
testcase_02 RE -
testcase_03 AC 33 ms
19,072 KB
testcase_04 AC 32 ms
19,200 KB
testcase_05 RE -
testcase_06 RE -
testcase_07 AC 34 ms
19,200 KB
testcase_08 AC 33 ms
19,328 KB
testcase_09 AC 34 ms
19,456 KB
testcase_10 RE -
testcase_11 AC 35 ms
19,200 KB
testcase_12 AC 34 ms
19,200 KB
testcase_13 AC 33 ms
19,328 KB
testcase_14 AC 33 ms
19,328 KB
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 RE -
testcase_33 RE -
testcase_34 AC 166 ms
42,240 KB
testcase_35 AC 52 ms
25,216 KB
testcase_36 AC 107 ms
34,816 KB
testcase_37 AC 70 ms
28,160 KB
testcase_38 AC 141 ms
40,448 KB
testcase_39 AC 100 ms
33,920 KB
testcase_40 AC 168 ms
42,624 KB
testcase_41 AC 114 ms
35,584 KB
testcase_42 AC 166 ms
42,752 KB
testcase_43 AC 184 ms
42,112 KB
testcase_44 AC 32 ms
19,200 KB
testcase_45 RE -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using static util;
using P = pair<int, int>;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 28); // 256 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }

    public void solve() {
        int n, q;
        sc.Multi(out n, out q);
        var a = sc.IntArr.Select(x => x - 1).ToArray();
        var b = sc.IntArr.Select(x => x - 1).ToArray();
        var sgs = new List<P>[q + 1];
        sgs[0] = new List<P>();
        sgs[0].Add(new P(0, n));

        for (int i = 0; i < q; i++)
        {
            if (a[i] > b[i]) {
                int tmp = a[i];
                a[i] = b[i];
                b[i] = tmp;
            }
            sgs[i + 1] = new List<P>();
            foreach (var item in sgs[i])
            {
                int l = Math.Max(item.v1 - 1, 0);
                int r = Math.Min(item.v2 + 1, n);
                var p = new List<P>();
                p.Add(new P(l, r));
                {
                    var np = new List<P>();
                    foreach (var e in p)
                    {
                        if (e.v1 <= a[i] && a[i] < e.v2) {
                            if (e.v1 < a[i]) {
                                np.Add(new P(e.v1, a[i]));
                            }
                            if (a[i] + 1 < e.v2) {
                                np.Add(new P(a[i] + 1, e.v2));
                            }
                        }
                        else {
                            np.Add(e);
                        }
                    }
                    p = np;
                }
                {
                    var np = new List<P>();
                    foreach (var e in p)
                    {
                        if (e.v1 <= b[i] && b[i] < e.v2) {
                            if (e.v1 < b[i]) {
                                np.Add(new P(e.v1, b[i]));
                            }
                            if (b[i] + 1 < e.v2) {
                                np.Add(new P(b[i] + 1, e.v2));
                            }
                        }
                        else {
                            np.Add(e);
                        }
                    }
                    p = np;
                }
                foreach (var e in p)
                {
                    sgs[i + 1].Add(e);
                }
            }
            sgs[i + 1] = merge(sgs[i + 1]);
        }
        if (sgs[q].Count == 0) {
            Assert(false);
            Prt("NO");
            return;
        }

        Prt("YES");
        var ans = new int[q + 1];
        for (int i = 0; i < q + 1; i++)
        {
            ans[i] = -1;
        }
        ans[q] = sgs[q][0].v1;
        for (int i = q - 1; i >= 0 ; i--)
        {
            for (int j = -1; j <= 1; j++)
            {
                if (contain(sgs[i], ans[i + 1] + j)) {
                    ans[i] = ans[i + 1] + j;
                    break;
                }
            }
        }
        foreach (var item in ans)
        {
            Prt(item + 1);
        }


    }

    List<P> merge(List<P> lis) {
        lis.Sort();
        var res = new List<P>();
        foreach (var item in lis)
        {
            if (res.Count == 0) {
                res.Add(item);
                continue;
            }
            var last = res[res.Count - 1];
            if (item.v1 <= last.v2) {
                var p = new P(last.v1, Math.Max(last.v2, item.v2));
                res[res.Count - 1] = p;
            }
        }
        return res;
    }
    bool contain(List<P> lis, int x) {
        foreach (var item in lis)
        {
            if (item.v1 <= x && x < item.v2) {
                return true;
            }
        }
        return false;
    }

}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => $"{v1} {v2}";
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
    public static readonly int M = 1000000007;
    // public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(params bool[] conds) {
        if (conds.Any(x => !x)) throw new Exception();
    }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    public static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static IEnumerable<P> adjacents(int i, int j) {
        for (int k = 0; k < 4; k++) yield return new P(i + dd[k], j + dd[k ^ 1]);
    }
    public static IEnumerable<P> adjacents(int i, int j, int h, int w) {
        for (int k = 0; k < 4; k++) if (inside(i + dd[k], j + dd[k ^ 1], h, w))
            yield return new P(i + dd[k], j + dd[k ^ 1]);
    }
    public static IEnumerable<P> adjacents(this P p) => adjacents(p.v1, p.v2);
    public static IEnumerable<P> adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static IEnumerable<int> all_subset(this int p) {
        for (int i = 0; ; i = i - p & p) {
            yield return i;
            if (i == p) break;
        }
    }
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a)
        => compress(a.SelectMany(x => x));
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct {
        var t = a[i]; a[i] = a[j]; a[j] = t;
    }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => ReadLine.Trim();
    public string ReadLine => sr.ReadLine();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]);
    }
    public void Multi<T, U, V>(out T a, out U b, out V c) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
    }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]);
    }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) {
        var ar = StrArr;
        a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]);
    }
    public void Multi<T, U, V, W, X, Y>(out T a, out U b, out V c, out W d, out X e, out Y f) {
        var ar = StrArr;
        a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
        d = cv<W>(ar[3]); e = cv<X>(ar[4]); f = cv<Y>(ar[5]);
    }
}
0