Submission #145128


Source Code Expand

import java.util.Scanner;

public class Main{
	public static void main(String[] args){
		new Main().run();
	}

	void run()
	{
		Scanner cin = new Scanner(System.in);
		String st = cin.next();
		int N = st.length();
		
		//ox情報をboolean型の配列に写す
		boolean[] b = new boolean[N];
		for(int i=0;i<N;i++){
			if(st.charAt(i) == 'o') b[i] = true;
		}
		
		//forループを用いた全探索
		int ret = 999;
		for(int i=0;i<(1<<N);i++){
			int count = 0;
			//どのタイミングでテレビが付いているかをメモする
			boolean[] now = new boolean[N];
			
			//各秒数に対して、それだけずらしたテレビが存在するか判定
			for(int j=0;j<N;j++){
				if((i>>j) % 2 == 0) continue;
				count++;
				
				//各タイミングに対し、映像が映るかどうかの判定をする
				for(int k=0;k<N;k++){
					if(!b[k]) continue;
					now[(j+k)%N] = true;
				}
				
			}
			
			boolean flag = true;
			for(int j=0;j<N;j++) if(!now[j]) flag = false;
			if(flag) ret = Math.min(ret, count);
			
		}
		System.out.println(ret);
	}
}

Submission Info

Submission Time
Task C - 節約生活
User chokudai
Language Java (OpenJDK 1.7.0)
Score 100
Code Size 1127 Byte
Status AC
Exec Time 873 ms
Memory 23768 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 53
Set Name Test Cases
All 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rand_00.txt, 01_rand_01.txt, 01_rand_02.txt, 01_rand_03.txt, 01_rand_04.txt, 01_rand_05.txt, 01_rand_06.txt, 01_rand_07.txt, 01_rand_08.txt, 01_rand_09.txt, 01_rand_10.txt, 01_rand_11.txt, 01_rand_12.txt, 01_rand_13.txt, 01_rand_14.txt, 01_rand_15.txt, 01_rand_16.txt, 01_rand_17.txt, 01_rand_18.txt, 01_rand_19.txt, 02_maxrand_00.txt, 02_maxrand_01.txt, 02_maxrand_02.txt, 02_maxrand_03.txt, 02_maxrand_04.txt, 02_maxrand_05.txt, 02_maxrand_06.txt, 02_maxrand_07.txt, 02_maxrand_08.txt, 02_maxrand_09.txt, 02_maxrand_10.txt, 02_maxrand_11.txt, 02_maxrand_12.txt, 02_maxrand_13.txt, 02_maxrand_14.txt, 02_maxrand_15.txt, 02_maxrand_16.txt, 02_maxrand_17.txt, 02_maxrand_18.txt, 02_maxrand_19.txt, 03_max.txt, 03_maxret.txt, 03_min.txt, 03_special_01.txt, 03_special_02.txt, 03_special_03.txt, 03_special_04.txt, 04_special_05.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 873 ms 23120 KB
00_sample_02.txt AC 476 ms 23388 KB
00_sample_03.txt AC 477 ms 23128 KB
00_sample_04.txt AC 458 ms 23136 KB
00_sample_05.txt AC 473 ms 23132 KB
01_rand_00.txt AC 479 ms 23036 KB
01_rand_01.txt AC 492 ms 23600 KB
01_rand_02.txt AC 513 ms 23124 KB
01_rand_03.txt AC 447 ms 23136 KB
01_rand_04.txt AC 472 ms 23136 KB
01_rand_05.txt AC 469 ms 23128 KB
01_rand_06.txt AC 452 ms 23136 KB
01_rand_07.txt AC 460 ms 23132 KB
01_rand_08.txt AC 470 ms 23644 KB
01_rand_09.txt AC 475 ms 23100 KB
01_rand_10.txt AC 465 ms 23128 KB
01_rand_11.txt AC 468 ms 23008 KB
01_rand_12.txt AC 456 ms 23012 KB
01_rand_13.txt AC 470 ms 23008 KB
01_rand_14.txt AC 492 ms 23768 KB
01_rand_15.txt AC 454 ms 23156 KB
01_rand_16.txt AC 490 ms 23132 KB
01_rand_17.txt AC 470 ms 23136 KB
01_rand_18.txt AC 487 ms 23004 KB
01_rand_19.txt AC 482 ms 23252 KB
02_maxrand_00.txt AC 485 ms 23512 KB
02_maxrand_01.txt AC 514 ms 23644 KB
02_maxrand_02.txt AC 492 ms 23652 KB
02_maxrand_03.txt AC 485 ms 23648 KB
02_maxrand_04.txt AC 469 ms 23264 KB
02_maxrand_05.txt AC 481 ms 23512 KB
02_maxrand_06.txt AC 496 ms 23712 KB
02_maxrand_07.txt AC 477 ms 23512 KB
02_maxrand_08.txt AC 488 ms 23516 KB
02_maxrand_09.txt AC 486 ms 23632 KB
02_maxrand_10.txt AC 490 ms 23400 KB
02_maxrand_11.txt AC 489 ms 23264 KB
02_maxrand_12.txt AC 487 ms 23652 KB
02_maxrand_13.txt AC 507 ms 23648 KB
02_maxrand_14.txt AC 515 ms 23528 KB
02_maxrand_15.txt AC 495 ms 23520 KB
02_maxrand_16.txt AC 483 ms 23648 KB
02_maxrand_17.txt AC 490 ms 23652 KB
02_maxrand_18.txt AC 484 ms 23520 KB
02_maxrand_19.txt AC 568 ms 23256 KB
03_max.txt AC 570 ms 23580 KB
03_maxret.txt AC 486 ms 23524 KB
03_min.txt AC 484 ms 22992 KB
03_special_01.txt AC 516 ms 23128 KB
03_special_02.txt AC 531 ms 23172 KB
03_special_03.txt AC 515 ms 23396 KB
03_special_04.txt AC 516 ms 23000 KB
04_special_05.txt AC 492 ms 23640 KB