oj.uz

Submission #96760

# Submission time Handle Problem Language Result Execution time Memory
96760 2019-02-11T18:34:08 Z kraljlavova1 Parametriziran (COCI19_parametriziran) C++11
88 / 110
 1756 ms 66560 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
const int MAX = 5e4 + 10, MAXOFF = 6;
int n, m;
ll sol;
string s[MAX];
map<string, ll> mp[1 << MAXOFF];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    cin >> n >> m;
    for(int i = 0;i < n; i++){
    	cin >> s[i];
		}
    for(int i = 0;i < n; i++){
        int num = 0, len = 0;
        string p;
        for(int j = 0;j < m; j++){
            if(s[i][j] != '?'){
                p += s[i][j];
                num += (1 << j);
                len++;
            }
        }
        for(int j = 0;j < (1 << len); j++){
            string tmp = p;
            for(int k = 0;k < len; k++){
                if((1 << k) & j) tmp[k] = '?';
            }
            sol += mp[num][tmp];
        }
        for(int j = 0;j < (1 << m); j++){
            p = "";
            for(int k = 0;k < m; k++){
                if(j & (1 << k)){
                    p += s[i][k];
                }
            }
            mp[j][p]++;
        }
    }
    cout << sol << "\n";
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1912 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2040 KB Output is correct
2 Correct 16 ms 1912 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2040 KB Output is correct
2 Correct 34 ms 1912 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 3064 KB Output is correct
2 Correct 46 ms 2424 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 2796 KB Output is correct
2 Correct 89 ms 4472 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 490 ms 13432 KB Output is correct
2 Correct 82 ms 2936 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 933 ms 31128 KB Output is correct
2 Correct 127 ms 4272 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1756 ms 56672 KB Output is correct
2 Correct 837 ms 26616 KB Output is correct

Subtask #9
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 1581 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 1228 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -