#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define inf 1e18+1e9
#define F first
#define S second
#define int long long
#define mod (int)(1e9+7)
#define maxn 1000100
#define pii pair<int,int>
#define mod2 998244353
const int maxtime=1e8;
const long double eps=1e-9;
ld dist(ld x1,ld y1,ld x2,ld y2) {
return sqrt(abs(x1-x2)*abs(x1-x2)+abs(y1-y2)*abs(y1-y2));
}
int n,d;
string s[50500];
int b[10];
int ans[20];
map<string,int> mp[20];
void solve () {
cin>>n>>d;
for (int i=1;i<=n;i++) {
cin>>s[i];
}
for (int i=0;i<n;i++) {
for (int mask=1;mask<15;mask++) {
string t="";
int cnt=0;
for (int j=0;j<4;j++) {
if (mask&(1<<j))t+=s[i][j],cnt++;
}
cnt--;
ans[3-cnt]+=mp[mask][t]++;
}
}
if(d==1) {
cout<<ans[0];
}else if(d==2) {
cout<<ans[1]-(ans[0]*3);
}else if(d==3) {
cout<<ans[2]-(ans[1]*2-ans[0]*3);
}else {
cout<<n*(n-1)/2-(ans[0]-ans[1]+ans[2]);
}
}/*
0->
1->1
2->2
3->1 2
4->3
5->1 3
6->2 3
7->1 2 3
8->4
9->1 4
10->2 4
11->1 2 4
12->3 4
13->1 3 4
14->2 3 4
15->1 2 3 4
*/
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int t=1;
// cin>>t;
for (int ii=1;ii<=t;ii++) {
solve();
// asd();
if (ii<t)cout<<"\n";
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
