結果
問題 | No.2524 Stripes |
ユーザー |
|
提出日時 | 2025-01-29 02:14:11 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 5,375 bytes |
コンパイル時間 | 1,488 ms |
コンパイル使用メモリ | 149,532 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2025-01-29 02:14:17 |
合計ジャッジ時間 | 6,140 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 10 RE * 15 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:153:16: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 153 | freopen(task".inp","r",stdin); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ main.cpp:154:16: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 154 | freopen(task".out","w",stdout); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp:158:16: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 158 | freopen(task1".inp","r",stdin); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp:159:16: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 159 | freopen(task1".out","w",stdout); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
ソースコード
// #pragma GCC optimize("Ofast,unroll-loops")// #pragma GCC target("avx2,tune=native")#include <algorithm>#include <bitset>#include <complex>#include <deque>#include <exception>#include <fstream>#include <functional>#include <iomanip>#include <ios>#include <iosfwd>#include <iostream>#include <istream>#include <iterator>#include <limits>#include <locale>#include <map>#include <new>#include <numeric>#include <ostream>#include <queue>#include <set>#include <unordered_set>#include <sstream>#include <stack>#include <stdexcept>#include <streambuf>#include <string>#include <utility>#include <valarray>#include <vector>#include <cstring>#include <unordered_map>#include <cmath>#include <array>#include <cassert>#include <random>#include <chrono>using namespace std;#define BIT(i,j) (((i)>>(j))&1LL)#define MASK(i) (1LL<<(i))#define ALL(x) (x).begin(),(x).end()#define SZ(x) (int)(x).size()#define fi first#define se second#define ull ungsigned long long#define ll long long#define ld long double#define vi vector<int>#define vvi vector<vi>#define vvvi vector<vvi>#define pii pair<int,int>#define vpii vector<pii>#define vvpii vector<vpii>#define REPDIS(i,be,en,j) for(int i = (be); i<=(en); i+=j)#define REPD(i,be,en) for(int i = (be); i>=(en); i--)#define REP(i,be,en) for(int i = (be); i<=(en); i++)#define endl "\n"#define MP make_pair#define int ll//-----------------------------------------------------------------------------------------------//inline void scan(){} template<typename F, typename... R> inline void scan(F &f,R&... r){cin>>f;scan(r...);}inline void print(){} template<typename F, typename... R> inline void print(F f,R... r){cout<<f;print(r...);}//-----------------------------------------------------------------------------------------------//void __print(int x) {cerr << x;}void __print(long x) {cerr << x;}void __print(unsigned x) {cerr << x;}void __print(unsigned long x) {cerr << x;}void __print(unsigned long long x) {cerr << x;}void __print(float x) {cerr << x;}void __print(double x) {cerr << x;}void __print(long double x) {cerr << x;}void __print(char x) {cerr << '\'' << x << '\'';}void __print(const char *x) {cerr << '\"' << x << '\"';}void __print(const string &x) {cerr << '\"' << x << '\"';}void __print(bool x) {cerr << (x ? "true" : "false");}template<typename T, typename V>void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}template<typename T>void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}void _print() {cerr << "]\n";}template <typename T, typename... V>void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}#ifndef ONLINE_JUDGE#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)#else#define debug(x...)#endif//------------------------------------------------------------------------------------------------//const ll LINF = 1e18;const int INF = 1e9;const int LOG = 20;const int MAXN = 4e2+7;const int N = 1e2+3;const int MOD = 998244353;const int BASE = 1e5;const ld EPS = 1e-9;const ld PI = acos(-1);const int OFFSET = 1e3;//------------------------------------------------------------------------------------------------//template<typename T1, typename T2> bool mini(T1 &a, T2 b){if(a>b){a=b;return true;}return false;}template<typename T1, typename T2> bool maxi(T1 &a, T2 b){if(a<b){a=b;return true;}return false;}template<typename T> T gcd(T a, T b) { while(b) { a %= b; swap(a,b); } return a; }template<typename T> T lcm(T a, T b) { return a/gcd(a,b)*b; }//------------------------------------------------------------------------------------------------///*----------------------------------------------------------------END OF TEMPLATE----------------------------------------------------------------*/void add(int &a, int b){a += b;if(a>=MOD) a -= MOD;}int dp[MAXN][MAXN],res[MAXN];void solve(){int n; cin >> n;string s; cin >> s;s = " "+s;for(int i = 1; i<=n; i++){dp[i][1] = 1;for(int j = 1; j<i; j++){if(s[i]==s[j]) continue;for(int k = 2; k<=i; k++){add(dp[i][k],dp[j][k-1]);}}}for(int i = 1; i<=n; i++){for(int j = 1; j<=i; j++){add(res[j],dp[i][j]);}}for(int i = 1; i<=n; i++) cout << res[i] << endl;}signed main(){ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);#define task "test"if(fopen(task".inp","r")){freopen(task".inp","r",stdin);freopen(task".out","w",stdout);}#define task1 "nothing"if(fopen(task1".inp","r")){freopen(task1".inp","r",stdin);freopen(task1".out","w",stdout);}int test = 1;while(test--){solve();}cerr << "\nTime elapsed: " << 1000*clock()/CLOCKS_PER_SEC << "ms\n";return 0;}/** /\_/\* (= ._.)* / >TL \>AC**/