結果

問題 No.155 生放送とBGM
ユーザー fumiphysfumiphys
提出日時 2019-09-21 02:46:02
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 116 ms / 6,000 ms
コード長 3,817 bytes
コンパイル時間 1,603 ms
コンパイル使用メモリ 169,304 KB
実行使用メモリ 18,088 KB
最終ジャッジ日時 2023-10-13 11:42:34
合計ジャッジ時間 3,220 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 114 ms
18,088 KB
testcase_01 AC 115 ms
18,084 KB
testcase_02 AC 116 ms
18,072 KB
testcase_03 AC 2 ms
4,352 KB
testcase_04 AC 8 ms
14,096 KB
testcase_05 AC 3 ms
5,704 KB
testcase_06 AC 113 ms
17,932 KB
testcase_07 AC 3 ms
5,968 KB
testcase_08 AC 2 ms
5,632 KB
testcase_09 AC 3 ms
6,072 KB
testcase_10 AC 2 ms
5,848 KB
testcase_11 AC 3 ms
6,152 KB
testcase_12 AC 5 ms
8,244 KB
testcase_13 AC 2 ms
5,936 KB
testcase_14 AC 89 ms
17,800 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

ll dp[51][300*60+10];
ll dp2[51][300*60+10];
double conv[51][51];

int main(int argc, char const* argv[])
{
  int n, l;
  cin >> n >> l;
  l *= 60;
  vector<int> s(n);
  int sum = 0;
  rep(i, n){
    string c;
    cin >> c;
    s[i] = 60 * stoi(c.substr(0, 2)) + stoi(c.substr(3, 2));
    sum += s[i];
  }
  if(sum <= l){
    cout << n << endl;
    return 0;
  }
  conv[0][0] = 1.;
  FOR(i, 1, n + 1){
    conv[i][0] = 1.;
    FOR(j, 1, i + 1){
      conv[i][j] = conv[i-1][j] + conv[i-1][j-1];
    }
  }
  dp[0][0] = 1;
  rep(i, n){
    for(int j = i + 1; j >= 0; j--){
      rep(k, l + 1){
        if(j > 0 && k - s[i] >= 0)dp[j][k] += dp[j-1][k - s[i]];
      }
    }
  }
  double res = 0.;
  rep(i, n){
    rep(j, n){
      rep(k, l){
        dp2[j][k] = dp[j][k];
        if(j > 0 && k - s[i] >= 0)dp2[j][k] -= dp2[j-1][k-s[i]];
        res += dp2[j][k] / conv[n - 1][j];
      }
    }
  }
  cout << res / (double)n << endl;
  return 0;
}
0