結果
問題 | No.2615 ペアの作り方 |
ユーザー |
![]() |
提出日時 | 2024-01-26 21:28:38 |
言語 | C++17(clang) (17.0.6 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 44 ms / 2,000 ms |
コード長 | 3,807 bytes |
コンパイル時間 | 5,366 ms |
コンパイル使用メモリ | 180,864 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-28 07:40:20 |
合計ジャッジ時間 | 5,800 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 21 |
ソースコード
#include <bits/stdc++.h>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}#endif#ifdef LOCAL#include "debug.h"#else#define debug(...) static_cast<void>(0)#define debugg(...) static_cast<void>(0)template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}#endifusing ll=long long;using ull=unsigned long long;using P=pair<ll,ll>;template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}#define reps(i,a,n) for(int i=(a);i<(n);i++)#define rep(i,n) reps(i,0,n)#define all(x) x.begin(),x.end()#define pcnt(x) __builtin_popcountll(x)ll myceil(ll a,ll b){return (a+b-1)/b;}template<typename T,size_t n,size_t id=0>auto vec(const int (&d)[n],const T &init=T()){if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));else return init;}void SOLVE();int main(){ios::sync_with_stdio(false);cin.tie(nullptr);#ifdef LOCALclock_t start=clock();#endifint testcase=1;//cin>>testcase;for(int i=0;i<testcase;i++){SOLVE();}#ifdef LOCALcerr<<"time:";cerr<<(clock()-start)/1000;cerr<<"ms\n";#endif}template<typename T>struct factorial_table{private:int mod,capacity;vector<T>fact,factinv,inv;void resize(int n){fact.resize(n+1),factinv.resize(n+1),inv.resize(n+1);for(int i=capacity+1;i<=n;i++){fact[i]=fact[i-1]*i;inv[i]=-inv[mod%i]*(mod/i);factinv[i]=factinv[i-1]*inv[i];}capacity=n;}public:factorial_table():capacity(1),mod(T::mod()),fact{1,1},factinv{1,1},inv{0,1}{}T C(int n,int k){if(n<k)return 0;if(k<0)return 0;if(capacity<n)resize(n);return fact[n]*factinv[k]*factinv[n-k];}T P(int n,int k){if(n<k)return 0;if(k<0)return 0;if(capacity<n)resize(n);return fact[n]*factinv[n-k];}T H(int n,int k){return C(n+k-1,k);}T factorial(int n){if(capacity<n)resize(n);return fact[n];}T S(ll n,int k){if(n<0)return 0;if(n<k)return 0;T ret=0;if(capacity<k)resize(k);rep(i,k+1){ret+=fact[k]*factinv[i]*factinv[k-i]*T::raw(i).pow(n)*((k-i)&1?-1:1);}return ret*factinv[k];}template<typename... INT>T O(INT...k){int n=0;for(int i:initializer_list<int>{k...}){if(i<0)return 0;n+=i;}if(capacity<n)resize(n);T ret=fact[n];for(int i:initializer_list<int>{k...})ret*=factinv[i];return ret;}};using mint=modint998244353;factorial_table<mint>table;void SOLVE(){int n;cin>>n;vector<int>x(n),y(n);cin>>x>>y;sort(all(x));sort(all(y),greater<int>());if(x[n-1]<y[n-1]||x[0]>y[0]){cout<<table.factorial(n).val()<<endl;}else{rep(i,n){if(x[i]>y[i]){cout<<(table.factorial(i)*table.factorial(n-i)).val()<<endl;return;}}}}