結果

問題 No.1068 #いろいろな色 / Red and Blue and more various colors (Hard)
ユーザー Enjapma_kyoproEnjapma_kyopro
提出日時 2020-05-30 00:59:22
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 4,504 bytes
コンパイル時間 2,274 ms
コンパイル使用メモリ 182,652 KB
実行使用メモリ 25,184 KB
最終ジャッジ日時 2024-11-06 12:40:46
合計ジャッジ時間 8,682 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
13,644 KB
testcase_01 AC 3 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 105 ms
6,816 KB
testcase_04 AC 74 ms
6,816 KB
testcase_05 AC 82 ms
6,816 KB
testcase_06 AC 62 ms
6,816 KB
testcase_07 AC 56 ms
6,820 KB
testcase_08 AC 78 ms
6,820 KB
testcase_09 AC 87 ms
6,816 KB
testcase_10 AC 37 ms
6,816 KB
testcase_11 AC 54 ms
6,816 KB
testcase_12 AC 32 ms
6,816 KB
testcase_13 TLE -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <unistd.h>
#include <sys/time.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P, ll> T;
typedef pair<long double , ll> Ps;
long long int INF = 2e18;
const ll fact_table = 3200008;
double Pi = 3.1415926535897932384626;
priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <P> bag;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//↓,→,↑,←
#define endl "\n"
#ifdef ENJAPMA
#undef endl
#endif
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)();
#define pc(x) cout << x << ",";
const ll mod = 998244353ll;
// const ll mod = 1000000007ll;
ll mypow(ll number1,ll number2, ll mod){
if(number2 == 0){
return 1ll;
}else{
ll number3 = mypow(number1,number2 / 2, mod);
number3 *= number3;
number3 %= mod;
if(number2%2==1){
number3 *= number1;
number3 %= mod;
}
return number3;
}
}
void YES(bool condition){
if(condition){
p("YES");
}else{
p("NO");
}
return;
}
void Yes(bool condition){
if(condition){
p("Yes");
}else{
p("No");
}
return;
}
namespace NTT {
void DFT(ll m, ll root, vector<ll> &a, bool rev = false) {
ll N = a.size(), h = 0;
for (ll i = 0; 1 << i < N; i++) h++;
for (ll i = 0; i < N; i++) {
ll j = 0;
for (ll k = 0; k < h; k++)
j |= (i >> k & 1) << (h - 1 - k);
if (i < j) swap(a[i], a[j]);
}
for (ll i = 1; i < N; i *= 2) {
ll base = mypow(root, (m - 1) / i / 2, m);
if (rev) base = mypow(base, m - 2, m);
ll w = 1;
for (ll j = 0; j < i; j++) {
for (ll k = 0; k < N; k += i*2) {
ll s = a[j+k], t = a[j+k+i] * w % m;
a[j+k+0] = (s + t) % m;
a[j+k+i] = (s - t + m) % m;
}
w = w * base % m;
}
}
if (rev) {
ll tmp = mypow(N, m-2, m);
for(ll &v : a) v = v * tmp % m;
}
}
//(1012924417, 5), (924844033, 5)
vector<ll> conv(ll _mod, ll root, const vector<ll> &a, const vector<ll> &b) {
ll s = 1, t = a.size() + b.size() - 1;
while(s < t) s *= 2;
vector<ll> F(s), G(s);
for(ll i = 0; i < (ll)a.size(); i++) F[i] = a[i];
for(ll i = 0; i < (ll)b.size(); i++) G[i] = b[i];
DFT(_mod, root, F); DFT(_mod, root, G);
for(ll i = 0; i < s; i++) F[i] = (ll)F[i] * G[i] % _mod;
DFT(_mod, root, F, true);
return F;
}
};
// auto res = NTT::conv(mod, 3ll, atable, btable);
/*
ll fact[fact_table + 5],rfact[fact_table + 5];
void c3_init(){
fact[0] = rfact[0] = 1;
for(ll i=1; i<=fact_table; i++){
fact[i] = (fact[i-1]*i) % mod;
}
rfact[fact_table] = mypow(fact[fact_table],mod - 2, mod);
for(ll i=fact_table; i>=1; i--){
rfact[i-1] = rfact[i] * i;
rfact[i-1] %= mod;
}
return;}
ll c3(ll n,ll r){
return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/
bool multicase = false;
ll n,m,num,a,b,c,d,e,h,q;
ll w, k, ans;
ll x[500005], y[500005];
deque<vector<ll>> G;
vector<ll> calc(ll l, ll r){
// [l, r)
if(l == r - 1)return G[l];
ll mid = (l + r) / 2;
auto u = calc(l, mid);
auto v = calc(mid, r);
return NTT::conv(mod, 3ll, u, v);
}
void solve(){
cin >> n >> q;
for(ll i=0;i<n;i++){
cin >> x[i];
vector<ll> v;
v.pb(1); v.pb(x[i] - 1);
G.pb(v);
}
while(G.size() >= 2){
G.pb(NTT::conv(mod, 3ll, G[0], G[1]));
G.pop_front();
G.pop_front();
}
for(ll i=0;i<q;i++){
cin >> y[i];
}
for(ll i=0;i<q;i++){
ll degree = n - y[i];
p(G[0][degree]);
}
return;
}
int main(){
// init();
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll q, testcase = 1;
if(multicase){
cin >> q;
}else{
q = 1;
}
while(q--){
// pu("Case ");pu("#");pu(testcase);pu(": ");
solve();
testcase++;
}
// solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0