Submission #1695510
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define _rep(i,n) _repl(i,0,n)
#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}
typedef vector<vector<double>> mat;
// return A*B
mat mat_mul(const mat &A, const mat &B){
int n=A.size(), m=B[0].size(), l=B.size();
mat ret(n, vector<double>(m, 0));
rep(i,n) rep(k,l) if(A[i][k]!=0) rep(j,m){
(ret[i][j] += A[i][k] * B[k][j]);
}
return ret;
}
// A^p
mat mat_pow(const mat &A, long p){
int n = A.size();
mat tmp(A), ret(n, vector<double>(n,0));
rep(i,n) ret[i][i] = 1;
while(p>0){
if(p&1) ret = mat_mul(tmp, ret);
tmp = mat_mul(tmp, tmp);
p /= 2.0;
}
return ret;
}
int main(){
double p; long n;
cin>>p>>n;
mat m = {{1.0-p, p}, {p, 1.0-p}};
m = mat_pow(m, n);
printf("%.9f\n", m[0][1]);
return 0;
}
Submission Info
Submission Time |
|
Task |
A - eject |
User |
tossy |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1625 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, 10-random_small-00, 10-random_small-01, 10-random_small-02, 10-random_small-03, 10-random_small-04, 10-random_small-05, 10-random_small-06, 10-random_small-07, 10-random_small-08, 10-random_small-09, 20-random_large-00, 20-random_large-01, 20-random_large-02, 20-random_large-03, 20-random_large-04, 20-random_large-05, 20-random_large-06, 20-random_large-07, 20-random_large-08, 20-random_large-09, 30-p_zero-00, 30-p_zero-01, 30-p_zero-02, 30-p_zero-03, 30-p_zero-04, 40-p_one-00, 40-p_one-01, 40-p_one-02, 40-p_one-03, 40-p_one-04, 90-handmade-00 |
Case Name |
Status |
Exec Time |
Memory |
00-sample-00 |
AC |
1 ms |
256 KB |
00-sample-01 |
AC |
1 ms |
256 KB |
10-random_small-00 |
AC |
1 ms |
256 KB |
10-random_small-01 |
AC |
1 ms |
256 KB |
10-random_small-02 |
AC |
1 ms |
256 KB |
10-random_small-03 |
AC |
1 ms |
256 KB |
10-random_small-04 |
AC |
1 ms |
256 KB |
10-random_small-05 |
AC |
1 ms |
256 KB |
10-random_small-06 |
AC |
1 ms |
256 KB |
10-random_small-07 |
AC |
1 ms |
256 KB |
10-random_small-08 |
AC |
1 ms |
256 KB |
10-random_small-09 |
AC |
1 ms |
256 KB |
20-random_large-00 |
WA |
1 ms |
256 KB |
20-random_large-01 |
WA |
1 ms |
256 KB |
20-random_large-02 |
WA |
1 ms |
256 KB |
20-random_large-03 |
WA |
1 ms |
256 KB |
20-random_large-04 |
WA |
1 ms |
256 KB |
20-random_large-05 |
WA |
1 ms |
256 KB |
20-random_large-06 |
WA |
1 ms |
256 KB |
20-random_large-07 |
WA |
1 ms |
256 KB |
20-random_large-08 |
WA |
1 ms |
256 KB |
20-random_large-09 |
WA |
1 ms |
256 KB |
30-p_zero-00 |
AC |
1 ms |
256 KB |
30-p_zero-01 |
AC |
1 ms |
256 KB |
30-p_zero-02 |
AC |
1 ms |
256 KB |
30-p_zero-03 |
AC |
1 ms |
256 KB |
30-p_zero-04 |
AC |
1 ms |
256 KB |
40-p_one-00 |
AC |
1 ms |
256 KB |
40-p_one-01 |
AC |
1 ms |
256 KB |
40-p_one-02 |
AC |
1 ms |
256 KB |
40-p_one-03 |
AC |
1 ms |
256 KB |
40-p_one-04 |
AC |
1 ms |
256 KB |
90-handmade-00 |
AC |
1 ms |
256 KB |