oj.uz

Submission #679737

# Submission time Handle Problem Language Result Execution time Memory
679737 2023-01-09T05:43:42 Z amir Anagramistica (COCI21_anagramistica) C++14
40 / 110
 25 ms 37836 KB 
/*
<< in the name of Allah >>
*/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll ;
typedef pair<int , int> pii ;
typedef pair<ll , ll> pll ;
#define ps push_back
#define pb pop_back
#define mp make_pair
#define all(x) x.begin() , x.end() 
#define sz(x) (int)x.size() 
#define debug(a) cout<<"debug: "<<(#a)<<" = "<<a<<'\n'
#define debugAr(a) cout << "Array " << (#a) << " :\n" ;for (int TMP : a) cout << TMP << " " ; cout << '\n' ;
const ll maxn = 2e3 + 10 , mod = 1e9 + 7 ;
ll dp[maxn][maxn] ;
ll n , k ;
ll C[maxn][maxn] ;
map<string , ll> cnt ;

int main()
{
    ios::sync_with_stdio(false) ; 
	cin.tie(NULL) ;
	cout.tie(NULL) ;
	/*for (int r = 0 ; r < maxn ; r++)
		C[0][r] = 0 ;*/
	for (ll i = 0 ; i < maxn ; i++) 
		C[i][0] = 1ll ;
	for (ll N = 1 ; N < maxn ;N++){
		for (ll r = 1 ; r < maxn ; r++){
			C[N][r] = C[N-1][r] + C[N-1][r-1] ;
			C[N][r] %= mod ;
		}
	}
	
	cin >> n >> k ;
	for (ll i = 0 ; i < n ; i++){
		string t ;
		cin >> t ;
		sort(all(t)) ;
		cnt[t] ++ ;
	}
	ll ind = 1 ;
	for (pair<string , ll> x : cnt){
		ll Cnt = x.second ;
		if (ind == 1){
			for (ll j = 0 ;j <= Cnt ; j++){
				dp[1][C[j][2]] += C[Cnt][j] ;
				dp[1][C[j][2]] %= mod ;
			}
			ind ++ ;
			continue ;
		}
		for (ll i = 0 ; i <= k ; i++){
			for (ll j = 0 ; j <= Cnt ; j++){
				ll idx = i-C[j][2] ;
				if (idx < 0)continue ;
				ll temp = dp[ind-1][idx]*C[Cnt][j] ; temp %= mod ;
				dp[ind][i] += temp ;
				dp[ind][i] %= mod ;
			}
		}
		ind ++ ;
	}
	cout << (dp[ind-1][k]%mod) << '\n' ;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 31948 KB Output is correct
2 Correct 19 ms 31956 KB Output is correct
3 Correct 19 ms 31912 KB Output is correct
4 Correct 18 ms 31912 KB Output is correct
5 Correct 19 ms 31984 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 32212 KB Output is correct
2 Correct 20 ms 33208 KB Output is correct
3 Correct 20 ms 32076 KB Output is correct
4 Correct 20 ms 33108 KB Output is correct

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 31948 KB Output is correct
2 Correct 19 ms 31956 KB Output is correct
3 Correct 19 ms 31912 KB Output is correct
4 Correct 18 ms 31912 KB Output is correct
5 Correct 19 ms 31984 KB Output is correct
6 Correct 19 ms 32212 KB Output is correct
7 Correct 20 ms 33208 KB Output is correct
8 Correct 20 ms 32076 KB Output is correct
9 Correct 20 ms 33108 KB Output is correct
10 Correct 21 ms 33620 KB Output is correct
11 Correct 21 ms 32028 KB Output is correct
12 Correct 19 ms 32196 KB Output is correct
13 Correct 22 ms 32072 KB Output is correct
14 Correct 22 ms 32820 KB Output is correct
15 Correct 20 ms 32112 KB Output is correct
16 Correct 25 ms 37836 KB Output is correct
17 Incorrect 25 ms 32232 KB Output isn't correct
18 Halted 0 ms 0 KB -