Submission #232473

#	Time	Username	Problem	Language	Result	Execution time	Memory
232473		VEGAnn	Parametriziran (COCI19_parametriziran)	C++14	11 / 110	1311 ms	49752 KiB

Main

#include <bits/stdc++.h>
#define ft first
#define sd second
#define sz(x) ((int)x.size())
using namespace std;
typedef long long ll;
const int N = 50100;
unordered_map<string, int> mem[(1 << 6)];
string s[N], t;
int n, m, kol[(1 << 6)];
ll ans = 0;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> n >> m;

    for (int i = 0; i < n; i++){
        cin >> s[i];

        for (int msk = 1; msk < (1 << m); msk++){
            t = "";
            bool bad = 0;

            for (int j = 0; j < m && !bad; j++)
                if (msk & (1 << j)) {
                    if (s[i][j] == '?')
                        bad = 1;
                    else t += s[i][j];
                }

            if (!bad) {
                mem[msk][t]++;
                kol[msk]++;
            }
        }
    }

    for (int i = 0; i < n; i++){
        int cur = n - 1;

        for (int msk = 1; msk < (1 << m); msk++){
            t = "";
            bool bad = 0;

            for (int j = 0; j < m && !bad; j++)
                if (msk & (1 << j)) {
                    if (s[i][j] == '?')
                        bad = 1;
                    else t += s[i][j];
                }

            if (!bad)
                cur += ((kol[msk] - mem[msk][t]) * (__builtin_parity(msk) ? -1 : 1));
        }

        ans += cur;
    }

    assert(ans % 2 == 0);

    cout << ans / 2;

    return 0;
}

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