Aristocracy

#include <bits/stdc++.h>
#define fi first
#define se second
#define For(type, i, a, b) for (type i = (a); i <= (b); ++i)
#define endl '\n'
using namespace std;
 
typedef long long ll;
 
const ll maxN = 1e18;
const ll minN = -1e18;
const ll MOD = 1e9 + 7;
 
const ll limit = 1e5 + 5;
 
ll a[limit], f[limit], b[limit];
ll n, l;
const ll mod = 1e9 + 7;

void FastIn(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}
map<string, ll> dp;
string s[limit];

ll pow(ll a, ll n)
{
    a %= mod;
    if(n == 1) return a % mod;
    int tmp = pow(a % mod, n / 2);
    return (n & 1) ? tmp % mod * tmp % mod * a % mod : tmp % mod * tmp % mod;
}

ll C(ll p, ll n){
    p++;
    n++;
    return f[n - 1] * pow(f[p - 1] * f[n - p], mod - 2) % mod;
}
void ReadIn(){
  cin >> n;

  ll kd = 0;

  f[0] = 1; 
 //   cin >> n;
  for(ll i = 1; i <= 1e5 + 1; i++){
    f[i] = (f[i-1] % mod * i % mod) % mod; 
  }

  For(ll, i, 1, n){
    cin >> s[i] >> l;
    dp[s[i]]++;
    // if(dp[s] == 0){
    //     kd ++;
    //     b[kd] = 
    // }
  }
  
  For(ll, i, 1, n){
    // cout << s[i] << endl;
    if(dp[s[i]] != 0){
        kd ++;
        b[kd] = dp[s[i]];
        dp[s[i]] = 0;
    }
  }
//   For(ll, i, 1, kd){
//     cout << b[i] << " ";
//   }
    ll res = 1;
    For(ll, i, 1, kd){
        res = (res % mod * C(b[i], n) % mod) % mod;
        n -= b[i];
    }
    cout << res;
}
int main(){
    FastIn();
    ReadIn();
}
// g++ -o output
// g++ A.cpp
// ./a.out

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED