Submission #65933842

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
int N, X;
int S[8];
int C[8];
int P[8];
double memo[1 << 8][5123];
char memo_valid[1 << 8][5123];
double calc(int ac_list, int money) {
  double ans = 0;
  int i;
  if (memo_valid[ac_list][money]) return memo[ac_list][money];
  for (i = 0; i < N; i++) {
    if (!((ac_list >> i) & 1) && C[i] <= money) {
      double ac = calc(ac_list | (1 << i), money - C[i]) + S[i];
      double wa = calc(ac_list, money - C[i]);
      double candidate = (ac * P[i] + wa * (100 - P[i])) / 100;
      if (candidate > ans) ans = candidate;
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int N, X;
int S[8];
int C[8];
int P[8];

double memo[1 << 8][5123];
char memo_valid[1 << 8][5123];

double calc(int ac_list, int money) {
	double ans = 0;
	int i;
	if (memo_valid[ac_list][money]) return memo[ac_list][money];
	for (i = 0; i < N; i++) {
		if (!((ac_list >> i) & 1) && C[i] <= money) {
			double ac = calc(ac_list | (1 << i), money - C[i]) + S[i];
			double wa = calc(ac_list, money - C[i]);
			double candidate = (ac * P[i] + wa * (100 - P[i])) / 100;
			if (candidate > ans) ans = candidate;
		}
	}
	memo[ac_list][money] = ans;
	memo_valid[ac_list][money] = 1;
	return ans;
}

int main(void) {
	int i;
	if (scanf("%d%d", &N, &X) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d%d%d", &S[i], &C[i], &P[i]) != 3) return 1;
	}
	printf("%.20f\n", calc(0, X));
	return 0;
}

Submission Info

Judge Result