oj.uz

답안 #932467

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932467 2024-02-23T13:04:25 Z Whisper Anagramistica (COCI21_anagramistica) C++17
110 / 110
 7 ms 6492 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e3 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nArr, numNeed;
unordered_map<string, int> cnt;
vector<string> a;

int dp[MAX][MAX];
void add(int&x, int y){
    x += y;
    if (x >= Mod) x -= Mod;
}
int inv[MAX], fac[MAX];
int power(int a, int exp){
    int res = 1;
    for ( ; exp > 0; exp >>= 1, a = (1ll * a * a) % Mod) if(exp & 1){
        res = (1ll * res * a) % Mod;
    }
    return res;
}
void genFac(int n){
    inv[0] = fac[0] = 1;
    for (int i = 1; i <= n; ++i){
        fac[i] = fac[i - 1] *i % Mod;
    }
    inv[n] = power(fac[n], Mod - 2);
    for (int i = n; i >= 1; --i) inv[i - 1] = 1ll * inv[i] * i % Mod;
}

int C(int n, int k){
    if (n < k) return 0;
    assert(n >= k);
    return 1ll * fac[n] * inv[n - k] % Mod * inv[k] % Mod;
}
int A(int n, int k){
    assert(n >= k);
    return 1ll * fac[n] * inv[n - k] % Mod;
}
void Whisper(){
    cin >> nArr >> numNeed;
    a.push_back("");
    for (int i = 1; i <= nArr; ++i){
        string s; cin >> s;
        sort(s.begin(), s.end());
        if (!cnt.count(s)) a.push_back(s);
        cnt[s]++;
    }
    genFac(nArr + 5);
    nArr = (int)a.size() - 1;
    dp[0][0] = 1;
    for (int i = 1; i <= nArr; ++i){
        int c = cnt[a[i]];
        for (int k = 0; k <= numNeed; ++k){
            for (int v = 0; C(v, 2) <= k && v <= c; ++v){
                add(dp[i][k], dp[i - 1][k - C(v, 2)] * C(c, v) % Mod);
            }
        }
    }
    cout << dp[nArr][numNeed];
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 472 KB Output is correct
5 Correct 1 ms 756 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 2 ms 1628 KB Output is correct

Subtask #3
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 472 KB Output is correct
5 Correct 1 ms 756 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 1628 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 1628 KB Output is correct
10 Correct 3 ms 2140 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 2 ms 1252 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 7 ms 6492 KB Output is correct
17 Correct 7 ms 860 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct