Submission #521265


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 = 0; i < members.Count - 1; i++ ) {
				for(int j=  i+1; j<members.Count; j++){
					string relation = members[i].ToString() + " " + members[j].ToString();
					if( !relations.Contains( relation ) ) {
						ngIDList.Add( id );
						return false;
					}
				}
			}

			return true;
		}

		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 2361 Byte
Status TLE
Exec Time 2040 ms
Memory 18096 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 163 ms 9720 KB
00_sample_02.txt AC 160 ms 9760 KB
00_sample_03.txt AC 167 ms 9732 KB
00_sample_04.txt TLE 2040 ms 17612 KB
test_01.txt AC 160 ms 9692 KB
test_02.txt AC 169 ms 9744 KB
test_03.txt AC 167 ms 9784 KB
test_04.txt AC 170 ms 9772 KB
test_05.txt AC 162 ms 9752 KB
test_06.txt AC 174 ms 9744 KB
test_07.txt AC 163 ms 9760 KB
test_08.txt AC 162 ms 9752 KB
test_09.txt AC 159 ms 9852 KB
test_10.txt AC 303 ms 11668 KB
test_11.txt TLE 2040 ms 17372 KB
test_12.txt AC 169 ms 9880 KB
test_13.txt AC 161 ms 9752 KB
test_14.txt AC 165 ms 9756 KB
test_15.txt AC 166 ms 9684 KB
test_16.txt AC 168 ms 9728 KB
test_17.txt AC 166 ms 9736 KB
test_18.txt AC 259 ms 10808 KB
test_19.txt AC 178 ms 10048 KB
test_20.txt AC 163 ms 9740 KB
test_21.txt AC 165 ms 9732 KB
test_22.txt AC 164 ms 9768 KB
test_23.txt AC 161 ms 9832 KB
test_24.txt AC 164 ms 9744 KB
test_25.txt AC 156 ms 9760 KB
test_26.txt AC 241 ms 10792 KB
test_27.txt AC 175 ms 10148 KB
test_28.txt AC 164 ms 9720 KB
test_29.txt AC 161 ms 9840 KB
test_30.txt AC 163 ms 9772 KB
test_31.txt AC 203 ms 10408 KB
test_32.txt AC 164 ms 9824 KB
test_33.txt AC 163 ms 9728 KB
test_34.txt AC 164 ms 9748 KB
test_35.txt AC 174 ms 9752 KB
test_36.txt AC 165 ms 9788 KB
test_37.txt TLE 2039 ms 17748 KB
test_38.txt AC 162 ms 9756 KB
test_39.txt AC 182 ms 10164 KB
test_40.txt TLE 2040 ms 17284 KB
test_41.txt AC 161 ms 9708 KB
test_42.txt AC 163 ms 9724 KB
test_43.txt AC 249 ms 10888 KB
test_44.txt AC 172 ms 10020 KB
test_45.txt AC 166 ms 9872 KB
test_46.txt AC 163 ms 9872 KB
test_47.txt AC 164 ms 9708 KB
test_48.txt AC 160 ms 9728 KB
test_49.txt AC 1250 ms 18092 KB
test_50.txt TLE 2040 ms 18008 KB
test_51.txt TLE 2040 ms 17688 KB
test_52.txt AC 1117 ms 17936 KB
test_53.txt AC 227 ms 10792 KB
test_54.txt AC 293 ms 11788 KB
test_55.txt AC 168 ms 9948 KB
test_56.txt AC 164 ms 9744 KB
test_57.txt AC 162 ms 9728 KB
test_58.txt AC 164 ms 9876 KB
test_59.txt AC 163 ms 9744 KB
test_60.txt AC 163 ms 9716 KB
test_61.txt AC 161 ms 9716 KB
test_62.txt AC 159 ms 9704 KB
test_63.txt AC 375 ms 11520 KB
test_64.txt AC 361 ms 11812 KB
test_65.txt AC 1231 ms 17968 KB
test_66.txt AC 293 ms 11788 KB
test_67.txt TLE 2039 ms 17888 KB
test_68.txt TLE 2040 ms 17912 KB
test_69.txt AC 1158 ms 18096 KB
test_70.txt AC 175 ms 10008 KB