結果
| 問題 | No.2131 Concon Substrings (COuNt Version) |
| ユーザー |
 dyktr_06
|
| 提出日時 | 2022-11-25 22:04:52 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 74 ms / 2,000 ms |
| コード長 | 4,728 bytes |
| コンパイル時間 | 1,690 ms |
| コンパイル使用メモリ | 169,040 KB |
| 実行使用メモリ | 73,996 KB |
| 最終ジャッジ日時 | 2024-10-02 04:36:32 |
| 合計ジャッジ時間 | 3,179 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 22 ms
73,964 KB |
| testcase_01 | AC | 23 ms
73,812 KB |
| testcase_02 | AC | 21 ms
73,876 KB |
| testcase_03 | AC | 43 ms
73,912 KB |
| testcase_04 | AC | 21 ms
73,880 KB |
| testcase_05 | AC | 21 ms
73,828 KB |
| testcase_06 | AC | 22 ms
73,856 KB |
| testcase_07 | AC | 67 ms
73,852 KB |
| testcase_08 | AC | 34 ms
73,692 KB |
| testcase_09 | AC | 68 ms
73,804 KB |
| testcase_10 | AC | 74 ms
73,792 KB |
| testcase_11 | AC | 55 ms
73,880 KB |
| testcase_12 | AC | 53 ms
73,820 KB |
| testcase_13 | AC | 22 ms
73,796 KB |
| testcase_14 | AC | 36 ms
73,856 KB |
| testcase_15 | AC | 34 ms
73,896 KB |
| testcase_16 | AC | 22 ms
73,996 KB |
| testcase_17 | AC | 32 ms
73,800 KB |
| testcase_18 | AC | 32 ms
73,856 KB |
| testcase_19 | AC | 28 ms
73,900 KB |
コンパイルメッセージ
main.cpp: In function 'void in(T& ...)':
main.cpp:28:55: warning: fold-expressions only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
28 | template<class... T> void in(T&... a){ (cin >> ... >> a); }
| ^
main.cpp: In function 'void out(const T&, const Ts& ...)':
main.cpp:30:112: warning: fold-expressions only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
30 | template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
| ^
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef pair<long long, long long> P;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double PI = acos(-1);
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; i++){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }
template <long long Modulus>
struct ModInt{
long long val;
constexpr ModInt(const long long &_val = 0) noexcept : val(_val) {
normalize();
}
void normalize(){
val = (val % Modulus + Modulus) % Modulus;
}
inline ModInt& operator+=(const ModInt& rhs) noexcept {
if(val += rhs.val, val >= Modulus) val -= Modulus;
return *this;
}
inline ModInt& operator-=(const ModInt& rhs) noexcept {
if(val -= rhs.val, val < 0) val += Modulus;
return *this;
}
inline ModInt& operator*=(const ModInt& rhs) noexcept {
val = val * rhs.val % Modulus;
return *this;
}
inline ModInt& operator/=(const ModInt& rhs) noexcept {
val = val * inv(rhs.val).val % Modulus;
return *this;
}
inline ModInt& operator++() noexcept {
if(++val >= Modulus) val -= Modulus;
return *this;
}
inline ModInt operator++(int) noexcept {
ModInt t = val;
if(++val >= Modulus) val -= Modulus;
return t;
}
inline ModInt& operator--() noexcept {
if(--val < 0) val += Modulus;
return *this;
}
inline ModInt operator--(int) noexcept {
ModInt t = val;
if(--val < 0) val += Modulus;
return t;
}
inline ModInt operator-() const noexcept { return (Modulus - val) % Modulus; }
inline ModInt inv(void) const { return inv(val); }
ModInt inv(const long long& n) const {
long long a = n, b = Modulus, u = 1, v = 0;
while(b){
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= Modulus;
if(u < 0) u += Modulus;
return u;
}
friend inline ModInt operator+(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) += rhs; }
friend inline ModInt operator-(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) -= rhs; }
friend inline ModInt operator*(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) *= rhs; }
friend inline ModInt operator/(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) /= rhs; }
friend inline bool operator==(const ModInt& lhs, const ModInt& rhs) noexcept { return lhs.val == rhs.val; }
friend inline bool operator!=(const ModInt& lhs, const ModInt& rhs) noexcept { return lhs.val != rhs.val; }
friend inline istream& operator>>(istream& is, ModInt& x) noexcept {
is >> x.val;
x.normalize();
return is;
}
friend inline ostream& operator<<(ostream& os, const ModInt& x) noexcept { return os << x.val; }
};
using mint = ModInt<998244353>;
mint dp[3002][1002][3];
ll n;
void input(){
in(n);
}
void solve(){
dp[0][0][0] = 1;
rep(i, n){
for(int j = 0; j <= n / 3; j++){
rep(k, 3){
dp[i + 1][j + (k + 1) / 3][(k + 1) % 3] += dp[i][j][k];
dp[i + 1][j][k] += dp[i][j][k] * 25;
}
}
}
mint ans = 0;
for(int i = 0; i <= n / 3; i++){
rep(j, 3){
ans += dp[n][i][j] * i;
}
}
out(ans);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
input();
solve();
}