結果

問題 No.2513 Power Eraser
ユーザー 👑 PCTprobabilityPCTprobability
提出日時 2023-06-16 00:46:53
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2,436 ms / 6,000 ms
コード長 5,513 bytes
コンパイル時間 5,881 ms
コンパイル使用メモリ 205,076 KB
実行使用メモリ 29,512 KB
最終ジャッジ日時 2023-10-20 21:00:12
合計ジャッジ時間 78,206 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,348 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 5 ms
4,348 KB
testcase_04 AC 28 ms
4,348 KB
testcase_05 AC 6 ms
4,348 KB
testcase_06 AC 47 ms
4,532 KB
testcase_07 AC 19 ms
4,348 KB
testcase_08 AC 37 ms
4,348 KB
testcase_09 AC 53 ms
4,660 KB
testcase_10 AC 33 ms
4,348 KB
testcase_11 AC 6 ms
4,348 KB
testcase_12 AC 26 ms
4,348 KB
testcase_13 AC 791 ms
14,892 KB
testcase_14 AC 1,801 ms
26,804 KB
testcase_15 AC 1,935 ms
27,436 KB
testcase_16 AC 1,017 ms
16,124 KB
testcase_17 AC 1,279 ms
17,224 KB
testcase_18 AC 1,748 ms
26,636 KB
testcase_19 AC 2,354 ms
29,436 KB
testcase_20 AC 864 ms
15,336 KB
testcase_21 AC 1,846 ms
27,028 KB
testcase_22 AC 1,848 ms
27,280 KB
testcase_23 AC 2,354 ms
29,512 KB
testcase_24 AC 2,330 ms
29,512 KB
testcase_25 AC 2,436 ms
29,512 KB
testcase_26 AC 2,372 ms
29,512 KB
testcase_27 AC 2,399 ms
29,512 KB
testcase_28 AC 2,365 ms
29,512 KB
testcase_29 AC 2,365 ms
29,512 KB
testcase_30 AC 2,358 ms
29,512 KB
testcase_31 AC 2,429 ms
29,512 KB
testcase_32 AC 2,378 ms
29,512 KB
testcase_33 AC 2 ms
4,348 KB
testcase_34 AC 2 ms
4,348 KB
testcase_35 AC 2,363 ms
29,512 KB
testcase_36 AC 2,348 ms
29,512 KB
7_evil_case_1.txt AC 5,575 ms
57,688 KB
7_evil_case_2.txt AC 5,665 ms
57,688 KB
7_evil_case_3.txt AC 5,662 ms
57,688 KB
7_evil_case_4.txt AC 5,861 ms
57,688 KB
7_evil_case_5.txt AC 5,763 ms
57,688 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 TOMAX(n,v) n=n<v?v:n
#define TOMIN(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 = ll;
using func = ll;

val op(val a, val b) { return a + b; }
val e() { return 0; }


val mp(func f, val a) {
  if (f == -1)
    return a;
  return f;
}
func comp(func f, func g) {
  if (f == -1)
    return g;
  return f;
}
func id() { return -1; }

ll di[4] = { 1,0,-1,0 };
ll dj[4] = { 0,1,0,-1 };
//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;
VL a;

vector<mint2> rev(vector<mint2>& f, ll mod) {
  vector<mint2> res = { mint2(1) / f[0] };
  ll t = 1;
  vector<mint2> ff;
  ff.reserve(f.size());
  while (t < mod) {
    t *= 2;
    while (ff.size() < t && ff.size() < f.size()) {
      ff.push_back(f[ff.size()]);
    }
    auto m = convolution(convolution(res, res), ff);
    vector<mint2> nres(t);
    REP(i, t) {
      if (i < res.size())
        nres[i] += 2 * res[i];
      if (i < m.size())
        nres[i] += -m[i];
    }
    res = nres;
  }
  return res;
}


vector<mint2> div(vector<mint2>& f, vector<mint2>& g) {
  auto rf = f;
  auto rg = g;
  reverse(all(rf));
  reverse(all(rg));
  ll siz = f.size() - g.size() + 1;
  auto rv = rev(rg, siz);
  if (rf.size() > siz)
    rf.resize(siz);
  if (rv.size() > siz)
    rv.resize(siz);
  auto q = convolution(rf, rv);
  if (q.size() > siz)
    q.resize(siz);
  reverse(all(q));
  auto gq = convolution(g, q);
  auto res = f;
  REP(i, res.size()) {
    if (i < gq.size()) {
      res[i] -= gq[i];
    }
  }
  while (res.back() == 0 && res.size() > 1) {
    res.pop_back();
  }
  return res;
}

mint2 solve3(ll l1, ll l2, ll d) {
  mint2 v = 1;
  if(d<=100){
  //cout<<l1<<" "<<l2<<" "<<d<<endl;
    for(int i=l1;i<l1+d;i++){
      for(int j=l2;j<l2+d;j++){
        v*=(a[i]-a[j]);
      }
    }
    return v;
  }
  if (d == 1) {
    return a[l1] - a[l2];
  }
  ll c = 1;
  while (c < d) {
    c *= 2;
  }
  VL a1(d), a2(d);
  REP(i, d) {
    a1[i] = a[l1 + i];
    a2[i] = a[l2 + i];
  }
  vector<vector<mint2>> f1(c * 2);
  vector<vector<mint2>> f2(c * 2);
  FOR(i, c, c * 2) {
    if (i < c + d) {
      f1[i].assign(2, -1);
      f1[i][0] = a1[i - c];
      f2[i].assign(2, -1);
      f2[i][0] = a2[i - c];
    }
    else {
      f1[i].assign(1, 1);
      f2[i].assign(1, 1);
    }
  }
  PER(i, c) {
    f1[i] = convolution(f1[i * 2], f1[i * 2 + 1]);
    f2[i] = convolution(f2[i * 2], f2[i * 2 + 1]);
  }
  f1[1] = div(f1[1], f2[1]);
  FOR(i, 2, 2 * c) {
    auto& p = f1[i / 2];
    if (f2[i].size() != 1)
      f1[i] = div(p, f2[i]);
  }

  mint2 res = 1;
  FOR(i, c, 2 * c) {
    res *= f1[i][0];
  }
  return res;
}

mint2 solve2(ll l, ll r) {
  if (l >= r - 1)
    return 1;
  mint2 res = 1;
  ll d = (r - l) / 2;
  res *= solve3(l, r - d, d);
  res *= solve2(l, r - d);
  res *= solve2(l + d, r);
  return res;
}

void solve() {
  //ifstream file("case.txt");
  //streambuf* cinbuf = cin.rdbuf();
  //cin.rdbuf(file.rdbuf());
  cin >> n;
  a = read(n);
  mint2 ans = 1;
  cout << solve2(0, n).val();
}


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