結果

問題 No.2524 Stripes
ユーザー 👑 amentorimaruamentorimaru
提出日時 2023-10-31 23:25:11
言語 C++17(clang)
(17.0.6 + boost 1.83.0)
結果
AC  
実行時間 945 ms / 7,000 ms
コード長 4,991 bytes
コンパイル時間 4,098 ms
コンパイル使用メモリ 153,736 KB
実行使用メモリ 12,968 KB
最終ジャッジ日時 2023-10-31 23:25:27
合計ジャッジ時間 13,957 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,372 KB
testcase_01 AC 1 ms
4,372 KB
testcase_02 AC 1 ms
4,372 KB
testcase_03 AC 459 ms
7,688 KB
testcase_04 AC 14 ms
4,372 KB
testcase_05 AC 220 ms
5,648 KB
testcase_06 AC 483 ms
7,576 KB
testcase_07 AC 565 ms
9,160 KB
testcase_08 AC 591 ms
8,956 KB
testcase_09 AC 110 ms
4,732 KB
testcase_10 AC 425 ms
7,408 KB
testcase_11 AC 13 ms
4,372 KB
testcase_12 AC 98 ms
4,600 KB
testcase_13 AC 902 ms
10,912 KB
testcase_14 AC 932 ms
10,776 KB
testcase_15 AC 927 ms
10,936 KB
testcase_16 AC 945 ms
12,968 KB
testcase_17 AC 542 ms
8,168 KB
testcase_18 AC 1 ms
4,372 KB
testcase_19 AC 1 ms
4,372 KB
testcase_20 AC 1 ms
4,372 KB
testcase_21 AC 1 ms
4,372 KB
testcase_22 AC 2 ms
4,372 KB
testcase_23 AC 2 ms
4,372 KB
testcase_24 AC 2 ms
4,372 KB
testcase_25 AC 1 ms
4,372 KB
testcase_26 AC 2 ms
4,372 KB
testcase_27 AC 2 ms
4,372 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define ATCODER
#define _USE_MATH_DEFINES
#include<stdio.h>
#include<iostream>
#include<fstream>
#include<algorithm>
#include<vector>
#include<string>
#include <cassert>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <math.h>
#include <climits>
#include <set>
#include <map>
#include <list>
#include <random>
#include <iterator>
#include <bitset>
#include <chrono>

using namespace std;

using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;

//template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;

#define FOR(i, a, b) for(ll i=(a); i<(b);i++)
#define REP(i, n) for(ll i=0; i<(n);i++)
#define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--)
#define PER(i, n) for(ll i=n-1; i>=0;i--)
#define REPREP(i,j,a,b) for(ll i=0;i<a;i++)for(ll j=0;j<b;j++)
#define VV(type) vector< vector<type> >
#define VV2(type,n,m,val) vector< vector<type> > val;val.resize(n);for(ll i;i<n;i++)val[i].resize(m)
#define vec(type) vector<type>
#define VEC(type,n,val) vector<type> val;val.resize(n)
#define VL vector<ll>
#define VVL vector< vector<ll> >
#define VP vector< pair<ll,ll> >
#define SZ size()
#define all(i) begin(i),end(i)
#define SORT(i) sort(all(i))
#define BITI(i) (1<<i)
#define BITSET(x,i) x | (ll(1)<<i)
#define BITCUT(x,i) x & ~(ll(1)<<i)
#define EXISTBIT(x,i) (((x>>i) & 1) != 0)
#define ALLBIT(n) (ll(1)<<n-1)
#define CHMAX(n,v) n=n<v?v:n
#define CHMIN(n,v) n=n>v?v:n
#define MP(a,b) make_pair(a,b)
#define DET2(x1,y1,x2,y2) x1*y2-x2*y1
#define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2
#define INC(a) for(auto& v:a)v++;
#define DEC(a) for(auto& v:a)v--;
#define SQU(x) (x)*(x)
#define L0 ll(0)
#ifdef ATCODER
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using mint2 = modint998244353;
#endif
template<typename T = ll>
vector<T> read(size_t n) {
  vector<T> ts(n);
  for (size_t i = 0; i < n; i++) cin >> ts[i];
  return ts;
}

