結果
問題 | No.173 カードゲーム(Medium) |
ユーザー | fumiphys |
提出日時 | 2019-09-23 15:59:31 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2,007 ms / 3,000 ms |
コード長 | 4,017 bytes |
コンパイル時間 | 1,883 ms |
コンパイル使用メモリ | 176,180 KB |
実行使用メモリ | 4,348 KB |
最終ジャッジ日時 | 2023-10-19 08:10:52 |
合計ジャッジ時間 | 14,504 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
4,348 KB |
testcase_01 | AC | 200 ms
4,348 KB |
testcase_02 | AC | 1,678 ms
4,348 KB |
testcase_03 | AC | 1,654 ms
4,348 KB |
testcase_04 | AC | 1,639 ms
4,348 KB |
testcase_05 | AC | 1,397 ms
4,348 KB |
testcase_06 | AC | 1,181 ms
4,348 KB |
testcase_07 | AC | 1,067 ms
4,348 KB |
testcase_08 | AC | 1,059 ms
4,348 KB |
testcase_09 | AC | 2,007 ms
4,348 KB |
ソースコード
// 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_; int main(int argc, char const* argv[]) { int n; double pa, pb; cin >> n >> pa >> pb; vector<int> a(n), b(n); cin >> a >> b; sort(all(a)); sort(all(b)); int all = 0; int win = 0; random_device rnd; mt19937 mt(rnd()); uniform_real_distribution<> randd(0., 1.); rep(i, 1000000){ int A = 0, B = 0; vector<int> sa = a, sb = b; rep(j, n){ auto sel = [&](vector<int> &s, double p){ if(sz(s) == 1)return s[0]; double pr = randd(mt); if(pr <= p){ int res = s[0]; s.erase(s.begin()); return res; }else{ pr = (pr - p) / (1. - p); int k = 1 + pr * (sz(s) - 1); int res = s[k]; s.erase(s.begin() + k); return res; } }; int AA = sel(sa, pa); int BB = sel(sb, pb); if(AA > BB)A += AA + BB; else B += AA + BB; } if(A > B)win++; all++; } cout << (double)win / (double)all << endl; return 0; }