oj.uz

Submission #491142

# Submission time Handle Problem Language Result Execution time Memory
491142 2021-11-30T16:02:39 Z Yazan_Alattar Parametriziran (COCI19_parametriziran) C++17
88 / 110
 870 ms 65540 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <utility>
#include <cmath>
#include <numeric>
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 = 70;
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 <ll,int> cnt[M][M];
ll n, m, 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;
        ll mask = 0, tmp[M];
        memset(tmp, -1, sizeof tmp);
        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(ll 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.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 588 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 588 KB Output is correct
2 Correct 7 ms 664 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 588 KB Output is correct
2 Correct 15 ms 744 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 1456 KB Output is correct
2 Correct 15 ms 972 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 1356 KB Output is correct
2 Correct 33 ms 2544 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 10056 KB Output is correct
2 Correct 23 ms 1520 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 496 ms 23896 KB Output is correct
2 Correct 27 ms 2500 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 805 ms 44616 KB Output is correct
2 Correct 298 ms 20484 KB Output is correct

Subtask #9
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 870 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 781 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -