結果
| 問題 | No.3450 Permutation of Even Scores |
| コンテスト | |
| ユーザー |
 akua
|
| 提出日時 | 2026-06-14 03:20:21 |
| 言語 | C++17 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
AC
|
| 実行時間 | 1,432 ms / 2,000 ms |
| コード長 | 6,629 bytes |
| 記録 | |
| コンパイル時間 | 4,639 ms |
| コンパイル使用メモリ | 271,568 KB |
| 実行使用メモリ | 260,912 KB |
| 最終ジャッジ日時 | 2026-06-14 03:21:33 |
| 合計ジャッジ時間 | 62,251 ms |
|
ジャッジサーバーID （参考情報） |
judge1_0 / judge3_0 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 46 |
ソースコード
# pragma GCC target("avx2")
# pragma GCC optimize("O3")
# pragma GCC optimize("unroll-loops")
#include<atcoder/all>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque #include <unordered_map> // unordered_map #include <unordered_set> // unordered_set #include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip>
#include <functional>
#include<unordered_map>
#include <random>
#include<bitset>
#include<cassert>
#include<chrono>
using namespace std;
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#define arr(x) (x).rbegin(),(x).rend()
typedef long long ll;
typedef unsigned long long ull;
const ll inf=4e18;
using graph = vector<vector<int> > ;
using vi=vector<int>;
using P= pair<ll,ll>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vll=vector<ll>;
using vvll=vector<vll>;
using vvvll=vector<vvll>;
using vp=vector<P>;
using vvp=vector<vp>;
using vvvp=vector<vvp>;
using vd=vector<double>;
using vvd =vector<vd>;
//using vs=vector<string>;
//string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
//string S="abcdefghijklmnopqrstuvwxyz";
//g++ main.cpp -std=c++17 -I .
//cout <<setprecision(20);
//cout << fixed << setprecision(10);
//cin.tie(0); ios::sync_with_stdio(false);
const double PI = acos(-1);
int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1};
void putsYes(bool f){cout << (f?"Yes":"No") << endl;}
void putsYES(bool f){cout << (f?"YES":"NO") << endl;}
void putsFirst(bool f){cout << (f?"First":"Second") << endl;}
void debug(int test){cout << "TEST" << " " << test << endl;}
ll pow_pow(ll x,ll n,ll mod){
if(n==0) return 1;
x%=mod;
ll res=pow_pow(x*x%mod,n/2,mod);
if(n&1)res=res*x%mod;
return res;
}
ll gcdll(ll x,ll y){
if(y==0)return x;
return gcdll(y,x%y);
}
ll INFF=1000100100100100100;
ll lcmll(ll x,ll y){
ll X=(x/gcdll(x,y)),Y=y;
if(X<=INFF/Y)return X*Y;
else return INFF;
}
template<class T> bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
else return false;
}
template<class T> bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
else return false;
}
struct edge{
int to; ll cost;int id;
edge(int to,ll cost,int id) : to(to),cost(cost),id(id) {}
};
using ve=vector<edge>;
using vve=vector<ve>;
int mod=998244353;
using mint=modint998244353;
using vm=vector<mint>;
using vvm=vector<vm>;
using vvvm=vector<vvm>;
constexpr int MAX = 10000100;
ll fact[MAX],finv[MAX],invv[MAX];
void initcomb(){
fact[0]=fact[1]=1;
finv[0]=finv[1]=1;
invv[1]=1;
for(int i=2;i<MAX;i++){
fact[i]=fact[i-1]*i%mod;
invv[i]=mod-invv[mod%i]*(mod/i)%mod;
finv[i]=finv[i-1]*invv[i]%mod;
}
}
ll comb(ll n,ll k){
if(n<k) return 0;
if(n<0||k<0) return 0;
return fact[n]*(finv[k]*finv[n-k]%mod)%mod;
}
struct Compress{
vll a;
int cnt;
Compress() :cnt(0) {}
void add(ll x){a.push_back(x);}
void init(){
sort(all(a));
a.erase(unique(all(a)),a.end());
cnt=a.size();
}
ll to(ll x){
int index=lower_bound(all(a),x)-a.begin();
return index;
} //変換先
ll from(ll x){return a[x];}//逆引き
int size(){return cnt;}
};
struct UnionFind {
vector<int> par, siz;
UnionFind(int n) : par(n, -1) , siz(n, 1) { }
int root(int x) {
if (par[x] == -1) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool unite(int x, int y) {
x = root(x), y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
par[y] = x;
siz[x] += siz[y];
return true;
}
int size(int x) {
return siz[root(x)];
}
};
vll anss;
void solve(int test){
int n,m; cin>> n >> m;
vi is(n+1);
rep(i,m){
int x; cin >> x;
is[x]=1;
}
is[0]=1;
int flag=0;
if(!is[n])is[n]=1,flag=1;
vvll dp(n+1,vll(2));
dp[0][0]=1;
{
int l=0,r=n+1;
int m=1;
repi(i,l,m)rep(j,2)if(!is[i])dp[i][j]=0;
int si=r-l;
vvll kei(2,vll(si,1));
rep(i,si)kei[1][i]=fact[i];
rep(i,si)kei[0][i]=(mod-kei[1][i]%mod)%mod;
//rep(i,si)cout << i <<" " << kei[1][i] << endl;
vvll dpl(2,vll(m-l));
repi(i,l,m)rep(j,2)dpl[j][i-l]=dp[i][j];
rep(i,2)rep(j,2){
auto con=convolution(dpl[i],kei[j]);
repi(x,m,r){
if(x==n && j==0)continue;
dp[x][i^j]=(dp[x][i^j]+con[x-l])%mod;
//cout << con[x-m] << endl;
}
}
/*
rep(i,n+1){
cout << i << " " << dp[i][0] << " " << dp[i][1] << endl;
}
*/
}
auto f=[&](auto f,int l,int r)->void {
if(r-l<=1)return;
//cout << l << " " << r << endl;
int m=(l+r)/2;
// cout << l <<" " << m << " " << r << endl;
f(f,l,m);
repi(i,l,m)rep(j,2)if(!is[i])dp[i][j]=0;
int si=r-l;
vvll kei(2,vll(si,1));
rep(i,si)kei[1][i]=(fact[i]*(i+1))%mod;
rep(i,si)kei[0][i]=(mod-kei[1][i]%mod)%mod;
//rep(i,si)cout << i <<" " << kei[1][i] << endl;
vvll dpl(2,vll(m-l));
repi(i,l,m)rep(j,2)dpl[j][i-l]=dp[i][j];
rep(i,2)rep(j,2){
auto con=convolution(dpl[i],kei[j]);
repi(x,m,r){
if(x==n && j==0)continue;
dp[x][i^j]=(dp[x][i^j]+con[x-l])%mod;
//cout << con[x-m] << endl;
}
}
f(f,m,r);
};
f(f,1,n+1);
rep(i,n+1)rep(j,2)if(!is[i])dp[i][j]=0;
/*
rep(i,n+1){
cout << i << " " << dp[i][0] << " " << dp[i][1] << endl;
}
*/
cout << dp[n][flag] << endl;
}
//cat cf.cpp | pbcopy
//g++ cf.cpp -std=c++17 -I .
int main(){cin.tie(0);ios::sync_with_stdio(false);
initcomb();
int t=1;//cin >>t;
rep(test,t)solve(test);
for(auto ans:anss){
cout<< ans << endl;
}
}