Submission #3236531
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
using ld = __float128;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)
const ll linf = 1e18;
const ld eps = 1e-12;
const ld pi = acos(-1);
template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
each(x,vec) is >> x;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
rep(i,vec.size()) {
if (i) os << " ";
os << vec[i];
}
return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
rep(i,vec.size()) {
if (i) os << endl;
os << vec[i];
}
return os;
}
using Row = vector<ld>;
using Matrix = vector<Row>;
Matrix E(ll n) {
Matrix res(n, Row(n, 0));
rep(i, n) res[i][i] = 1;
return res;
}
Matrix mul(const Matrix& A, const Matrix& B) {
const ll n = A.size(), m = A[0].size(), l = B[0].size();
assert(m == B.size());
Matrix res(n, Row(l, 0));
rep(i, n) rep(j, m) rep(k, l) {
res[i][k] += A[i][j] * B[j][k];
}
return res;
}
Row mul(const Matrix& A, const Row& x) {
Matrix tx(x.size());
rep(i, x.size()) tx[i] = Row(1, x[i]);
tx = mul(A, tx);
Row res(x.size());
rep(i, x.size()) res[i] = tx[i][0];
return res;
}
Matrix power(Matrix A, ll n) {
assert(A.size() == A[0].size());
Matrix res = E(A.size());
for (ll i = 1; i <= n; i <<= 1) {
if (i & n) res = mul(res, A);
A = mul(A, A);
}
return res;
}
int main() {
long double p; cin >> p;
ld pp = p;
ll n; cin >> n;
Matrix mat = power({{1-pp, pp}, {pp, 1-pp}}, n);
ld ans = mat[0][1];
cout << fixed << setprecision(18) << (long double)ans << endl;
}
Submission Info
Submission Time |
|
Task |
D - ぽよぽよ |
User |
drafear |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2284 Byte |
Status |
WA |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
0 / 100 |
Status |
|
Set Name |
Test Cases |
All |
00-sample-00, 00-sample-01, handmade-00, largest-00, largest-01, largest-02, largest-03, largest-04, largest-05, random-00-0499, random-01-0439, random-02-0683, random-03-0329, random-04-0177, random-05-0106, random-06-0659, random-07-0421, random-08-0087, random-09-0455, random-10-0777, random-11-0148, random-12-0737, random-13-0119, random-14-0513, random-15-0237, random-16-0988, random-17-0322, random-18-0152, random-19-0612, random-20-0789, random-21-0213, random-22-0291, random-23-0159, random-24-0618, random-25-0601, random-26-0726, random-27-0491, random-28-0324, random-29-0429, random-30-0825, random-31-0645, random-32-0108, random-33-0203, random-34-0802, random-35-0155, random-36-0458, random-37-0674, random-38-0551, random-39-0063, random-40-0026, random-41-0545, sample-00, sample-01 |
Case Name |
Status |
Exec Time |
Memory |
00-sample-00 |
WA |
1 ms |
256 KB |
00-sample-01 |
WA |
1 ms |
256 KB |
handmade-00 |
WA |
1 ms |
256 KB |
largest-00 |
WA |
1 ms |
256 KB |
largest-01 |
WA |
1 ms |
256 KB |
largest-02 |
WA |
1 ms |
256 KB |
largest-03 |
WA |
1 ms |
256 KB |
largest-04 |
WA |
1 ms |
256 KB |
largest-05 |
WA |
1 ms |
256 KB |
random-00-0499 |
WA |
1 ms |
256 KB |
random-01-0439 |
WA |
1 ms |
256 KB |
random-02-0683 |
WA |
1 ms |
256 KB |
random-03-0329 |
WA |
1 ms |
256 KB |
random-04-0177 |
WA |
1 ms |
256 KB |
random-05-0106 |
WA |
1 ms |
256 KB |
random-06-0659 |
WA |
1 ms |
256 KB |
random-07-0421 |
WA |
1 ms |
256 KB |
random-08-0087 |
WA |
1 ms |
256 KB |
random-09-0455 |
WA |
1 ms |
256 KB |
random-10-0777 |
WA |
1 ms |
256 KB |
random-11-0148 |
WA |
1 ms |
256 KB |
random-12-0737 |
WA |
1 ms |
256 KB |
random-13-0119 |
WA |
1 ms |
256 KB |
random-14-0513 |
WA |
1 ms |
256 KB |
random-15-0237 |
WA |
1 ms |
256 KB |
random-16-0988 |
WA |
1 ms |
256 KB |
random-17-0322 |
WA |
1 ms |
256 KB |
random-18-0152 |
WA |
1 ms |
256 KB |
random-19-0612 |
WA |
1 ms |
256 KB |
random-20-0789 |
WA |
1 ms |
256 KB |
random-21-0213 |
WA |
1 ms |
256 KB |
random-22-0291 |
WA |
1 ms |
256 KB |
random-23-0159 |
WA |
1 ms |
256 KB |
random-24-0618 |
WA |
1 ms |
256 KB |
random-25-0601 |
WA |
1 ms |
256 KB |
random-26-0726 |
WA |
1 ms |
256 KB |
random-27-0491 |
WA |
1 ms |
256 KB |
random-28-0324 |
WA |
1 ms |
256 KB |
random-29-0429 |
WA |
1 ms |
256 KB |
random-30-0825 |
WA |
1 ms |
256 KB |
random-31-0645 |
WA |
1 ms |
256 KB |
random-32-0108 |
WA |
1 ms |
256 KB |
random-33-0203 |
WA |
1 ms |
256 KB |
random-34-0802 |
WA |
1 ms |
256 KB |
random-35-0155 |
WA |
1 ms |
256 KB |
random-36-0458 |
WA |
1 ms |
256 KB |
random-37-0674 |
WA |
1 ms |
256 KB |
random-38-0551 |
WA |
1 ms |
256 KB |
random-39-0063 |
WA |
1 ms |
256 KB |
random-40-0026 |
WA |
1 ms |
256 KB |
random-41-0545 |
WA |
1 ms |
256 KB |
sample-00 |
WA |
1 ms |
256 KB |
sample-01 |
WA |
1 ms |
256 KB |