結果

問題 No.1023 Cyclic Tour
ユーザー ひばちひばち
提出日時 2020-04-25 19:35:17
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 10,133 bytes
コンパイル時間 2,242 ms
コンパイル使用メモリ 116,480 KB
実行使用メモリ 109,684 KB
最終ジャッジ日時 2024-11-07 17:20:16
合計ジャッジ時間 35,301 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 37 ms
20,608 KB
testcase_01 AC 38 ms
20,352 KB
testcase_02 AC 37 ms
20,480 KB
testcase_03 AC 38 ms
20,352 KB
testcase_04 AC 176 ms
30,080 KB
testcase_05 AC 174 ms
30,080 KB
testcase_06 AC 188 ms
30,456 KB
testcase_07 AC 179 ms
30,208 KB
testcase_08 AC 543 ms
71,748 KB
testcase_09 AC 540 ms
69,848 KB
testcase_10 AC 557 ms
70,756 KB
testcase_11 AC 638 ms
74,716 KB
testcase_12 AC 714 ms
88,596 KB
testcase_13 AC 656 ms
85,220 KB
testcase_14 AC 725 ms
83,560 KB
testcase_15 AC 769 ms
86,288 KB
testcase_16 AC 846 ms
91,248 KB
testcase_17 AC 872 ms
91,108 KB
testcase_18 AC 854 ms
85,752 KB
testcase_19 AC 834 ms
85,380 KB
testcase_20 AC 493 ms
38,644 KB
testcase_21 AC 484 ms
40,192 KB
testcase_22 AC 640 ms
56,728 KB
testcase_23 AC 684 ms
60,776 KB
testcase_24 AC 897 ms
81,244 KB
testcase_25 AC 497 ms
36,864 KB
testcase_26 AC 462 ms
33,920 KB
testcase_27 AC 442 ms
34,036 KB
testcase_28 AC 802 ms
77,168 KB
testcase_29 AC 846 ms
85,500 KB
testcase_30 AC 787 ms
72,248 KB
testcase_31 AC 725 ms
69,732 KB
testcase_32 AC 755 ms
75,884 KB
testcase_33 AC 787 ms
69,864 KB
testcase_34 AC 166 ms
31,360 KB
testcase_35 AC 316 ms
32,504 KB
testcase_36 AC 581 ms
47,728 KB
testcase_37 AC 684 ms
65,172 KB
testcase_38 AC 796 ms
81,120 KB
testcase_39 AC 713 ms
61,792 KB
testcase_40 AC 698 ms
62,452 KB
testcase_41 AC 701 ms
61,924 KB
testcase_42 WA -
testcase_43 WA -
testcase_44 AC 267 ms
32,376 KB
testcase_45 AC 734 ms
109,684 KB
testcase_46 AC 676 ms
102,220 KB
testcase_47 AC 329 ms
56,888 KB
testcase_48 AC 519 ms
60,696 KB
testcase_49 AC 519 ms
56,256 KB
testcase_50 AC 538 ms
61,804 KB
testcase_51 WA -
testcase_52 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.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 Pi = Pair<int, int>;

class Solver
{
    public void Solve(Scanner sc)
    {
        int N, M;
        sc.Make(out N, out M);
        var uf = new UnionFind(N);
        var edge = Create(N, () => new List<int>());
        for(int i = 0; i < M; i++)
        {
            int a, b, c;
            sc.Make(out a, out b, out c);a--;b--;
            if (c==1&&!uf.Union(a, b)) Fail("Yes");
            if (c == 2) edge[a].Add(b);
        }
        var l = new List<int>();
        for (int i = 0; i < N; i++)
        {
            l.Add(uf[i]);
        }
        var scc = new StronglyConnectedComponents(uf.GroupCount);
        var ct = Create(uf.GroupCount, () => new List<int>());
        var d = Compression(l);
        for (int i = 0; i < N; i++) ct[d[uf[i]]].Add(i);
        foreach(var list in ct)
        {
            var cp = Compression(list);
            var st = new StronglyConnectedComponents(list.Count);
            foreach(var i in list)
            {
                foreach(var e in edge[i])
                    if (uf[i] == uf[e])
                    {
                        st.AddEdge(cp[i], cp[e]);
                    }
            }
            var p = st.Execute();
            if (p.Any(v => v.Count > 1)) Fail("Yes");
        }
        var use = Create(uf.GroupCount, () => new HashSet<int>());
        for(int i=0;i<N;i++)
            foreach(var e in edge[i])
                if (uf[e] != uf[i])
                {
                    if (use[d[uf[i]]].Contains(d[uf[e]])) continue;
                    scc.AddEdge(d[uf[i]], d[uf[e]]);
                    use[d[uf[i]]].Add(d[uf[e]]);
                }
        var s = scc.Execute();
        if (s.All(v => v.Count == 1)) Fail("No");
        else WriteLine("Yes");


    }
    public static Dictionary<T, int> Compression<T>(IList<T> A, int d = 0, Comparison<T> cmp = null)
    {
        cmp = cmp ?? Comparer<T>.Default.Compare;
        var dic = new Dictionary<T, int>();
        var cp = A.ToArray();
        Array.Sort(cp, (a, b) => cmp(a, b));
        for (var i = 0; i < cp.Length; i++)
            if (!dic.ContainsKey(cp[i]))
                dic[cp[i]] = d++;
        return dic;
    }
}

public class UnionFind
{
    public int GroupCount { get; private set; }
    protected int[] data;
    public virtual int this[int i] => Find(i);
    public UnionFind(int size)
    {
        data = Create(size, () => -1);
        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--;
        data[u] += data[v];
        data[v] = u;
        return true;
    }
}
public class StronglyConnectedComponents
{
    private List<int>[] g, rev;
    private Stack<int> st;
    private List<List<int>> scc;
    private int[] group;
    private bool[] use;
    public int Count { get; private set; }
    public int this[int i] { get { return group[i]; } }
    public List<int> KthGroup(int k) => scc[k];
    public StronglyConnectedComponents(int count)
    {
        g = Create(count, () => new List<int>());
        rev = Create(count, () => new List<int>());
        group = new int[count];
    }
    public void AddEdge(int from, int to)
    {
        g[from].Add(to);
        rev[to].Add(from);
    }
    /// <summary>
    /// O(V+E)
    /// </summary>
    /// <returns>scc[i]:i番目の強連結成分の頂点</returns>
    public List<List<int>> Execute()
    {
        scc = new List<List<int>>();
        use = new bool[g.Length];
        st = new Stack<int>();
        for (var i = 0; i < g.Length; i++)
            if (!use[i])
                dfs1(i);
        use = new bool[g.Length];
        while (st.Any())
        {
            scc.Add(new List<int>());
            Count++;
            dfs2(st.Pop());
            while (st.Any() && use[st.Peek()])
                st.Pop();
        }
        return scc;
    }
    private void dfs1(int index)
    {
        use[index] = true;
        foreach (var e in g[index])
            if (!use[e])
                dfs1(e);
        st.Push(index);
    }
    private void dfs2(int index)
    {
        group[index] = Count - 1;
        use[index] = true;
        scc[scc.Count - 1].Add(index);
        foreach (var e in rev[index])
            if (!use[e])
                dfs2(e);
    }
}
#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == 1) { 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) == -1) { 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 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 MaxElement<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 (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); }
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString() => $"{v1.ToString()} {v2.ToString()}";
    public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString() => $"{base.ToString()} {v3.ToString()}";
    public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; }
}
#endregion
0