#include using namespace std; template using vp = vector>; template using pque = priority_queue; template using lpque = priority_queue,greater>; using ll = long long; using pint = pair; using pll = pair; using pil = pair; using pli = pair; using vint = vector; using vll = vector; using vpint = vector; using vpll = vector; using vpil = vector; using vpli = vector; using qint = queue; using pqint = pque; using qll = queue; using pqll = pque; constexpr double PI = 3.141592653589793; constexpr int INTINF = (1<<30)-1; constexpr ll LLINF = (1LL<<62)-1; constexpr int MPRIME = 1000000007; constexpr int MPRIME9 = 998244353; constexpr ll MMPRIME = (1LL<<61)-1; constexpr char newl = '\n'; #define len length() #define pushb push_back #define fi first #define se second #define all(name) name.begin(),name.end() #define rall(name) name.rbegin(),name.rend() #define gsort(vbeg,vend) sort(vbeg,vend,greater<>()) template struct matrix{ private: vector> m; public: matrix() : m(0, vector(0)) {} matrix(int h, int w) : m(h, vector(w)) {} matrix(int h, int w, const T &init) : m(h, vector(w, init)) {} void assign(int h, int w) { m = vector(h, vector(w)); } void assign(int h, int w, const T init) { m = vector(h, vector(w, init)); } void in() { for(int i=0; i>m[i][j]; } void out() { for(int i=0; i &operator[](int idx) { assert(0<=idx && idx inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template inline void init(T& v) { for(auto &a: v) cin>>a; } template inline void init(vector>& v) { for(auto &a: v) cin>>a.first>>a.second; } template inline void init(T& v, N n) { v.resize(n); for(auto &a: v) cin>>a; } template inline void init(vector>& v, N n) { v.resize(n); for(auto &a: v) cin>>a.first>>a.second; } template inline void out(T a) { cout< inline void out(T a, U... alist) { cout<(alist)...); } template void resiz(N n) { //empty } template void resiz(N n, T&& hd, U&&... tl) { hd.resize(n); resiz(n,forward(tl)...); } long long binpow(long long a, long long ex, long long p=MMPRIME) { long long res = 1; while(ex > 0) { if(ex & 1) (res*=a) %= p; ex>>=1; (a*=a) %= p; } return res; } template struct mint { private: long long val; public: mint(long long x=0) : val((mod+x%mod)%mod) {} private: mint pow(long long ex) const { return mint(binpow(val, ex, mod)); } mint inv() const { return pow(mod-2); } public: mint operator-() const { return mint(-val); } mint& operator+=(const mint& a) { (val+=a.val) %= mod; return *this; } mint& operator-=(const mint& a) { (val+=mod-a.val) %= mod; return *this; } mint& operator*=(const mint& a) { (val*=a.val) %= mod; return *this; } mint& operator/=(const mint& a) { return (*this) *= a.inv(); } mint operator+(const mint& a) const { mint res(*this); return res+=a; } mint operator-(const mint& a) const { mint res(*this); return res-=a; } mint operator*(const mint& a) const { mint res(*this); return res*=a; } mint operator/(const mint& a) const { mint res(*this); return res/=a; } mint operator+(const long long& a) const { mint res(*this); return res+=mint(a); } mint operator-(const long long& a) const { mint res(*this); return res-=mint(a); } mint operator*(const long long& a) const { mint res(*this); return res*=mint(a); } mint operator/(const long long& a) const { mint res(*this); return res/=mint(a); } mint& operator++() { (++val) %= mod; return *this; } mint operator++(int) { mint res(*this); (++val) %= mod; return res; } mint& operator--() { (val+=mod-1) %= mod; return *this; } mint operator--(int) { mint res(*this); (val+=mod-1) %= mod; return res; } bool operator==(const mint& a) const { return val == a.val; } bool operator!=(const mint& a) const { return val != a.val; } bool operator<(const mint& a) const { return val < a.val; } bool operator>(const mint& a) const { return val > a.val; } bool operator<=(const mint& a) const { return val <= a.val; } bool operator>=(const mint& a) const { return val >= a.val; } bool operator==(const long long& a) const { return val == a; } bool operator!=(const long long& a) const { return val != a; } bool operator<(const long long& a) const { return val < a; } bool operator>(const long long& a) const { return val > a; } bool operator<=(const long long& a) const { return val <= a; } bool operator>=(const long long& a) const { return val >= a; } mint& operator=(const mint& a) { val = a.val; return *this; } mint& operator=(const long long& a) { val = (mod+a%mod)%mod; return *this; } friend ostream& operator<<(ostream& os, const mint& a) { return os << a.val; } friend istream& operator>>(istream& is, mint &a) { long long n; is >> n; a = mint(n); return is; } }; int N; map m; mint ans=1; void input() { cin>>N; for(int i=0; i>A; m[A]++; } } void solve() { int tmp=0; for(auto &a: m) { if(tmp) ans *= tmp*a.se; tmp=a.se; ans *= a.se; for(int i=3; i<=a.se-1; i++) ans *= i; } cout<

提出日時
ユーザー	idat_50me
言語	C++ (GCC 9.3.0)
結果	CE
実行時間	ms
メモリ	kb

Rail Romanesque

コンパイルエラー