Submission #232496

#	Time	Username	Problem	Language	Result	Execution time	Memory
232496		kartel	Parametriziran (COCI19_parametriziran)	C++14	110 / 110	187 ms	2076 KiB

Main

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +50050
//#define N1 +1001000
#define M ll(998244353)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int n, m, i, j;
char s[N][7];
ll ans;
bitset <N> bt[7][27];
bitset <N> nw, full;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n >> m;
    for (i = 0; i < n; i++)
        for (j = 0; j < m; j++)
        {
            cin >> s[i][j];
            if (s[i][j] == '?')
            {
                for (int c = 0; c < 26; c++) bt[j][c][i] = 1;
                continue;
            }

            int c = s[i][j] - 'a';

            bt[j][c][i] = 1;
        }

    for (i = 0; i < n; i++) full[i] = 1;

    for (i = 0; i < n; i++)
    {
        full[i] = 0;
        nw = full;
//        cerr << nw.count() << el;

        for (j = 0; j < m; j++)
        {
            if (s[i][j] == '?') continue;

            nw &= bt[j][s[i][j] - 'a'];
//            cerr << bt[j][s[i][j] - 'a'].count() << el;
        }

        ans += nw.count();

    }

    cout << ans;
}


//3 - 4
//4 - 5
//y < z + x < y + 2 * x

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