\\nstruct montgomery_modint{\\nprivate:\\n using mint=montgomery_modint;\\n using i32=int32_t;\\n using u32=uint32_t;\\n using u64=uint64_t;\\n static constexpr u32 get_r(){\\n u32 ret=m;\\n for(u32 i=0;i<4;i++)ret*=2-m*ret;\\n return ret;\\n }\\n static_assert(m>2);\\n static_assert(m<(1<<30));\\n static_assert(m&1);\\n static constexpr u32 r1=get_r();\\n static constexpr u32 r2=-u64(m)%m;\\n u32 v;\\n static constexpr u32 reduce(const u64 &a){\\n return (a+u64(u32(a)*u32(-r1))*m)>>32;\\n }\\npublic:\\n montgomery_modint():v(0){}\\n montgomery_modint(ll a):v(reduce(u64(a%m+m)*r2)){}\\n static mint raw(int a){\\n mint ret;\\n ret.v=reduce(u64(a)*r2);\\n return ret;\\n }\\n u32 val()const{\\n u32 ret=reduce(v);\\n return ret>=m?ret-m:ret;\\n }\\n static constexpr int mod(){return m;}\\n mint &operator+=(const mint &b){\\n if(i32(v+=b.v-m*2)<0)v+=m*2;\\n return *this;\\n }\\n mint &operator-=(const mint &b){\\n if(i32(v-=b.v)<0)v+=m*2;\\n return *this;\\n }\\n mint &operator*=(const mint &b){\\n v=reduce(u64(v)*b.v);\\n return *this;\\n }\\n mint &operator/=(const mint &b){\\n *this*=b.inv();\\n return *this;\\n }\\n mint operator+()const{return *this;}\\n mint operator-()const{return mint()-*this;}\\n friend mint operator+(const mint &a,const mint &b){return mint(a)+=b;}\\n friend mint operator-(const mint &a,const mint &b){return mint(a)-=b;}\\n friend mint operator*(const mint &a,const mint &b){return mint(a)*=b;}\\n friend mint operator/(const mint &a,const mint &b){return mint(a)/=b;}\\n friend bool operator==(const mint &a,const mint &b){return (a.v>=m?a.v-m:a.v)==(b.v>=m?b.v-m:b.v);}\\n friend bool operator!=(const mint &a,const mint &b){return !(a==b);}\\n mint pow(ll n)const{\\n mint ret=1,a(*this);\\n while(n){\\n if(n&1)ret*=a;\\n a*=a;\\n n>>=1;\\n }\\n return ret;\\n }\\n inline mint inv()const{\\n return pow(m-2);\\n }\\n friend istream &operator>>(istream &is,mint &b){\\n ll a;\\n is>>a;\\n b=mint(a);\\n return is;\\n }\\n friend ostream &operator<<(ostream &os,const mint &b){\\n os<
;\\nvoid SOLVE(){\\n int n;\\n cin>>n;\\n vectorcnt(n,0);\\n vector>a(n*2);\\n rep(i,n*2){\\n cin>>a[i];\\n if(a[i].second!=0)cnt[a[i].second-1]++;\\n }\\n {\\n vector>b;\\n rep(i,n*2)if(a[i].second==0||cnt[a[i].second-1]!=2)b.push_back(a[i]);\\n swap(a,b);\\n }\\n debug(a);\\n assert(a.size()%2==0);\\n n=a.size()/2;\\n vectordp(n+1,0);\\n dp[0]=1;\\n int ma=0;\\n rep(i,n*2){\\n vectorep(n+1,0);\\n auto [c,v]=a[i];\\n if(c=='I'){\\n if(v==0){\\n rep(j,n)ep[j+1]+=dp[j];\\n }\\n else{\\n rep(j,n+1)ep[j]+=dp[j];\\n }\\n ma++;\\n }\\n else{\\n if(v==0){\\n rep(j,n+1){\\n if(ma-j>0)ep[j]+=dp[j]*(ma-j);\\n if(j)ep[j-1]+=dp[j]*j;\\n }\\n }\\n else{\\n rep(j,n+1){\\n if(j)ep[j-1]+=dp[j]*j;\\n }\\n }\\n ma--;\\n }\\n swap(dp,ep);\\n }\\n int c=0;\\n rep(i,cnt.size())c+=cnt[i]==0;\\n mint ans=dp[0];\\n reps(i,1,c+1)ans*=i;\\n cout<\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(ll i = 0; i < n; i++)\\n#define all(a) (a).begin(),(a).end()\\n\\n\\nint main(){\\n ll n;\\n cin >> n;\\n ll mod=1000000007;\\n vector a(2*n);\\n vector b(2*n);\\n vector t(n);\\n vector r(n);\\n for(int i=0;i<2*n;i++){\\n cin >> a[i] >> b[i];\\n b[i]--;\\n if(b[i]==-1)continue;\\n if(a[i]=='I')t[b[i]]++;\\n else r[b[i]]++;\\n }\\n ll ans=1;\\n ll p=0;\\n for(int i=0;i dp(1,ans);\\n ll s=0;\\n for(int i=0;i<2*n;i++){\\n \\n if(a[i]=='I'){\\n if(b[i]!=-1&&r[b[i]]==1)continue;\\n s++;\\n vector ndp(s+1);\\n if(b[i]==-1){\\n for(int j=0;j ndp(s+1);\\n if(b[i]==-1){\\n for(int j=0;j\\n\\n#define rep(i,s,n) for(int i = int(s); i < int(n); i++)\\n#define rrep(i,s,n) for(int i = int(n) - 1; i >= int(s); i--)\\n#define all(v) (v).begin(), (v).end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\n\\ntemplate\\nbool chmin(T &a, T b) {\\n if(a <= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate\\nbool chmax(T &a, T b) {\\n if(a >= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate struct modint {\\n using mint = modint;\\n ll a;\\n modint(ll x = 0) : a((x % m + m) % m) {}\\n static constexpr ll mod(){\\n return m;\\n }\\n ll val() const {\\n return a;\\n }\\n ll &val(){\\n return a;\\n }\\n mint pow(ll n) const {\\n mint res = 1;\\n mint x = a;\\n while (n){\\n if (n & 1) res *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return res;\\n }\\n mint inv() const {\\n return pow(mod-2);\\n }\\n mint &operator+=(const mint rhs){\\n a += rhs.a;\\n if (a >= m) a -= m;\\n return *this;\\n }\\n mint &operator-=(const mint rhs){\\n if (a < rhs.a) a += m;\\n a -= rhs.a;\\n return *this;\\n }\\n mint &operator*=(const mint rhs){\\n a = a * rhs.a % m;\\n return *this;\\n }\\n mint &operator/=(const mint rhs){\\n (*this) *= rhs.inv();\\n return *this;\\n }\\n friend mint operator+(const mint &lhs, const mint &rhs){\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint &lhs, const mint &rhs){\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint &lhs, const mint &rhs){\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint &lhs, const mint &rhs){\\n return mint(lhs) /= rhs;\\n }\\n};\\n\\nusing mint = modint<1'000'000'007>;\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n int n;\\n std::cin >> n;\\n std::vector table(n, 0);\\n std::vector> cx(2*n);\\n for(auto &[c, x]: cx) {\\n char a;\\n std::cin >> a >> x;\\n if(a == 'I') {\\n c = 0;\\n }\\n else c = 1;\\n x--;\\n if(x >= 0) table[x]++;\\n }\\n int q = 0;\\n rep(i,0,n) {\\n if(table[i] == 0) q++;\\n }\\n std::vector dp(n+1, 0);\\n int sum = 0;\\n int in = 0, out = 0;\\n dp[0] = 1;\\n for(auto [c, x]: cx) {\\n if(x < 0) {\\n std::vector nxt(n+1, 0);\\n rep(j,0,n+1) {\\n int i = sum - j;\\n if(i < 0) break;\\n if(c == 0) {\\n if(j < n) {\\n nxt[j + 1] += dp[j];\\n }\\n int cnt = q - (in - j - out);\\n if(cnt > 0) {\\n nxt[j] += dp[j] * cnt;\\n }\\n }\\n else {\\n if(i > 0) {\\n nxt[j] += dp[j] * i;\\n }\\n }\\n }\\n std::swap(dp, nxt);\\n if(c == 0) in++;\\n }\\n else {\\n if(table[x] == 2) continue;\\n std::vector nxt(n+1, 0);\\n rep(j,0,n+1) {\\n int i = sum - j;\\n if(i < 0) break;\\n if(c == 0) {\\n nxt[j] += dp[j];\\n }\\n else {\\n if(j > 0) nxt[j-1] += dp[j] * j;\\n }\\n }\\n std::swap(dp, nxt);\\n if(c == 1) out++;\\n }\\n sum += (c == 0 ? 1 : -1);\\n }\\n std::cout << dp[0].val() << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3624,\n \"score_of_the_acc\": -0.4004,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1419_8479502\",\n \"code_snippet\": \"#include\\nusing namespace std;\\nusing ll=long long;\\nconst int mod=1e9+7;\\nll fac[6000];\\n\\nvoid ch(ll &a,ll b){\\n a=(a+b)%mod;\\n}\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n fac[0]=fac[1]=1;\\n for(int i=2;i<6000;i++){\\n fac[i]=fac[i-1]*i%mod;\\n }\\n int N;\\n cin>>N;\\n vector>A(N*2);\\n for(auto &i:A)cin>>i.first>>i.second;\\n unordered_setIO,I,O;\\n for(int i=0;i\\nusing namespace std;\\n\\nconst long long mod = 1000000007;\\nint N, Sum, Sum2;\\nchar c[10009]; int x[10009];\\nint depth[10009];\\n\\n// Dynamic Programming\\nint ty[10009];\\nint dp[10009][5009];\\n\\nint main() {\\n\\t// Input\\n\\tcin >> N;\\n\\tfor (int i = 1; i <= 2 * N; i++) {\\n\\t\\tcin >> c[i] >> x[i];\\n\\t\\tif (c[i] == 'I' && x[i] != 0) ty[x[i]] |= 1;\\n\\t\\tif (c[i] == 'O' && x[i] != 0) ty[x[i]] |= 2;\\n\\t}\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tif (ty[i] == 2) Sum += 1;\\n\\t\\tif (ty[i] == 0 || ty[i] == 2) Sum2 += 1;\\n\\t}\\n\\tfor (int i = 1; i <= 2 * N; i++) {\\n\\t\\tdepth[i] = depth[i - 1];\\n\\t\\tif (ty[x[i]] == 3) continue;\\n\\t\\tif (c[i] == 'I') depth[i] += 1;\\n\\t\\tif (c[i] == 'O') depth[i] -= 1;\\n\\t}\\n\\t\\n\\t// Dynamic Programming\\n\\tint CountI = 0, CountD = 0;\\n\\tdp[0][0] = 1;\\n\\tfor (int i = 0; i < 2 * N; i++) {\\n\\t\\tfor (int j = 0; j <= depth[i]; j++) {\\n\\t\\t\\tif (dp[i][j] == 0) continue;\\n\\t\\t\\tif (ty[x[i + 1]] == 3) {\\n\\t\\t\\t\\tdp[i + 1][j] += dp[i][j];\\n\\t\\t\\t\\tif (dp[i + 1][j] >= mod) dp[i + 1][j] -= mod;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// In case 'I'\\n\\t\\t\\tif (c[i + 1] == 'I') {\\n\\t\\t\\t\\tif (x[i + 1] != 0) {\\n\\t\\t\\t\\t\\tdp[i + 1][j] += dp[i][j];\\n\\t\\t\\t\\t\\tif (dp[i + 1][j] >= mod) dp[i + 1][j] -= mod;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (x[i + 1] == 0) {\\n\\t\\t\\t\\t\\tint Rem_Total = Sum2 - CountI;\\n\\t\\t\\t\\t\\tint Rem_Decided = Sum - (CountD + j);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// dp[i][j] -> dp[i+1][j]\\n\\t\\t\\t\\t\\tif (Rem_Total - Rem_Decided >= 1) {\\n\\t\\t\\t\\t\\t\\tdp[i + 1][j] += (1LL * (Rem_Total - Rem_Decided) * dp[i][j]) % mod;\\n\\t\\t\\t\\t\\t\\tif (dp[i + 1][j] >= mod) dp[i + 1][j] -= mod;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// dp[i][j] -> dp[i+1][j+1]\\n\\t\\t\\t\\t\\tif (Rem_Decided >= 1) {\\n\\t\\t\\t\\t\\t\\tdp[i + 1][j + 1] += dp[i][j];\\n\\t\\t\\t\\t\\t\\tif (dp[i + 1][j + 1] >= mod) dp[i + 1][j + 1] -= mod;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// In case 'O'\\n\\t\\t\\tif (c[i + 1] == 'O') {\\n\\t\\t\\t\\tint rem = depth[i] - j;\\n\\t\\t\\t\\tif (x[i + 1] != 0 && j >= 1) {\\n\\t\\t\\t\\t\\tdp[i + 1][j - 1] += (1LL * j * dp[i][j]) % mod;\\n\\t\\t\\t\\t\\tif (dp[i + 1][j - 1] >= mod) dp[i + 1][j - 1] -= mod;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (x[i + 1] == 0 && rem >= 1) {\\n\\t\\t\\t\\t\\tdp[i + 1][j] += (1LL * rem * dp[i][j]) % mod;\\n\\t\\t\\t\\t\\tif (dp[i + 1][j] >= mod) dp[i + 1][j] -= mod;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (c[i + 1] == 'I' && (ty[x[i+1]] == 0 || ty[x[i+1]] == 2)) CountI += 1;\\n\\t\\tif (c[i + 1] == 'O' && ty[x[i+1]] == 2) CountD += 1;\\n\\t}\\n\\t\\n\\t/*cout << \\\"DP:\\\" << endl;\\n\\tfor (int i = 0; i <= 2 * N; i++) {\\n\\t\\tfor (int j = 0; j <= depth[i]; j++) cout << dp[i][j] << \\\" \\\";\\n\\t\\tcout << endl;\\n\\t}*/\\n\\t\\n\\t// Output\\n\\tcout << dp[2 * N][0] << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 196736,\n \"score_of_the_acc\": -1.0869,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1419_7086103\",\n \"code_snippet\": \"#include \\n\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)\\n#define all(c) std::begin(c), std::end(c);\\n\\n#ifdef LOCAL\\n#define debug(...) debug_impl(#__VA_ARGS__, __VA_ARGS__)\\ntemplate void debug_impl(string s, T&& first, Args &&...args) {\\n string opn = sizeof...(args) == 0 ? \\\"\\\" : \\\"(\\\";\\n string cls = sizeof...(args) == 0 ? \\\"\\\" : \\\")\\\";\\n cerr << \\\"[\\\\033[32mDEBUG\\\\033[m] \\\" << opn << s << cls << \\\": \\\" << opn << forward(first);\\n ((cerr << \\\", \\\" << forward(args)), ..., (cerr << cls << '\\\\n'));\\n}\\n#else\\n#define debug(...) void(0)\\n#endif\\n\\ntemplate bool chmax(T& a, const T& b) { return b > a ? (a = b, true) : false; }\\ntemplate bool chmin(T& a, const T& b) { return b < a ? (a = b, true) : false; }\\n\\ntemplate istream& operator>>(istream& in, vector& v) {\\n for (auto& e : v) in >> e;\\n return in;\\n}\\ntemplate void read(Args &...args) {\\n (cin >> ... >> args);\\n}\\ntemplate ostream& operator<<(ostream& out, const vector& v) {\\n int n = v.size();\\n rep(i, n) {\\n out << v[i];\\n if (i + 1 != n) out << ' ';\\n }\\n return out;\\n}\\ntemplate void print(H&& h, T &&...t) {\\n cout << h, ((cout << ' ' << forward(t)), ..., (cout << '\\\\n'));\\n}\\n\\ntemplate \\nstruct modint {\\n static constexpr int mod = MOD;\\n unsigned x;\\n modint() : x(0) {}\\n modint(long long sig) {\\n int sigt = sig % mod;\\n if (sigt < 0) sigt += mod;\\n x = sigt;\\n }\\n int val() const {\\n return x;\\n }\\n friend modint& operator+=(modint& x, const modint& y) {\\n x.x += y.x;\\n if (x.x >= mod) x.x -= mod;\\n return x;\\n }\\n friend modint& operator-=(modint& x, const modint& y) {\\n x.x -= y.x;\\n if (x.x < 0) x.x += mod;\\n return x;\\n }\\n friend modint& operator*=(modint& x, const modint& y) {\\n x.x = (unsigned long long) x.x * y.x % mod;\\n return x;\\n }\\n friend modint operator+(modint x, const modint& y) {\\n return x += y;\\n }\\n friend modint operator-(modint x, const modint& y) {\\n return x -= y;\\n }\\n friend modint operator*(modint x, const modint& y) {\\n return x *= y;\\n }\\n};\\n\\nusing mint = modint<1000000007>;\\n\\nvoid solve(vector op, vector id) {\\n const int n = op.size() / 2;\\n\\n vector cnt(2 * n + 1);\\n rep(i, 2 * n) {\\n cnt[i + 1] = cnt[i] + (op[i] == 'I');\\n }\\n\\n int t = n;\\n for (int x : id) {\\n if (x >= 0) --t;\\n }\\n\\n vector pd(n + 1);\\n pd[0] = 1;\\n\\n rep(i, 2 * n) {\\n vector dp(n + 1);\\n rep(j, n + 1) if (pd[j].val()) {\\n const int k = 2 * cnt[i] - i - j;\\n if (op[i] == 'I') {\\n if (id[i] >= 0) {\\n dp[j] += pd[j];\\n } else if (j + 1 <= n) {\\n dp[j + 1] += pd[j];\\n }\\n } else {\\n if (id[i] >= 0) {\\n if (j) {\\n dp[j - 1] += pd[j] * j;\\n }\\n } else {\\n dp[j] += pd[j] * k;\\n if (j) {\\n dp[j - 1] += pd[j] * j;\\n }\\n }\\n }\\n }\\n pd.swap(dp);\\n }\\n mint ans = pd[0];\\n rep(v, t) ans *= t - v;\\n print(ans.val());\\n}\\n\\nint main() {\\n int n;\\n read(n);\\n\\n set din, dout;\\n\\n vector op(2 * n);\\n vector id(2 * n);\\n rep(i, 2 * n) {\\n char c;\\n cin >> c;\\n int v;\\n cin >> v;\\n --v;\\n op[i] = c;\\n id[i] = v;\\n\\n if (c == 'I' and v >= 0) {\\n din.insert(v);\\n }\\n if (c == 'O' and v >= 0) {\\n if (din.count(v)) {\\n dout.insert(v);\\n }\\n }\\n }\\n\\n vector op2;\\n vector id2;\\n\\n rep(i, 2 * n) {\\n if (not dout.count(id[i])) {\\n op2.push_back(op[i]);\\n id2.push_back(id[i]);\\n }\\n }\\n\\n // debug(op2);\\n // debug(id2);\\n\\n solve(op2, id2);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3880,\n \"score_of_the_acc\": -0.2017,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1419_6615364\",\n \"code_snippet\": \"#include \\n#include \\n#include \\n#include \\n#include \\n#include \\n#include \\n#include \\n#include \\n#include