結果
問題 | No.1001 注文の多い順列 |
ユーザー | heno239 |
提出日時 | 2020-02-28 22:17:28 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 46 ms / 2,000 ms |
コード長 | 4,741 bytes |
コンパイル時間 | 1,412 ms |
コンパイル使用メモリ | 125,808 KB |
実行使用メモリ | 78,316 KB |
最終ジャッジ日時 | 2023-08-03 20:42:25 |
合計ジャッジ時間 | 4,364 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 28 ms
78,040 KB |
testcase_01 | AC | 28 ms
78,016 KB |
testcase_02 | AC | 27 ms
78,032 KB |
testcase_03 | AC | 28 ms
78,052 KB |
testcase_04 | AC | 27 ms
78,032 KB |
testcase_05 | AC | 28 ms
78,280 KB |
testcase_06 | AC | 27 ms
77,984 KB |
testcase_07 | AC | 26 ms
78,024 KB |
testcase_08 | AC | 28 ms
78,020 KB |
testcase_09 | AC | 26 ms
77,984 KB |
testcase_10 | AC | 26 ms
78,012 KB |
testcase_11 | AC | 28 ms
78,072 KB |
testcase_12 | AC | 28 ms
78,028 KB |
testcase_13 | AC | 26 ms
78,044 KB |
testcase_14 | AC | 28 ms
78,288 KB |
testcase_15 | AC | 28 ms
78,036 KB |
testcase_16 | AC | 26 ms
78,060 KB |
testcase_17 | AC | 28 ms
78,048 KB |
testcase_18 | AC | 42 ms
78,128 KB |
testcase_19 | AC | 41 ms
78,080 KB |
testcase_20 | AC | 36 ms
78,072 KB |
testcase_21 | AC | 35 ms
78,128 KB |
testcase_22 | AC | 44 ms
78,072 KB |
testcase_23 | AC | 45 ms
78,244 KB |
testcase_24 | AC | 45 ms
78,312 KB |
testcase_25 | AC | 44 ms
78,108 KB |
testcase_26 | AC | 42 ms
78,044 KB |
testcase_27 | AC | 42 ms
78,052 KB |
testcase_28 | AC | 42 ms
78,176 KB |
testcase_29 | AC | 46 ms
78,080 KB |
testcase_30 | AC | 44 ms
78,108 KB |
testcase_31 | AC | 45 ms
78,084 KB |
testcase_32 | AC | 46 ms
78,136 KB |
testcase_33 | AC | 43 ms
78,316 KB |
ソースコード
#include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<bitset> #include<stack> #include<unordered_map> #include<utility> #include<cassert> #include<complex> #include<numeric> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; const ll mod = 1000000007; const ll INF = mod * mod; typedef pair<int, int>P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair<ll, ll> LP; typedef long double ld; typedef pair<ld, ld> LDP; const ld eps = 1e-12; const ld pi = acos(-1.0); //typedef vector<vector<ll>> mat; typedef vector<int> vec; ll mod_pow(ll a, ll n, ll m) { ll res = 1; while (n) { if (n & 1)res = res * a%m; a = a * a%m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n%mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, int n) { if (n == 0)return modint(1); modint res = (a*a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } const int max_n = 1 << 18; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } using mP = pair<modint, modint>; int dx[4] = { 0,1,0,-1 }; int dy[4] = { 1,0,-1,0 }; typedef modint Data; typedef vector<Data> Array; typedef vector<Array> mat; mat operator*(const mat &lhs, const mat &rhs) { mat ret(lhs.size(), Array(rhs[0].size(), 0)); rep(i, lhs.size())rep(j, rhs[0].size())rep(k, rhs.size()) { ret[i][j] = lhs[i][k]*rhs[k][j]+ret[i][j]; } return ret; } mat scalar(int sz, Data k) { mat ret(sz, Array(sz, 0)); rep(i, sz)ret[i][i] = k; return ret; } mat operator^(const mat &lhs, const ll n) { if (n == 0)return scalar(lhs.size(), 1); mat ret = (lhs*lhs) ^ (n / 2); if (n % 2) { ret = ret * lhs; } return ret; } struct BIT { private: vector<ll> node, node2; int n; public: BIT(int n_) { n = n_; node.resize(n, 0); node2.resize(n, 0); } //0-indexed void add(int a, int b, ll w) { for (int i = a; i < n; i |= i + 1)node[i] += -a * w; for (int i = b; i < n; i |= i + 1)node[i] += b * w; for (int i = a; i < n; i |= i + 1)node2[i] += w; for (int i = b; i < n; i |= i + 1)node2[i] += -w; } ll sum(int a) { ll ret = 0; for (int i = a - 1; i >= 0; i = (i &(i + 1)) - 1)ret += node[i]; for (int i = a - 1; i >= 0; i = (i &(i + 1)) - 1)ret += a * node2[i]; return ret; } ll sum(int a, int b) { return sum(b) - sum(a); } }; modint dp[3005][3005]; void solve() { int n; cin >> n; vector<P> v; int cnt = 0; rep(i, n) { int t, x; cin >> t >> x; if (t == 0)x++; else cnt++; v.push_back({ x,t }); } sort(all(v), greater<P>()); dp[0][0] = 1; rep(i, n) { int t = v[i].second; int x = v[i].first; rep(j, i + 1) { int rest = n+1 - x - j; if (rest < 0)rest = 0; dp[i + 1][j + 1] += dp[i][j] * (modint)rest; if (t == 0) { dp[i + 1][j] += dp[i][j]; } } } modint ans = 0; Rep(j,cnt, n + 1) { int restzero = n - (j - cnt); modint csum = dp[n][j] * fact[n - j]; //cout << j << " " << csum << endl; if ((j - cnt) % 2)ans -= csum; else ans += csum; } cout << ans << endl; } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(10); init_f(); //init(); //int t; cin >> t; rep(i, t)solve(); solve(); stop return 0; }