結果
問題 | No.1481 Rotation ABC |
ユーザー | Aoxiang Cui |
提出日時 | 2021-10-07 00:06:06 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 9 ms / 2,000 ms |
コード長 | 4,671 bytes |
コンパイル時間 | 1,170 ms |
コンパイル使用メモリ | 117,488 KB |
実行使用メモリ | 6,912 KB |
最終ジャッジ日時 | 2024-07-23 03:02:48 |
合計ジャッジ時間 | 2,500 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
5,248 KB |
testcase_01 | AC | 4 ms
5,376 KB |
testcase_02 | AC | 4 ms
5,376 KB |
testcase_03 | AC | 3 ms
5,376 KB |
testcase_04 | AC | 3 ms
5,376 KB |
testcase_05 | AC | 4 ms
5,376 KB |
testcase_06 | AC | 4 ms
5,376 KB |
testcase_07 | AC | 4 ms
5,376 KB |
testcase_08 | AC | 4 ms
5,376 KB |
testcase_09 | AC | 4 ms
5,376 KB |
testcase_10 | AC | 4 ms
5,376 KB |
testcase_11 | AC | 4 ms
5,376 KB |
testcase_12 | AC | 4 ms
5,376 KB |
testcase_13 | AC | 8 ms
6,400 KB |
testcase_14 | AC | 8 ms
6,528 KB |
testcase_15 | AC | 7 ms
6,400 KB |
testcase_16 | AC | 7 ms
6,016 KB |
testcase_17 | AC | 6 ms
5,888 KB |
testcase_18 | AC | 8 ms
6,784 KB |
testcase_19 | AC | 7 ms
5,760 KB |
testcase_20 | AC | 6 ms
5,888 KB |
testcase_21 | AC | 8 ms
6,528 KB |
testcase_22 | AC | 7 ms
5,632 KB |
testcase_23 | AC | 9 ms
6,784 KB |
testcase_24 | AC | 8 ms
6,784 KB |
testcase_25 | AC | 9 ms
6,784 KB |
testcase_26 | AC | 9 ms
6,784 KB |
testcase_27 | AC | 9 ms
6,912 KB |
testcase_28 | AC | 8 ms
6,912 KB |
testcase_29 | AC | 8 ms
6,784 KB |
testcase_30 | AC | 7 ms
6,784 KB |
testcase_31 | AC | 7 ms
6,912 KB |
testcase_32 | AC | 8 ms
6,784 KB |
testcase_33 | AC | 7 ms
6,912 KB |
testcase_34 | AC | 7 ms
6,912 KB |
testcase_35 | AC | 8 ms
6,784 KB |
testcase_36 | AC | 8 ms
6,912 KB |
testcase_37 | AC | 8 ms
6,784 KB |
testcase_38 | AC | 7 ms
6,784 KB |
testcase_39 | AC | 7 ms
6,784 KB |
testcase_40 | AC | 8 ms
6,784 KB |
ソースコード
// #define LOCAL #define _USE_MATH_DEFINES #include <array> #include <cassert> #include <cstdio> #include <cstring> #include <iostream> #include <iomanip> #include <string> #include <sstream> #include <vector> #include <queue> #include <stack> #include <list> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <algorithm> #include <complex> #include <cmath> #include <numeric> #include <bitset> #include <functional> #include <random> #include <ctime> using namespace std; template <typename A, typename B> ostream& operator <<(ostream& out, const pair<A, B>& a) { out << "(" << a.first << "," << a.second << ")"; return out; } template <typename T, size_t N> ostream& operator <<(ostream& out, const array<T, N>& a) { out << "["; bool first = true; for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]"; return out; } template <typename T> ostream& operator <<(ostream& out, const vector<T>& a) { out << "["; bool first = true; for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]"; return out; } template <typename T, class Cmp> ostream& operator <<(ostream& out, const set<T, Cmp>& a) { out << "{"; bool first = true; for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}"; return out; } template <typename U, typename T, class Cmp> ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) { out << "{"; bool first = true; for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}"; return out; } #ifdef LOCAL #define trace(...) __f(#__VA_ARGS__, __VA_ARGS__) #else #define trace(...) 42 #endif template <typename Arg1> void __f(const char* name, Arg1&& arg1){ cerr << name << ": " << arg1 << endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args){ const char* comma = strchr(names + 1, ','); cerr.write(names, comma - names) << ": " << arg1 << " |"; __f(comma + 1, args...); } template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); } template <class T, class... D> auto vect(const T& v, int n, D... m) { return vector<decltype(vect(v, m...))>(n, vect(v, m...)); } typedef long long int64; typedef pair<int, int> ii; #define SZ(x) (int)((x).size()) template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2; // const int MOD = 1e9 + 7; const int MOD = 998244353; mt19937 mrand(random_device{}()); int rnd(int x) { return mrand() % x; } // mt19937_64 mrand(random_device{}()); // int64 rnd(int64 x) { return mrand() % x; } template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; } template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); } void add(int& x, int y) { x += y; if (x >= MOD) x -= MOD; } struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); }; } fast_ios_; const int N = 1e5 + 10; int fact[N], ifact[N], inv[N]; struct comb_init { comb_init() { inv[1] = 1; for (int i = 2; i < N; ++i) { inv[i] = (MOD - MOD / i) * (int64)inv[MOD % i] % MOD; } fact[0] = ifact[0] = 1; for (int i = 1; i < N; ++i) { fact[i] = (int64)fact[i - 1] * i % MOD; ifact[i] = (int64)ifact[i - 1] * inv[i] % MOD; } } } comb_init_; int64 comb(int n, int m) { if (n < m || m < 0) return 0; return (int64)fact[n] * ifact[m] % MOD * ifact[n - m] % MOD; } int main() { int n; string s; cin >> n >> s; vector<array<int, 3>> pre(n + 1); vector<array<int, 3>> suf(n + 1); for (int i = 0; i < n; ++i) { pre[i + 1] = pre[i]; int k = s[i] - 'A'; pre[i + 1][k]++; } for (int i = n - 1; i >= 0; --i) { suf[i] = suf[i + 1]; int k = s[i] - 'A'; suf[i][k]++; } bool found = false; for (int k = 0; k < 3; ++k) { for (int i = 0; i < n; ++i) { if (k == 1 && i == 2) trace(s[i] - 'A', pre[i][(k + 2) % 3], suf[i + 1][(k + 1) % 3]); if (s[i] - 'A' == k && pre[i][(k + 2) % 3] && suf[i + 1][(k + 1) % 3]) found = true; } } if (!found) { cout << 1 << '\n'; return 0; } array<int, 3> cnt {}; for (auto& c : s) { cnt[c - 'A']++; } int ret = fact[n]; for (int k = 0; k < 3; ++k) { ret = 1LL * ret * ifact[cnt[k]] % MOD; } ret = (ret + MOD - n) % MOD; cout << ret << '\n'; return 0; }