제출 #739553

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
739553		onebit1024	Parametriziran (COCI19_parametriziran)	C++17	88 / 110	1593 ms	65536 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back
#define all(c) c.begin(), c.end()
#define endl "\n"

const double PI=3.141592653589;


void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define dbg(x...) cerr << "LINE(" << __LINE__ << ") -> " <<"[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif

vector<int>pp(6);
void pre(){
    pp[0] = 1;
    for(int i =1;i<=5;++i)pp[i] = pp[i-1]*28;
}

int give(char x){
    int val = x-'a'+2;
    if(x=='?')val = 1;
    return val;
}

void solve()
{
    int n,m;
    cin >> n >> m;
    int u = (1ll<<m);
    vector<map<int,int>>cnt(u+1);
    int res = 0;
    for(int i = 1;i<=n;++i){
        string s;
        cin >> s;
        vector<int>pos;
        for(int j = 0;j<m;++j){
            if(s[j]!='?')pos.pb(j);
        }
        int w = pos.size();
        for(int j = 0;j<(1ll<<w);++j){
            int v = 0,con = 0,p=0;
            for(int k = 0;k<w;++k){
                if(j&(1ll<<k))con+=(give(s[pos[k]])*pp[p++]);
                else con+=pp[p++];
                v+=(1ll<<pos[k]);
            }
            res+=cnt[v][con];
        }
        for(int j = 0;j<(1ll<<m);++j){
            int con = 0,p = 0;
            for(int k = 0;k<m;++k){
                if(j&(1ll<<k))con+=(give(s[k])*pp[p++]);
            }
            cnt[j][con]++;
        }
        dbg(i,res);
    }
    cout << res << endl;
}   

int32_t main()
{

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);


    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    

    int T=1;
    pre();
    for(int i = 1;i<=T;++i)
    {
        // cout << "Case #" << i << ": ";
        solve();
    }
}

• 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: 0 / 11
• Subtask 10: 0 / 11