# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
531259 | hohohaha | PIN (CEOI10_pin) | C++14 | 4 ms | 1872 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define fori(i, a, b) for(int i = (int) (a); i <= (int) (b); i++)
#define ford(i, a, b) for(int i = (int) (a); i >= (int) (b); i--)
#define ii pair<int, int>
#define fi first
#define se second
#define vi vector<int>
#define eb emplace_back
#define sp ' '
#define int long long
const int maxn = 5e4 + 4;
int n, d;
int co[16];
string s[maxn];
signed main() {
freopen("PIN.inp", "r", stdin);
freopen("PIN.out", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> d;
fori(i, 1, n) cin >> s[i];
fori(mask, 0, 15) {
map<string, int> cnt;
fori(i, 1, n) {
string temp = s[i];
fori(bit, 0, 3) {
if(mask >> bit & 1) {
temp[bit] = '-';
}
}
cnt[temp]++;
}
for(auto t: cnt) {
co[mask] += t.se * (t.se - 1) / 2;
}
}
int ans = 0;
fori(mask, 0, 15) {
fori(mask2, 0, mask - 1) {
if((mask2 & mask) == mask2) {
co[mask] -= co[mask2];
}
}
if(__builtin_popcountll(mask) == d) ans += co[mask];
}
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |