Submission #112253


Source Code Expand

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {
	
	private static Human[] humanArray;
	private List<Integer> visitedList;
	private int friendIndex;
	private int max = 1;

	/** コンストラクタ */
	public Main(){
		this.visitedList = new ArrayList<Integer>();
	}
	
	private boolean checkFriend(int num){
		boolean tf = true;
		
		for(int i=0;i<this.visitedList.size();i++){
			if(humanArray[this.visitedList.get(i)].friendList.indexOf(num) == -1){
				tf = false;
				break;
			}
		}
		
		return tf;
	}
	
	private void countFriend(){
		int ans = 1;
		for(int i=0;i<humanArray.length;i++){
			if(this.max >= humanArray.length-i){
				break;
			}
			this.friendIndex = -1;
			ans = countFriend(i);

			if(this.max < ans){
				this.max = ans;
			}
		}
	}
	
	private int countFriend(int num){
		int save = 0;
		int ans = 0;
		int checkNum;
		if(this.visitedList.size() == 1){
			this.friendIndex++;
		}
		this.visitedList.add(num);
		List<Integer> list = humanArray[num].friendList;
		
		for(int i=0;i<list.size();i++){
			checkNum = humanArray.length-this.visitedList.get(0)-this.friendIndex+1;
			if(this.max>=checkNum || ans+1>=checkNum){
				break;
			}
			if(list.get(i) <= this.visitedList.get(0)){
				continue;
			}
			if(this.visitedList.size()>=2 && list.get(i)<this.visitedList.get(1)){
				continue;
			}
			if(this.visitedList.indexOf(list.get(i)) == -1){
				if(checkFriend(list.get(i))){
					save = countFriend(list.get(i));
					if(ans < save){
						ans = save;
					}
				}
			}
		}
		this.visitedList.remove(this.visitedList.size()-1);
		
		return ans + 1;
	}
	
	/** mainメソッド */
	public static void main(String[] args) {
		Main main = new Main();
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int m = scan.nextInt();
		humanArray = new Human[n];
		
		for(int i=0;i<n;i++){
			humanArray[i] = main.new Human();
		}
		
		for(int i=0;i<m;i++){
			int x = scan.nextInt();
			int y = scan.nextInt();
			humanArray[x-1].friendList.add(y-1);
			humanArray[y-1].friendList.add(x-1);
		}
		
		main.countFriend();
		
		System.out.println(main.max);
	}
	
	private class Human{
		private List<Integer> friendList;
		
		/** コンストラクタ */
		private Human(){
			this.friendList = new ArrayList<Integer>();
		}
	}
}

Submission Info

Submission Time
Task D - 派閥
User xdeath
Language Java (OpenJDK 1.7.0)
Score 0
Code Size 2422 Byte
Status WA
Exec Time 2038 ms
Memory 30076 KB

Judge Result

Set Name all
Score / Max Score 0 / 100
Status
AC × 56
WA × 16
TLE × 2
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 550 ms 23236 KB
00_sample_02.txt AC 485 ms 23364 KB
00_sample_03.txt AC 504 ms 23272 KB
00_sample_04.txt AC 468 ms 23256 KB
test_01.txt AC 471 ms 23268 KB
test_02.txt AC 513 ms 23264 KB
test_03.txt AC 466 ms 23264 KB
test_04.txt AC 475 ms 23400 KB
test_05.txt AC 480 ms 23264 KB
test_06.txt AC 478 ms 23256 KB
test_07.txt AC 484 ms 23264 KB
test_08.txt WA 477 ms 23304 KB
test_09.txt AC 486 ms 23524 KB
test_10.txt AC 473 ms 23392 KB
test_11.txt AC 472 ms 23388 KB
test_12.txt AC 572 ms 28984 KB
test_13.txt AC 479 ms 23264 KB
test_14.txt AC 496 ms 23388 KB
test_15.txt AC 486 ms 23252 KB
test_16.txt AC 528 ms 24412 KB
test_17.txt AC 678 ms 30016 KB
test_18.txt AC 480 ms 23392 KB
test_19.txt AC 567 ms 28476 KB
test_20.txt AC 1513 ms 29952 KB
test_21.txt AC 546 ms 27520 KB
test_22.txt WA 608 ms 30076 KB
test_23.txt WA 678 ms 29316 KB
test_24.txt WA 523 ms 23900 KB
test_25.txt AC 481 ms 23260 KB
test_26.txt AC 509 ms 23776 KB
test_27.txt WA 485 ms 23392 KB
test_28.txt AC 490 ms 23260 KB
test_29.txt AC 480 ms 23396 KB
test_30.txt WA 482 ms 23392 KB
test_31.txt AC 577 ms 26704 KB
test_32.txt WA 548 ms 27460 KB
test_33.txt WA 632 ms 29876 KB
test_34.txt WA 681 ms 29792 KB
test_35.txt AC 1346 ms 29928 KB
test_36.txt WA 506 ms 23772 KB
test_37.txt AC 447 ms 23268 KB
test_38.txt TLE 2037 ms 28796 KB
test_39.txt AC 591 ms 27428 KB
test_40.txt AC 501 ms 23388 KB
test_41.txt AC 1422 ms 29980 KB
test_42.txt WA 1357 ms 29972 KB
test_43.txt AC 492 ms 23508 KB
test_44.txt AC 552 ms 28868 KB
test_45.txt AC 587 ms 28660 KB
test_46.txt AC 704 ms 28668 KB
test_47.txt AC 605 ms 29896 KB
test_48.txt WA 499 ms 23764 KB
test_49.txt AC 483 ms 23388 KB
test_50.txt AC 457 ms 23252 KB
test_51.txt AC 482 ms 23648 KB
test_52.txt AC 488 ms 23776 KB
test_53.txt AC 484 ms 23780 KB
test_54.txt AC 495 ms 23516 KB
test_55.txt AC 566 ms 28948 KB
test_56.txt AC 613 ms 29876 KB
test_57.txt AC 664 ms 29252 KB
test_58.txt WA 553 ms 27584 KB
test_59.txt WA 637 ms 30072 KB
test_60.txt WA 504 ms 23900 KB
test_61.txt TLE 2038 ms 29988 KB
test_62.txt AC 466 ms 23256 KB
test_63.txt AC 478 ms 23780 KB
test_64.txt AC 491 ms 23772 KB
test_65.txt AC 477 ms 23728 KB
test_66.txt AC 475 ms 23520 KB
test_67.txt AC 473 ms 23396 KB
test_68.txt AC 466 ms 23388 KB
test_69.txt AC 490 ms 23304 KB
test_70.txt WA 496 ms 23516 KB