template<typename TV, const ll N> void read_tuple_impl(TV&) {}
template<typename TV, const ll N, typename Head, typename... Tail>
void read_tuple_impl(TV& ts) {
  get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));
  read_tuple_impl<TV, N + 1, Tail...>(ts);
}
template<typename... Ts> decltype(auto) read_tuple(size_t n) {
  tuple<vector<Ts>...> ts;
  for (size_t i = 0; i < n; i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);
  return ts;
}

using val = pair<ll, ll>;
using func = ll;

val op(val a, val b) { return MP(a.first + b.first, a.second + b.second); }
val e() { return MP(0, 0); }


val mp(func f, val a) {
  return MP(a.first + f * a.second, a.second);
}
func comp(func f, func g) {
  return f + g;
}
func id() { return 0; }

ll di[4] = { 1,0,-1,0 };
ll dj[4] = { 0,1,0,-1 };
ll si[4] = { 0,3,3,0 };
ll sj[4] = { 0,0,3,3 };
//ll di[4] = { -1,-1,1,1 };
//ll dj[4] = { -1,1,-1,1 };
ll di8[8] = { 0,-1,-1,-1,0,1,1,1 };
ll dj8[8] = { -1,-1,0,1,1,1,0,-1 };

ll n;
string s;

//BB,BR,RB,RR
tuple<vector<mint2>, vector<mint2>, vector<mint2>, vector<mint2>> solve2(ll l, ll r) {
  if (r - l == 1) {
    vector<mint2> e = { 0 };
    vector<mint2> r = { 0,1 };
    if (s[l] == 'B') {
      return make_tuple(r, e, e, e);
    }
    else {
      return make_tuple(e, e, e, r);
    }
  }
  ll m = (l + r) / 2;
  auto [bbl, brl, rbl, rrl] = solve2(l, m);
  auto [bbr, brr, rbr, rrr] = solve2(m, r);
  vector<mint2> bbrb = convolution(bbl, rbr);
  vector<mint2> bbrr = convolution(bbl, rrr);
  vector<mint2> brbb = convolution(brl, bbr);
  vector<mint2> brbr = convolution(brl, brr);
  vector<mint2> rbrb = convolution(rbl, rbr);
  vector<mint2> rbrr = convolution(rbl, rrr);
  vector<mint2> rrbb = convolution(rrl, bbr);
  vector<mint2> rrbr = convolution(rrl, brr);
  vector<mint2> bb(max(bbrb.size(), brbb.size()));
  vector<mint2> br(max(bbrr.size(), brbr.size()));
  vector<mint2> rb(max(rbrb.size(), rrbb.size()));
  vector<mint2> rr(max(rbrr.size(), rrbr.size()));
  REP(i, bbrb.size()) bb[i] += bbrb[i];
  REP(i, brbb.size()) bb[i] += brbb[i];
  REP(i, rbrb.size()) rb[i] += rbrb[i];
  REP(i, rrbb.size()) rb[i] += rrbb[i];
  REP(i, bbrr.size()) br[i] += bbrr[i];
  REP(i, brbr.size()) br[i] += brbr[i];
  REP(i, rbrr.size()) rr[i] += rbrr[i];
  REP(i, rrbr.size()) rr[i] += rrbr[i];
  REP(i, bbl.size()) bb[i] += bbl[i];
  REP(i, bbr.size()) bb[i] += bbr[i];
  REP(i, rbl.size()) rb[i] += rbl[i];
  REP(i, rbr.size()) rb[i] += rbr[i];
  REP(i, brl.size()) br[i] += brl[i];
  REP(i, brr.size()) br[i] += brr[i];
  REP(i, rrl.size()) rr[i] += rrl[i];
  REP(i, rrr.size()) rr[i] += rrr[i];
  return make_tuple(bb, br, rb, rr);
}

void solve() {
  cin >> n >> s;
  auto [bb, br, rb, rr] = solve2(0, n);
  bb.resize(n + 1);
  br.resize(n + 1);
  rb.resize(n + 1);
  rr.resize(n + 1);
  REP(i, n) {
    cout << (bb[i + 1] + br[i + 1] + rb[i + 1] + rr[i + 1]).val() << endl;
  }
  return;
}

int main() {
  ll t = 1;
  //cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
0