제출 #334562

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
334562		doowey	Parametriziran (COCI19_parametriziran)	C++14	22 / 110	3098 ms	65540 KiB

Main

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int M = 6;
const int AL = 27;

multiset<ll> cnt[(1<<M)][(1<<M)];
ll pwr[M];

int main(){
    fastIO;
    int n, m;
    cin >> n >> m;
    pwr[0]=1;
    for(int i = 1; i <= m ; i ++ ){
        pwr[i]=(pwr[i-1]*1ll*AL);
    }
    string s;
    int res;
    ll clc;
    ll soln = 0;
    for(int i = 1; i <= n; i ++ ){
        cin >> s;
        int que = 0;
        for(int j = 0;  j < m ; j ++ ){
            if(s[j] == '?') que |= (1 << j);
        }
        for(int q2 = 0 ; q2 < (1 << m) ; q2 ++ ){
            res = (que | q2);
            clc = 0;
            for(int j = 0 ; j < m ; j ++ ){
                if((res & (1 << j))) continue;
                clc += pwr[j] * 1ll * (s[j] - 'a' + 1);
            }
            soln += cnt[q2][res].count(clc);
        }
        for(int sum = 0; sum < (1 << m); sum ++ ){
            if((sum & que) != que) continue;
            clc = 0;
            for(int j = 0 ; j < m ; j ++ ){
                if((sum & (1 << j))) continue;
                clc += pwr[j] * 1ll * (s[j] - 'a' + 1);
            }
            cnt[que][sum].insert(clc);
        }
    }
    cout << soln << "\n";
    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 11 / 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