Submission #3943060
Source Code Expand
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cassert>
#include<ctime>
using namespace std;
#define mind(a,b) (a>b?b:a)
#define maxd(a,b) (a>b?a:b)
#define absd(x) (x<0?-(x):x)
#define pow2(x) ((x)*(x))
#define rep(i,n) for(int i=0; i<n; ++i)
#define repr(i,n) for(int i=n-1; i>=0; --i)
#define repl(i,s,n) for(int i=s; i<=n; ++i)
#define replr(i,s,n) for(int i=n; i>=s; --i)
#define repf(i,s,n,j) for(int i=s; i<=n; i+=j)
#define repe(e,obj) for(auto e : obj)
#define SP << " " <<
#define COL << " : " <<
#define COM << ", " <<
#define ARR << " -> " <<
#define PNT(STR) cout << STR << endl
#define POS(X,Y) "(" << X << ", " << Y << ")"
#define DEB(A) " (" << #A << ") " << A
#define DEBREP(i,n,val) for(int i=0; i<n; ++i) cout << val << " "; cout << endl
#define ALL(V) (V).begin(), (V).end()
#define INF 1000000007
#define INFLL 1000000000000000007LL
#define EPS 1e-9
typedef unsigned int uint;
typedef unsigned long ulong;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define P_TYPE int
typedef pair<P_TYPE, P_TYPE> P;
typedef pair<P, P_TYPE> PI;
typedef pair<P_TYPE, P> IP;
typedef pair<P, P> PP;
typedef priority_queue<P, vector<P>, greater<P> > pvqueue;
#define N 305
int n;
double memo[N][N][N];
double dfs(int a, int b, int c) {
if(memo[a][b][c] >= -1) {
return memo[a][b][c];
}
double r = 0;
if(a) {
r += (dfs(a-1, b, c)+1) * a;
}
if(b) {
r += (dfs(a+1, b-1, c)+1) * b;
}
if(c) {
r += (dfs(a, b+1, c-1)+1) * c;
}
int p = (a + b + c);
return memo[a][b][c] = (r + n - p) / p;
}
int c[4];
int main() {
cin >> n;
rep(i, n) {
int a; cin >> a;
++c[a];
}
rep(a, N) {
rep(b, N) {
rep(c, N) {
memo[a][b][c] = -2;
}
}
}
memo[0][0][0] = 0;
printf("%.10f\n", dfs(c[1], c[2], c[3]));
return 0;
}
Submission Info
| Submission Time |
|
| Task |
J - Sushi |
| User |
yaketake08 |
| Language |
C++14 (GCC 5.4.1) |
| Score |
100 |
| Code Size |
2079 Byte |
| Status |
AC |
| Exec Time |
180 ms |
| Memory |
221952 KiB |
Judge Result
| Set Name |
All |
| Score / Max Score |
100 / 100 |
| Status |
|
| Set Name |
Test Cases |
| All |
0_00, 0_01, 0_02, 0_03, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11, 1_12, 1_13, 1_14, 1_15, 1_16, 1_17 |
| Case Name |
Status |
Exec Time |
Memory |
| 0_00 |
AC |
57 ms |
221952 KiB |
| 0_01 |
AC |
57 ms |
221952 KiB |
| 0_02 |
AC |
57 ms |
221952 KiB |
| 0_03 |
AC |
57 ms |
221952 KiB |
| 1_00 |
AC |
57 ms |
221952 KiB |
| 1_01 |
AC |
57 ms |
221952 KiB |
| 1_02 |
AC |
57 ms |
221952 KiB |
| 1_03 |
AC |
57 ms |
221952 KiB |
| 1_04 |
AC |
59 ms |
221952 KiB |
| 1_05 |
AC |
180 ms |
221952 KiB |
| 1_06 |
AC |
58 ms |
221952 KiB |
| 1_07 |
AC |
118 ms |
221952 KiB |
| 1_08 |
AC |
163 ms |
221952 KiB |
| 1_09 |
AC |
128 ms |
221952 KiB |
| 1_10 |
AC |
124 ms |
221952 KiB |
| 1_11 |
AC |
151 ms |
221952 KiB |
| 1_12 |
AC |
156 ms |
221952 KiB |
| 1_13 |
AC |
174 ms |
221952 KiB |
| 1_14 |
AC |
173 ms |
221952 KiB |
| 1_15 |
AC |
177 ms |
221952 KiB |
| 1_16 |
AC |
177 ms |
221952 KiB |
| 1_17 |
AC |
179 ms |
221952 KiB |