Submission #444472

#	Time	Username	Problem	Language	Result	Execution time	Memory
444472		zxcvbnm	Parametriziran (COCI19_parametriziran)	C++14	99 / 110	1550 ms	65536 KiB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int p = 31;
const int mod = 1e9 + 9;

ll hsh(const string& s) {
    ll ret = 0;
    ll p_pow = 1;

    for(char c : s) {
        int ch = 26;
        if (isalpha(c)) {
            ch = c - 'a';
        } else if (c == '*') {
            ch = 27;
        }

//        cout << c << " " << ch << "\n";
        ret = (ret + ch * p_pow) % mod;
        p_pow = (p_pow * p) % mod;
    }

    return ret;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    map<int, int> cnt;
    vector<string> a(n);

    for(int i = 0; i < n; i++) {
        string str;
        cin >> str;
        a[i] = str;
    }

    for(int i = 0; i < n; i++) {
        for(int mask = 0; mask < (1 << m); mask++) {
            string s = a[i];
            for(int j = 0; j < m; j++) {
                if (mask & (1 << j)) {
                    s[j] = '*';
                }
            }
//            cout << s << " " << hsh(s) << "\n";
            cnt[hsh(s)]++;
        }
    }

    ll ans = 0;
    for(string str : a) {
        vector<int> idx;
        for(int i = 0; i < m; i++) {
            if (isalpha(str[i])) {
                idx.push_back(i);
            }
        }

        int letters = idx.size();
        string str2 = str;
        for(char& c : str2) {
            if (c == '?') {
                c = '*';
            }
        }

        for(int mask = 0; mask < (1 << letters); mask++) {
            string s = str2;
            for(int j = 0; j < letters; j++) {
                if (mask & (1 << j)) {
                    s[idx[j]] = '?';
                }
            }
//            cout << s << " ";
//            cout << cnt[s] << "\n";
            ans += cnt[hsh(s)];
        }
//        cerr << "\n";
    }

    ans -= n;
    ans /= 2;
    cout << ans << "\n";
    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 11 / 11
• Subtask 5: 11 / 11
• Subtask 6: 11 / 11
• Subtask 7: 11 / 11
• Subtask 8: 11 / 11
• Subtask 9: 11 / 11
• Subtask 10: 0 / 11