Submission #111874


Source Code Expand

using System;
using System.Linq;
using System.Collections.Generic;
using System.Text.RegularExpressions;

class T
{
    public static void Main()
    {
        var NM = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
        var dict = new Dictionary<int, Node>();
        for (int i = 1; i <= NM[0]; i++)
        {
            dict.Add(i, new Node(i));
        }

        for (var i = 0; i < NM[1]; i++)
        {
            var xy = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
            dict[xy[0]].AddWayTo(dict[xy[1]]);
            dict[xy[1]].AddWayTo(dict[xy[0]]);
        }

        int max = 1;

        for (int i = 1; i <= NM[0]; i++)
        {
            if (dict.ContainsKey(i))
            {
                var al = new Dictionary<int, bool>();
                for (int k = 1; k <= NM[0]; k++)
                {
                    al.Add(k, false);
                }
                int count = SearchNode(i, i, dict, al, 12, 0);
                if (count > max) max = count;
            }
        }
        Console.WriteLine("{0}", max+1);
    }

    public static int SearchNode(int now, int to, Dictionary<int, Node> dict, Dictionary<int, bool> avail, int rest, int count)
    {
        if(rest == 0) return count;

        avail.Remove(now);
        avail.Add(now, true);

        int nowc = count;

        bool isDow = false;

        foreach (var v in dict[now].NextNodeList)
        {
            if (v.Number == to) isDow = true; continue;

            if (!avail[v.Number])
            {
                int res = SearchNode(v.Number, to, dict, avail, rest - 1, count + 1);

                if (res > count) nowc = res;
            }
        }

        count = nowc;

        avail.Remove(now);
        avail.Add(now, false);

        if (isDow)
            return count;
        else
            return 1;
    }

    private static string mul(string a, int n)
    {
        var r = "";
        for (int i = 0; i < n; i++)
        {
            r += a;
        }
        return a;
    }

    public class Node
    {
        public Node(int number)
        {
            Number = number;
            nexts = new List<Node>();
        }

        public void AddWayTo(Node next)
        {
            nexts.Add(next);
        }

        public int Number
        {
            private set;
            get;
        }

        public List<Node> NextNodeList
        {
            get { return nexts; }
        }

        private List<Node> nexts;
    }
}

Submission Info

Submission Time
Task D - 派閥
User Nucleareal
Language C# (Mono 2.10.8.1)
Score 0
Code Size 2616 Byte
Status WA
Exec Time 200 ms
Memory 9276 KB

Judge Result

Set Name all
Score / Max Score 0 / 100
Status
AC × 8
WA × 66
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt, test_59.txt, test_60.txt, test_61.txt, test_62.txt, test_63.txt, test_64.txt, test_65.txt, test_66.txt, test_67.txt, test_68.txt, test_69.txt, test_70.txt
Case Name Status Exec Time Memory
00_sample_01.txt WA 177 ms 9136 KB
00_sample_02.txt AC 175 ms 9140 KB
00_sample_03.txt WA 173 ms 9180 KB
00_sample_04.txt WA 172 ms 9180 KB
test_01.txt WA 175 ms 9140 KB
test_02.txt AC 177 ms 9056 KB
test_03.txt AC 172 ms 9172 KB
test_04.txt WA 172 ms 9176 KB
test_05.txt AC 173 ms 9172 KB
test_06.txt AC 182 ms 9176 KB
test_07.txt AC 182 ms 9164 KB
test_08.txt WA 175 ms 9188 KB
test_09.txt WA 185 ms 9188 KB
test_10.txt WA 170 ms 9176 KB
test_11.txt WA 180 ms 9136 KB
test_12.txt WA 181 ms 9176 KB
test_13.txt WA 178 ms 9052 KB
test_14.txt AC 171 ms 9176 KB
test_15.txt WA 173 ms 9168 KB
test_16.txt WA 174 ms 9172 KB
test_17.txt WA 177 ms 9172 KB
test_18.txt WA 174 ms 9172 KB
test_19.txt WA 177 ms 9172 KB
test_20.txt WA 176 ms 9184 KB
test_21.txt WA 177 ms 9156 KB
test_22.txt WA 176 ms 9188 KB
test_23.txt WA 174 ms 9172 KB
test_24.txt WA 179 ms 9176 KB
test_25.txt WA 173 ms 9144 KB
test_26.txt WA 176 ms 9168 KB
test_27.txt WA 175 ms 9264 KB
test_28.txt WA 174 ms 9176 KB
test_29.txt WA 176 ms 9172 KB
test_30.txt WA 177 ms 9172 KB
test_31.txt WA 177 ms 9156 KB
test_32.txt WA 178 ms 9176 KB
test_33.txt WA 175 ms 9140 KB
test_34.txt WA 177 ms 9172 KB
test_35.txt WA 177 ms 9136 KB
test_36.txt WA 179 ms 9152 KB
test_37.txt AC 182 ms 9152 KB
test_38.txt WA 174 ms 9176 KB
test_39.txt WA 175 ms 9176 KB
test_40.txt WA 177 ms 9188 KB
test_41.txt WA 180 ms 9164 KB
test_42.txt WA 177 ms 9172 KB
test_43.txt WA 177 ms 9184 KB
test_44.txt WA 185 ms 9176 KB
test_45.txt WA 178 ms 9184 KB
test_46.txt WA 177 ms 9268 KB
test_47.txt WA 174 ms 9172 KB
test_48.txt WA 184 ms 9188 KB
test_49.txt WA 185 ms 9172 KB
test_50.txt WA 187 ms 9172 KB
test_51.txt WA 191 ms 9192 KB
test_52.txt WA 180 ms 9172 KB
test_53.txt WA 200 ms 9180 KB
test_54.txt WA 180 ms 9184 KB
test_55.txt WA 184 ms 9176 KB
test_56.txt WA 177 ms 9176 KB
test_57.txt WA 182 ms 9156 KB
test_58.txt WA 179 ms 9140 KB
test_59.txt WA 185 ms 9276 KB
test_60.txt WA 177 ms 9276 KB
test_61.txt WA 173 ms 9172 KB
test_62.txt WA 172 ms 9148 KB
test_63.txt WA 180 ms 9184 KB
test_64.txt WA 174 ms 9176 KB
test_65.txt WA 176 ms 9188 KB
test_66.txt WA 179 ms 9160 KB
test_67.txt WA 176 ms 9172 KB
test_68.txt WA 172 ms 9176 KB
test_69.txt WA 175 ms 9160 KB
test_70.txt WA 175 ms 9172 KB