結果
| 問題 | No.155 生放送とBGM |
| ユーザー |
 shimomire
|
| 提出日時 | 2015-02-18 00:27:44 |
| 言語 | C++11 (gcc 11.4.0) |
| 結果 |
AC
|
| 実行時間 | 2,790 ms / 6,000 ms |
| コード長 | 5,351 bytes |
| コンパイル時間 | 1,017 ms |
| コンパイル使用メモリ | 121,220 KB |
| 実行使用メモリ | 10,880 KB |
| 最終ジャッジ日時 | 2024-06-23 20:55:15 |
| 合計ジャッジ時間 | 17,282 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2,779 ms
10,752 KB |
| testcase_01 | AC | 2,780 ms
10,752 KB |
| testcase_02 | AC | 2,790 ms
10,752 KB |
| testcase_03 | AC | 2 ms
6,940 KB |
| testcase_04 | AC | 56 ms
6,940 KB |
| testcase_05 | AC | 2 ms
6,940 KB |
| testcase_06 | AC | 2,628 ms
10,880 KB |
| testcase_07 | AC | 3 ms
6,944 KB |
| testcase_08 | AC | 2 ms
6,940 KB |
| testcase_09 | AC | 6 ms
6,944 KB |
| testcase_10 | AC | 2 ms
6,944 KB |
| testcase_11 | AC | 6 ms
6,944 KB |
| testcase_12 | AC | 8 ms
6,944 KB |
| testcase_13 | AC | 2 ms
6,940 KB |
| testcase_14 | AC | 1,892 ms
9,216 KB |
コンパイルメッセージ
main.cpp: In member function ‘void Main::run()’:
main.cpp:96:30: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
96 | int N,L;scanf("%d %d",&N,&L);
| ~~~~~^~~~~~~~~~~~~~~
main.cpp:99:30: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
99 | REP(i,N)scanf("%d:%d",&ms[i],&ss[i]);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
ソースコード
#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;
using i32=int32_t;using i64=int64_t;using ll =i64;using uint=uint32_t;using ull=uint64_t;
template<typename T> using matrix=vector<vector<T> >;
#define ALL(c) (begin(c)),(end(c))
#define REP(i,n) FOR(i,0,n)
#define REPr(i,n) FORr(i,0,n)
#define FOR(i,l,r) for(int i=(int)(l);i<(int)(r);++i)
#define FORr(i,l,r) for(int i=(int)(r)-1;i>=(int)(l);--i)
#define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it)
#define IN(l,v,r) ((l)<=(v) && (v)<(r))
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end())
//debug
#define DUMP(x) cerr << #x << " = " << (x)
#define LINE() cerr<< " (L" << __LINE__ << ")"
class range {
private:
struct Iter{
int v;
int operator*(){return v;}
bool operator!=(Iter& itr) {return v < itr.v;}
void operator++() {++v;}
};
Iter i, n;
public:
range(int n) : i({0}), n({n}) {}
range(int i, int n) : i({i}), n({n}) {}
Iter& begin() {return i;}
Iter& end() {return n;}
};
//output
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){REP(i,as.size()){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){REP(i,as.size()){if(i!=0)os<<endl; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}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 K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){os << get<0>(t);return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){os << get<0>(t)<<" "<<get<1>(t);return os;}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);return os;}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);return os;}
template<typename T1,typename T2,typename T3,typename T4,typename T5> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t);return os;}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t)<<" "<<get<5>(t);return os;}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6,typename T7> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6,T7>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t)<<" "<<get<5>(t)<<" "<<get<6>(t);return os;}
//input
char tmp[1000];
#define nextInt(n) scanf("%d",&n)
#define nextLong(n) scanf("%lld",&n) //I64d
#define nextDouble(n) scanf("%lf",&n)
#define nextChar(n) scanf("%c",&n)
#define nextString(n) scanf("%s",tmp);n=tmp
// values
template<typename T> T INF(){assert(false);};
template<> int INF<int>(){return 1<<28;};
template<> ll INF<ll>(){return 1LL<<58;};
template<> double INF<double>(){return 1e16;};
template<class T> T EPS(){assert(false);};
template<> int EPS<int>(){return 1;};
template<> ll EPS<ll>(){return 1LL;};
template<> double EPS<double>(){return 1e-8;};
template<> long double EPS<long double>(){return 1e-8;};
template<typename T,typename U> T pfmod(T v,U M){return fmod(fmod(v,M)+M,M);}
ll gcd_positive(ll a,ll b) { return b == 0 ? a : gcd_positive(b,a%b); }
ll gcd(ll a,ll b) { return gcd_positive(abs(a), abs(b)); }
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
class Main{
public:
void run(){
int N,L;scanf("%d %d",&N,&L);
L*=60;
vector<int> ms(N),ss(N);
REP(i,N)scanf("%d:%d",&ms[i],&ss[i]);
vector<int> ts(N);
REP(i,N)ts[i]=ms[i]*60+ss[i];
// ループ
int T=0;REP(i,N)T+=ts[i];
if(T<=L){
cout << N <<endl;return;
}
vector<double> fs(N+1);fs[0]=1;for(int i=1;i<=N;i++)fs[i]=i*fs[i-1];
double res=0;
// 1回ずつ使うナップサック
// c曲流すパターン数
vector<double> dp2(N+1);
double all=0;
REP(last,N){
vector<vector<double>> dp(N+1,vector<double>(L+1));
dp[0][0]=1;
REP(i,N)if(i!=last){
REPr(c,N+1)if(c-1>=0)REPr(l,L+1)if(l-ts[i]>=0)
dp[c][l] += dp[c-1][l-ts[i]];
}
// 集計
REP(c,N)for(int l=0;l<L;l++)if(l+ts[last]>=L){
dp2[c+1] += fs[c] * dp[c][l] * fs[N-(c+1)];
all += fs[c] * dp[c][l] * fs[N-(c+1)];
}
}
REP(c,N+1){
double v = c; double p = 1;
p *= dp2[c]/all;
res+=v * p;
}
cout << res <<endl;
}
};
int main(){
cout <<fixed<<setprecision(20);
cin.tie(0);
ios::sync_with_stdio(false);
Main().run();
return 0;
}