結果
問題 | No.210 探し物はどこですか? |
ユーザー | shimomire |
提出日時 | 2015-05-16 01:07:41 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 918 ms / 2,000 ms |
コード長 | 6,614 bytes |
コンパイル時間 | 1,008 ms |
コンパイル使用メモリ | 126,096 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-06 04:38:13 |
合計ジャッジ時間 | 7,851 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 87 ms
5,248 KB |
testcase_01 | AC | 457 ms
5,376 KB |
testcase_02 | AC | 918 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 7 ms
5,376 KB |
testcase_09 | AC | 6 ms
5,376 KB |
testcase_10 | AC | 6 ms
5,376 KB |
testcase_11 | AC | 5 ms
5,376 KB |
testcase_12 | AC | 5 ms
5,376 KB |
testcase_13 | AC | 8 ms
5,376 KB |
testcase_14 | AC | 5 ms
5,376 KB |
testcase_15 | AC | 5 ms
5,376 KB |
testcase_16 | AC | 5 ms
5,376 KB |
testcase_17 | AC | 4 ms
5,376 KB |
testcase_18 | AC | 52 ms
5,376 KB |
testcase_19 | AC | 55 ms
5,376 KB |
testcase_20 | AC | 51 ms
5,376 KB |
testcase_21 | AC | 53 ms
5,376 KB |
testcase_22 | AC | 52 ms
5,376 KB |
testcase_23 | AC | 20 ms
5,376 KB |
testcase_24 | AC | 16 ms
5,376 KB |
testcase_25 | AC | 17 ms
5,376 KB |
testcase_26 | AC | 18 ms
5,376 KB |
testcase_27 | AC | 27 ms
5,376 KB |
testcase_28 | AC | 268 ms
5,376 KB |
testcase_29 | AC | 268 ms
5,376 KB |
testcase_30 | AC | 259 ms
5,376 KB |
testcase_31 | AC | 267 ms
5,376 KB |
testcase_32 | AC | 268 ms
5,376 KB |
testcase_33 | AC | 36 ms
5,376 KB |
testcase_34 | AC | 37 ms
5,376 KB |
testcase_35 | AC | 34 ms
5,376 KB |
testcase_36 | AC | 42 ms
5,376 KB |
testcase_37 | AC | 36 ms
5,376 KB |
testcase_38 | AC | 448 ms
5,376 KB |
testcase_39 | AC | 463 ms
5,376 KB |
testcase_40 | AC | 489 ms
5,376 KB |
testcase_41 | AC | 451 ms
5,376 KB |
testcase_42 | AC | 459 ms
5,376 KB |
testcase_43 | AC | 2 ms
5,376 KB |
testcase_44 | AC | 1 ms
5,376 KB |
testcase_45 | AC | 2 ms
5,376 KB |
ソースコード
#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; typedef long long ll; typedef unsigned long long ull; #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;} }; struct rrange{ struct Iter{ int v,step; Iter& operator++(){v-=step;return *this;} bool operator!=(Iter& itr){return v>itr.v;} int& operator*(){return v;} }; Iter i, n; rrange(int i, int n,int step):i({i-1,step}), n({n-1,step}){} rrange(int i, int n):rrange(i,n,1){} rrange(int n) :rrange(0,n){} Iter& begin(){return n;} Iter& end(){return i;} }; //input template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){is>>p.first>>p.second;return is;} template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){is >> get<0>(t);return is;} template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){is >> get<0>(t) >> get<1>(t);return is;} template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){is >>get<0>(t)>>get<1>(t)>>get<2>(t);return is;} template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);return is;} template<typename T1,typename T2,typename T3,typename T4,typename T5> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5>& t){is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t);return is;} template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5,T6>& t){is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t) >> get<5>(t);return is;} template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6,typename T7> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5,T6,T7>& t){is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t) >> get<5>(t) >> get<6>(t);return is;} template<typename T> istream& operator >> (istream& is,vector<T>& as){REP(i,as.size())is >>as[i];return is;} //output 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;} 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;} //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<> long double INF<long 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 pmod(T v,U M){return (v%M+M)%M;} class Main{ public: void run(){ // 100000 * int N;cin >> N; vector<long double> ps(N),qs(N); cin >> ps >> qs; for(int i:range(N))ps[i]/=1000; for(int i:range(N))qs[i]/=100; long double res = 0; priority_queue<tuple<long double,int,int>> que; for(int i:range(N))que.push(make_tuple(ps[i]*qs[i],i,1)); int t = 1; while(!que.empty()){ long double p;int i;int k;tie(p,i,k)=que.top();que.pop(); if(p<1e-8 && t*p<1e-8)break; res += t * p; que.push(make_tuple(ps[i]*qs[i]*pow(1-qs[i],k),i,k+1)); t++; } cout << res <<endl; } }; int main(){ cout <<fixed<<setprecision(20); cin.tie(0); ios::sync_with_stdio(false); Main().run(); return 0; }