結果
問題 | No.2222 Respawn |
ユーザー | torisasami4 |
提出日時 | 2023-02-17 23:10:01 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 17 ms / 2,000 ms |
コード長 | 6,217 bytes |
コンパイル時間 | 2,796 ms |
コンパイル使用メモリ | 223,992 KB |
実行使用メモリ | 8,576 KB |
最終ジャッジ日時 | 2024-07-19 14:21:48 |
合計ジャッジ時間 | 3,669 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 1 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 1 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 1 ms
5,376 KB |
testcase_13 | AC | 5 ms
6,940 KB |
testcase_14 | AC | 4 ms
6,016 KB |
testcase_15 | AC | 3 ms
5,376 KB |
testcase_16 | AC | 4 ms
5,632 KB |
testcase_17 | AC | 3 ms
5,376 KB |
testcase_18 | AC | 7 ms
8,576 KB |
testcase_19 | AC | 7 ms
8,448 KB |
testcase_20 | AC | 7 ms
8,576 KB |
testcase_21 | AC | 6 ms
8,192 KB |
testcase_22 | AC | 7 ms
8,320 KB |
testcase_23 | AC | 7 ms
8,448 KB |
testcase_24 | AC | 7 ms
8,448 KB |
testcase_25 | AC | 7 ms
8,320 KB |
testcase_26 | AC | 7 ms
8,448 KB |
testcase_27 | AC | 7 ms
8,448 KB |
testcase_28 | AC | 8 ms
8,448 KB |
testcase_29 | AC | 7 ms
8,448 KB |
testcase_30 | AC | 7 ms
8,448 KB |
testcase_31 | AC | 6 ms
8,576 KB |
testcase_32 | AC | 17 ms
8,448 KB |
ソースコード
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math") #include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < int(n); i++) #define per(i, n) for (int i = (n)-1; 0 <= i; i--) #define rep2(i, l, r) for (int i = (l); i < int(r); i++) #define per2(i, l, r) for (int i = (r)-1; int(l) <= i; i--) #define each(e, v) for (auto& e : v) #define MM << " " << #define pb push_back #define eb emplace_back #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define sz(x) (int)x.size() template <typename T> void print(const vector<T>& v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; template <typename T> bool chmax(T& x, const T& y) { return (x < y) ? (x = y, true) : false; } template <typename T> bool chmin(T& x, const T& y) { return (x > y) ? (x = y, true) : false; } template <class T> using minheap = std::priority_queue<T, std::vector<T>, std::greater<T>>; template <class T> using maxheap = std::priority_queue<T>; template <typename T> int lb(const vector<T>& v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template <typename T> int ub(const vector<T>& v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template <typename T> void rearrange(vector<T>& v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } // __int128_t gcd(__int128_t a, __int128_t b) { // if (a == 0) // return b; // if (b == 0) // return a; // __int128_t cnt = a % b; // while (cnt != 0) { // a = b; // b = cnt; // cnt = a % b; // } // return b; // } long long extGCD(long long a, long long b, long long& x, long long& y) { if (b == 0) { x = 1; y = 0; return a; } long long d = extGCD(b, a % b, y, x); y -= a / b * x; return d; } struct UnionFind { vector<int> data; int num; UnionFind(int sz) { data.assign(sz, -1); num = sz; } bool unite(int x, int y) { x = find(x), y = find(y); if (x == y) return (false); if (data[x] > data[y]) swap(x, y); data[x] += data[y]; data[y] = x; num--; return (true); } int find(int k) { if (data[k] < 0) return (k); return (data[k] = find(data[k])); } int size(int k) { return (-data[find(k)]); } bool same(int x, int y) { return find(x) == find(y); } int operator[](int k) { return find(k); } }; template <int mod> struct Mod_Int { int x; Mod_Int() : x(0) {} Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} static int get_mod() { return mod; } Mod_Int& operator+=(const Mod_Int& p) { if ((x += p.x) >= mod) x -= mod; return *this; } Mod_Int& operator-=(const Mod_Int& p) { if ((x += mod - p.x) >= mod) x -= mod; return *this; } Mod_Int& operator*=(const Mod_Int& p) { x = (int)(1LL * x * p.x % mod); return *this; } Mod_Int& operator/=(const Mod_Int& p) { *this *= p.inverse(); return *this; } Mod_Int& operator++() { return *this += Mod_Int(1); } Mod_Int operator++(int) { Mod_Int tmp = *this; ++*this; return tmp; } Mod_Int& operator--() { return *this -= Mod_Int(1); } Mod_Int operator--(int) { Mod_Int tmp = *this; --*this; return tmp; } Mod_Int operator-() const { return Mod_Int(-x); } Mod_Int operator+(const Mod_Int& p) const { return Mod_Int(*this) += p; } Mod_Int operator-(const Mod_Int& p) const { return Mod_Int(*this) -= p; } Mod_Int operator*(const Mod_Int& p) const { return Mod_Int(*this) *= p; } Mod_Int operator/(const Mod_Int& p) const { return Mod_Int(*this) /= p; } bool operator==(const Mod_Int& p) const { return x == p.x; } bool operator!=(const Mod_Int& p) const { return x != p.x; } Mod_Int inverse() const { assert(*this != Mod_Int(0)); return pow(mod - 2); } Mod_Int pow(long long k) const { Mod_Int now = *this, ret = 1; for (; k > 0; k >>= 1, now *= now) { if (k & 1) ret *= now; } return ret; } friend ostream& operator<<(ostream& os, const Mod_Int& p) { return os << p.x; } friend istream& operator>>(istream& is, Mod_Int& p) { long long a; is >> a; p = Mod_Int<mod>(a); return is; } }; ll mpow2(ll x, ll n, ll mod) { ll ans = 1; x %= mod; while (n != 0) { if (n & 1) ans = ans * x % mod; x = x * x % mod; n = n >> 1; } ans %= mod; return ans; } ll modinv2(ll a, ll mod) { ll b = mod, u = 1, v = 0; while (b) { ll t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= mod; if (u < 0) u += mod; return u; } ll divide_int(ll a, ll b) { if (b < 0) a = -a, b = -b; return (a >= 0 ? a / b : (a - b + 1) / b); } // const int MOD = 1000000007; const int MOD = 998244353; using mint = Mod_Int<MOD>; mint mpow(mint x, ll n) { bool rev = n < 0; n = abs(n); mint ans = 1; while (n != 0) { if (n & 1) ans *= x; x *= x; n = n >> 1; } return (rev ? ans.inverse() : ans); } // ----- library ------- // ----- library ------- int main() { ios::sync_with_stdio(false); std::cin.tie(nullptr); cout << fixed << setprecision(15); int n; string s; cin >> n >> s; s += '#'; vector<double> f(n + 1, 0), g0(n + 1, 0), g1(n + 1, 0); per(i, n + 1) { if (i + 1 == n) continue; if (s[i] == '#') { g1[i] = 1; continue; } double p = g0[i + 1] + g0[i + 2] + 3, q = g1[i + 1] + g1[i + 2] + 1; f[i] = (p / 3) / (1 - q / 3); g0[i] = (g0[i + 1] + g0[i + 2] + f[i]) / 3 + 1; g1[i] = (g1[i + 1] + g1[i + 2]) / 3; } cout << f[0] << endl; }