Submission #521260


Source Code Expand

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

namespace D_InnerCircle {
	class Program {
		static List<string> relations = new List<string>();
		static int maxSize = 1;
		static List<int> ngIDList = new List<int>();
		static int N;
		static int M;

		static void Main( string[] args ) {
			string[] header = Console.ReadLine().Split( ' ' );
			N = int.Parse( header[0] );
			M = int.Parse( header[1] );

			for( int i = 0; i < M; i++ ) {
				relations.Add( Console.ReadLine() );
			}

			for( int i = N; i >= 1; i-- ) {
				if( M >= ( i * ( i - 1 ) ) / 2 ) {
					maxSize = i;
					break;
				}
			}

			int circleID = 0;
			for( int i = 0; i < N; i++ ) {
				circleID += 1 << i;
			}


			Queue<int> queue = new Queue<int>();
			queue.Enqueue( circleID );

			int circleSize = 1;
			while( queue.Count != 0 ) {
				int id = queue.Dequeue();

				if( isCircle( id ) ) {
					circleSize = getMemberList( id ).Count;
					break;
				}


				for( int i = 0; i < N; i++ ) {
					int baseNumber = 1 << i;

					if( ( id & baseNumber ) == baseNumber ) {
						queue.Enqueue( id - baseNumber );
					}
				}

			}

			Console.WriteLine( circleSize );
		}

		private static List<int> getMemberList( int id ) {
			List<int> list = new List<int>();
			for( int i = 0; i < N; i++ ) {
				int baseNumber = 1 << i;
				if( baseNumber > id ) {
					break;
				}

				if( (id & baseNumber) == baseNumber ) {
					list.Add( i + 1);
				}
			}

			return list;
		}

		private static bool isCircle( int id ) {
			if( ngIDList.Contains( id ) ) {
				return false;
			}

			List<int> members = getMemberList( id );
			if( members.Count == 1 ) {
				return true;
			}

			if( members.Count > maxSize ) {
				ngIDList.Add( id );
				return false;
			}

			for( int i = 1; i < members.Count; i++ ) {
				string relation = members[0].ToString() + " " + members[i].ToString();
				if( !relations.Contains( relation ) ) {
					ngIDList.Add( id );
					return false;
				}
			}

			members.RemoveAt(0);
			return isCircle( getCircleID(members) );
		}

		private static int getCircleID( List<int> members ) {
			int id = 0;

			foreach( int member in members ) {
				id += 1 << ( member - 1 );
			}

			return id;
		}

	}
}

Submission Info

Submission Time
Task D - 派閥
User kitaita
Language C# (Mono 2.10.8.1)
Score 0
Code Size 2353 Byte
Status TLE
Exec Time 2039 ms
Memory 19372 KB

Judge Result

Set Name all
Score / Max Score 0 / 100
Status
AC × 66
TLE × 8
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 148 ms 9652 KB
00_sample_02.txt AC 147 ms 9752 KB
00_sample_03.txt AC 148 ms 9644 KB
00_sample_04.txt TLE 2039 ms 16612 KB
test_01.txt AC 141 ms 9772 KB
test_02.txt AC 144 ms 9668 KB
test_03.txt AC 148 ms 9728 KB
test_04.txt AC 146 ms 9648 KB
test_05.txt AC 149 ms 9628 KB
test_06.txt AC 150 ms 9760 KB
test_07.txt AC 150 ms 9768 KB
test_08.txt AC 147 ms 9772 KB
test_09.txt AC 151 ms 9648 KB
test_10.txt AC 321 ms 12124 KB
test_11.txt TLE 2037 ms 17380 KB
test_12.txt AC 158 ms 10008 KB
test_13.txt AC 148 ms 9656 KB
test_14.txt AC 152 ms 9644 KB
test_15.txt AC 148 ms 9784 KB
test_16.txt AC 149 ms 9740 KB
test_17.txt AC 148 ms 9644 KB
test_18.txt AC 241 ms 10796 KB
test_19.txt AC 168 ms 10164 KB
test_20.txt AC 146 ms 9696 KB
test_21.txt AC 145 ms 9644 KB
test_22.txt AC 150 ms 9644 KB
test_23.txt AC 153 ms 9664 KB
test_24.txt AC 147 ms 9664 KB
test_25.txt AC 141 ms 9776 KB
test_26.txt AC 229 ms 10832 KB
test_27.txt AC 161 ms 10028 KB
test_28.txt AC 171 ms 9664 KB
test_29.txt AC 152 ms 9764 KB
test_30.txt AC 149 ms 9700 KB
test_31.txt AC 226 ms 10664 KB
test_32.txt AC 147 ms 9640 KB
test_33.txt AC 146 ms 9680 KB
test_34.txt AC 146 ms 9652 KB
test_35.txt AC 147 ms 9764 KB
test_36.txt AC 145 ms 9784 KB
test_37.txt TLE 2037 ms 17640 KB
test_38.txt AC 146 ms 9772 KB
test_39.txt AC 193 ms 10156 KB
test_40.txt TLE 2038 ms 17284 KB
test_41.txt AC 147 ms 9640 KB
test_42.txt AC 146 ms 9772 KB
test_43.txt AC 232 ms 10844 KB
test_44.txt AC 160 ms 10112 KB
test_45.txt AC 154 ms 9888 KB
test_46.txt AC 151 ms 9768 KB
test_47.txt AC 148 ms 9704 KB
test_48.txt AC 148 ms 9640 KB
test_49.txt AC 1257 ms 18604 KB
test_50.txt TLE 2039 ms 18356 KB
test_51.txt TLE 2037 ms 19076 KB
test_52.txt AC 1142 ms 18328 KB
test_53.txt AC 215 ms 10668 KB
test_54.txt AC 282 ms 11952 KB
test_55.txt AC 153 ms 9896 KB
test_56.txt AC 145 ms 9664 KB
test_57.txt AC 150 ms 9756 KB
test_58.txt AC 153 ms 9740 KB
test_59.txt AC 147 ms 9672 KB
test_60.txt AC 148 ms 9776 KB
test_61.txt AC 149 ms 9652 KB
test_62.txt AC 143 ms 9764 KB
test_63.txt AC 362 ms 11548 KB
test_64.txt AC 349 ms 11808 KB
test_65.txt AC 1302 ms 19004 KB
test_66.txt AC 282 ms 11944 KB
test_67.txt TLE 2038 ms 17912 KB
test_68.txt TLE 2038 ms 19276 KB
test_69.txt AC 1205 ms 19372 KB
test_70.txt AC 156 ms 10032 KB