제출 #491149

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
491149		Yazan_Alattar	Parametriziran (COCI19_parametriziran)	C++14	99 / 110	1436 ms	65536 KiB

Main

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 64;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

map <int,int> cnt[M][M];
int n, m;
ll ans;

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n; ++i){
        string s;
        cin >> s;
        int mask = 0, tmp[M];
        fill(tmp, tmp+64, -1);
        for(int j = 0; j < m; ++j) if(s[j] != '?') mask |= (1 << j);
        for(int mask2 = 0; mask2 < (1 << m); ++mask2){
            if((mask & mask2) != mask2) continue;
            int cur = 0;
            for(int j = 0, p = 1; j < m; ++j, p *= 26) if((mask2 >> j) & 1) cur += p * (s[j] - 'a');
            tmp[mask2] = cur;
        }
        for(int mask2 = 0; mask2 < (1 << m); ++mask2){
            int res = (mask & mask2);
            ans += cnt[mask2][res][tmp[res]];
        }
        for(int mask2 = 0; mask2 < (1 << m); ++mask2) if(tmp[mask2] != -1) ++cnt[mask][mask2][tmp[mask2]];
    }
    cout << ans << endl;
    return 0;
}
// Don't forget special cases. (n = 1?)
// Look for the constraints. (Runtime array? overflow?)

• 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