Submission #122538


Source Code Expand

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;

#define rep(i,n) for(int i=0; i<n; i++)

int N;
bool watched[100];
int rate[100];

double solve(int d){
	if(d==0)	return 0.0;
	double mr = 0.0;
	rep(i,N){
		if(!watched[i]){
			watched[i] = true;
			double r = solve(d-1)+rate[i];
			if(r > mr)	mr = r;
			watched[i] = false;
		}
	}
	return mr/2.0;
}

int main(){
	int k;
	memset(watched, 0, sizeof(watched));
	scanf("%d %d", &N, &k);
	rep(i,N){
		scanf("%d", &rate[i]);
	}
	double r = solve(k);
	printf("%.6lf\n", r);
	return 0;
}

Submission Info

Submission Time
Task C - AtCoderプログラミング講座
User NegiMagnet
Language C++ (G++ 4.6.4)
Score 0
Code Size 594 Byte
Status TLE
Exec Time 2034 ms
Memory 816 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:29:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:31:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 10
TLE × 24
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
Case Name Status Exec Time Memory
00_sample_01.txt AC 20 ms 796 KB
00_sample_02.txt AC 21 ms 792 KB
00_sample_03.txt AC 21 ms 800 KB
00_sample_04.txt AC 55 ms 720 KB
test_01.txt AC 20 ms 796 KB
test_02.txt TLE 2030 ms 808 KB
test_03.txt TLE 2029 ms 800 KB
test_04.txt AC 21 ms 796 KB
test_05.txt TLE 2030 ms 812 KB
test_06.txt TLE 2029 ms 812 KB
test_07.txt AC 21 ms 796 KB
test_08.txt TLE 2029 ms 812 KB
test_09.txt TLE 2029 ms 812 KB
test_10.txt AC 19 ms 796 KB
test_11.txt TLE 2032 ms 672 KB
test_12.txt TLE 2031 ms 812 KB
test_13.txt TLE 2029 ms 808 KB
test_14.txt TLE 2032 ms 668 KB
test_15.txt TLE 2030 ms 812 KB
test_16.txt TLE 2030 ms 816 KB
test_17.txt TLE 2030 ms 812 KB
test_18.txt TLE 2030 ms 816 KB
test_19.txt TLE 2030 ms 812 KB
test_20.txt TLE 2032 ms 808 KB
test_21.txt AC 21 ms 800 KB
test_22.txt TLE 2030 ms 812 KB
test_23.txt TLE 2031 ms 812 KB
test_24.txt TLE 2029 ms 816 KB
test_25.txt TLE 2030 ms 664 KB
test_26.txt TLE 2028 ms 808 KB
test_27.txt TLE 2030 ms 812 KB
test_28.txt AC 20 ms 792 KB
test_29.txt TLE 2034 ms 812 KB
test_30.txt TLE 2030 ms 812 KB