Submission #307208

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <cstdio>

using namespace std;

#define REP(i,n) for((i)=0;(i)<(int)(n);(i)++)
#define foreach(c,itr) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)

int N, M;

int S[102], T[102], K[102];

int A[102][102];

double solve() {
  double ans = 0;
  for (int Set = 0; Set < (1<<N); Set++) {
    bitset<102> bs;
    int exp = 0;
    for (int i = 0; i < N; i++) {
      if (!(Set >> i & 1)) continue;
      exp += S[i];
      for (int j = 0; j < K[i]; j++) {
        bs.set(A[i][j]);
      }
    }
    int sum = 0;
    for (int i = 0; i < M; i++) {
      if (bs[i]) sum += T[i];
    }
    ans = max(ans, (double)exp / sum);
  }
  return ans;
}

int main() {
  while (cin >> N >> M) {
    for(size_t i = 0; i < N; i++)
    {
      cin>>S[i];
    }
    for(size_t i = 0; i < M; i++)
    {
      cin>>T[i];
    }
    for(size_t i = 0; i < N; i++)
    {
      cin>>K[i];
      for(size_t j = 0; j < K[i]; j++)
      {
        cin>>A[i][j];
        A[i][j]--;
      }
    }
    printf("%lf\n", solve());
  }

  return 0;
}

Submission Info

Judge Result