結果
問題 | No.108 トリプルカードコンプ |
ユーザー | uchiiii |
提出日時 | 2022-08-07 17:15:38 |
言語 | C++17(clang) (17.0.6 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 24 ms / 5,000 ms |
コード長 | 5,049 bytes |
コンパイル時間 | 3,321 ms |
コンパイル使用メモリ | 156,800 KB |
実行使用メモリ | 20,096 KB |
最終ジャッジ日時 | 2024-09-17 10:17:56 |
合計ジャッジ時間 | 4,122 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 1 ms
6,940 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,940 KB |
testcase_07 | AC | 24 ms
19,968 KB |
testcase_08 | AC | 23 ms
19,968 KB |
testcase_09 | AC | 24 ms
19,840 KB |
testcase_10 | AC | 23 ms
19,968 KB |
testcase_11 | AC | 24 ms
20,096 KB |
testcase_12 | AC | 2 ms
6,944 KB |
testcase_13 | AC | 4 ms
6,940 KB |
testcase_14 | AC | 4 ms
6,940 KB |
testcase_15 | AC | 3 ms
6,944 KB |
testcase_16 | AC | 4 ms
6,940 KB |
testcase_17 | AC | 4 ms
6,940 KB |
testcase_18 | AC | 22 ms
18,048 KB |
testcase_19 | AC | 19 ms
17,152 KB |
testcase_20 | AC | 23 ms
19,584 KB |
testcase_21 | AC | 23 ms
19,584 KB |
testcase_22 | AC | 20 ms
17,536 KB |
ソースコード
#include <algorithm> #include <array> #include <bitset> #include <cassert> #include <cctype> #include <cfenv> #include <cfloat> #include <chrono> #include <cinttypes> #include <climits> #include <cmath> #include <complex> #include <cstdarg> #include <cstddef> #include <cstdint> #include <cstdio> #include <cstdlib> #include <cstring> #include <deque> #include <fstream> #include <functional> #include <initializer_list> #include <iomanip> #include <ios> #include <iostream> #include <istream> #include <iterator> #include <limits> #include <list> #include <map> #include <memory> #include <new> #include <numeric> #include <ostream> #include <queue> #include <random> #include <set> #include <sstream> #include <stack> #include <streambuf> #include <string> #include <tuple> #include <type_traits> #include <typeinfo> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using ld = long double; using ll = long long; using ull = unsigned long long; #define endl "\n" #define FOR(i,a,b) for(int i=(a);i<=(b);i++) #define rep(i,n) for(int i=0;i<(n);i++) #define rrep(i,n) for(int i=(n)-1;i>=0;i--) #define REP(i,a,b) for(int i=(a);i<(b);i++) #define PII pair<int, int> #define PLL pair<ll, ll> #define ALL(x) (x).begin(), (x).end() #define QUERY int num_query;cin>>num_query; while(num_query--) // int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; void flush() {cout<<flush;} template <typename T> static constexpr T inf = numeric_limits<T>::max()/2; template<class T>vector<T> vec(int len, T elem) { return vector<T>(len, elem); } // auto dp = vec(52, vec(103, vec(103, INF))); template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; } template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; } template<class T>inline int popcount(T a) {return __builtin_popcountll(a);} template<class T>inline T emod(T a, T p) { return (a%p + p) % p;} template <typename T, size_t N> ostream &operator<<(ostream &os, const array<T, N> &arr) { os << '{'; for (auto v: arr) os << v << ','; cout << '}'; return os;} template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; } template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } 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) {os << '\n'; for (auto v : vec) os << v << ' '; os << '\n'; return os;} template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } struct MyIO { MyIO(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } IO_OI; #ifdef LOCAL void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #pragma GCC target("avx2") #pragma GCC optimize("03") #pragma GCC optimize("unroll-loops") #define debug(...) (void(0)) #define dump(x) (void(0)) #endif //------------------- int main() { int n;cin>>n; vector<int> A(n);cin>>A; vector<int> cnt(4, 0); rep(i, n) { if (A[i] >= 3) cnt[3] += 1; else cnt[A[i]] += 1; } auto dp = vec(n+1, vec(n+1, vec(n+1, (ld) 0.0))); rep(i, n+1) { rep(j, n+1) { rep(k, n+1) { if (i == 0 and j == 0 and k == 0) continue; if (i > 0 and j < n) dp[i][j][k] += i * dp[i-1][j+1][k]; if (j > 0 and k < n) dp[i][j][k] += j * dp[i][j-1][k+1]; if (k > 0) dp[i][j][k] += k * dp[i][j][k-1]; dp[i][j][k] += n; dp[i][j][k] /= (i + j + k); } } } debug(dp[0][0]); cout << dp[cnt[0]][cnt[1]][cnt[2]] << endl; }