oj.uz

Submission #491152

# Submission time Handle Problem Language Result Execution time Memory
491152 2021-11-30T16:15:30 Z Yazan_Alattar Parametriziran (COCI19_parametriziran) C++14
110 / 110
 1173 ms 42664 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 = 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);
            if(cnt[mask2][res].count(tmp[res])) 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 6 ms 460 KB Output is correct

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 460 KB Output is correct
2 Correct 15 ms 548 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 1176 KB Output is correct
2 Correct 17 ms 736 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 968 KB Output is correct
2 Correct 36 ms 1464 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 5344 KB Output is correct
2 Correct 22 ms 716 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 280 ms 9748 KB Output is correct
2 Correct 24 ms 688 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 476 ms 17816 KB Output is correct
2 Correct 227 ms 8164 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 684 ms 28164 KB Output is correct
2 Correct 36 ms 704 KB Output is correct

Subtask #10
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1173 ms 42664 KB Output is correct
2 Correct 562 ms 21164 KB Output is correct