Submission #333960


Source Code Expand

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace AtCoderBeginnerContest002
{
    class Program
    {
        static void Main(string[] args)
        {
            //C();
            D();
        }
        static void D()
        {
            String[] s = Console.ReadLine().Split(' ');
            int N = int.Parse(s[0]);
            int M = int.Parse(s[1]);

            Boolean[,] pair = new Boolean[N,N];

            for(int i=0;i<M;i++)
            {
                String[] str = Console.ReadLine().Split(' ');
                int x = int.Parse(str[0])-1;
                int y = int.Parse(str[1])-1;

                pair[x,y] = true;
                pair[y,x] = true;
            }

            int ans = 0;

            for(int i=0;i<N;i++)
            {
                List<int> list = getMember(i,pair,N);
                ans = Math.Max(ans,list.Count());
            }

            Console.WriteLine(ans);
        }

        static List<int> getMember(int m , Boolean[,] pair,int N)
        {
            List<int> list = new List<int>();
            list.Add(m);
            for (int i = 0; i < N; i++ )
            {
                Boolean flag = true;
                if (i == m) continue;

                if (pair[m, i] && pair[i, m])
                {

                    int[] array = list.ToArray();
                    for (int j = 0; j < array.Length; j++)
                    {
                        if(!pair[i,array[j]] || !pair[array[j],i])
                        {
                            flag = false;
                            break;
                        }
                    }

                    if (flag)
                    {
                        //Console.WriteLine("Add:" + (i + 1));
                        list.Add(i);
                    }
                }
            }
            
            return list;
        }
        static void C()
        {
            String[] inst = Console.ReadLine().Split(' ');

            int ax = int.Parse(inst[0]);
            int ay = int.Parse(inst[1]);
            int bx = int.Parse(inst[2]);
            int by = int.Parse(inst[3]);
            int cx = int.Parse(inst[4]);
            int cy = int.Parse(inst[5]);

            double ans = 1.0 * Math.Abs(((bx-ax) * (cy-ay)) - ((by-ay) * (cx-ax))) / 2.0;

            Console.WriteLine(ans);
        }
    }
}

Submission Info

Submission Time
Task D - 派閥
User tookunn
Language C# (Mono 2.10.8.1)
Score 100
Code Size 2535 Byte
Status AC
Exec Time 130 ms
Memory 8604 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 74
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 AC 130 ms 8516 KB
00_sample_02.txt AC 112 ms 8540 KB
00_sample_03.txt AC 111 ms 8536 KB
00_sample_04.txt AC 111 ms 8544 KB
test_01.txt AC 110 ms 8476 KB
test_02.txt AC 112 ms 8504 KB
test_03.txt AC 114 ms 8544 KB
test_04.txt AC 115 ms 8540 KB
test_05.txt AC 114 ms 8480 KB
test_06.txt AC 112 ms 8492 KB
test_07.txt AC 116 ms 8520 KB
test_08.txt AC 112 ms 8512 KB
test_09.txt AC 114 ms 8524 KB
test_10.txt AC 113 ms 8536 KB
test_11.txt AC 113 ms 8540 KB
test_12.txt AC 110 ms 8540 KB
test_13.txt AC 111 ms 8540 KB
test_14.txt AC 112 ms 8540 KB
test_15.txt AC 110 ms 8540 KB
test_16.txt AC 112 ms 8540 KB
test_17.txt AC 111 ms 8540 KB
test_18.txt AC 111 ms 8552 KB
test_19.txt AC 110 ms 8540 KB
test_20.txt AC 114 ms 8548 KB
test_21.txt AC 109 ms 8540 KB
test_22.txt AC 113 ms 8536 KB
test_23.txt AC 127 ms 8536 KB
test_24.txt AC 112 ms 8528 KB
test_25.txt AC 110 ms 8544 KB
test_26.txt AC 111 ms 8540 KB
test_27.txt AC 112 ms 8476 KB
test_28.txt AC 110 ms 8540 KB
test_29.txt AC 113 ms 8536 KB
test_30.txt AC 113 ms 8536 KB
test_31.txt AC 113 ms 8536 KB
test_32.txt AC 119 ms 8540 KB
test_33.txt AC 113 ms 8604 KB
test_34.txt AC 113 ms 8528 KB
test_35.txt AC 110 ms 8540 KB
test_36.txt AC 112 ms 8540 KB
test_37.txt AC 121 ms 8524 KB
test_38.txt AC 116 ms 8576 KB
test_39.txt AC 113 ms 8540 KB
test_40.txt AC 124 ms 8540 KB
test_41.txt AC 119 ms 8536 KB
test_42.txt AC 115 ms 8544 KB
test_43.txt AC 127 ms 8520 KB
test_44.txt AC 117 ms 8520 KB
test_45.txt AC 113 ms 8540 KB
test_46.txt AC 114 ms 8548 KB
test_47.txt AC 115 ms 8536 KB
test_48.txt AC 113 ms 8536 KB
test_49.txt AC 117 ms 8556 KB
test_50.txt AC 112 ms 8536 KB
test_51.txt AC 114 ms 8536 KB
test_52.txt AC 112 ms 8540 KB
test_53.txt AC 119 ms 8540 KB
test_54.txt AC 117 ms 8536 KB
test_55.txt AC 116 ms 8540 KB
test_56.txt AC 110 ms 8604 KB
test_57.txt AC 112 ms 8540 KB
test_58.txt AC 110 ms 8540 KB
test_59.txt AC 112 ms 8532 KB
test_60.txt AC 116 ms 8536 KB
test_61.txt AC 115 ms 8596 KB
test_62.txt AC 111 ms 8544 KB
test_63.txt AC 113 ms 8556 KB
test_64.txt AC 112 ms 8500 KB
test_65.txt AC 114 ms 8572 KB
test_66.txt AC 109 ms 8540 KB
test_67.txt AC 113 ms 8540 KB
test_68.txt AC 113 ms 8540 KB
test_69.txt AC 111 ms 8524 KB
test_70.txt AC 113 ms 8536 KB