oj.uz

Submission #200096

# Submission time Handle Problem Language Result Execution time Memory
200096 2020-02-05T10:21:57 Z Saboon Parametriziran (COCI19_parametriziran) C++14
110 / 110
 832 ms 13272 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;
const int maxn = 5e4 + 10;

string s[maxn];
int a[maxn];
unordered_map<string, int> mp[65];

int main(){
	ios_base::sync_with_stdio(false);
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < n; i++){
		cin >> s[i];
		for (int j = 0; j < m; j++)
			if (s[i][j] != '?')
				a[i] += (1 << j);
	}
	ll answer = 0;
	for (int mask = 0; mask < (1 << m); mask++){
		for (int j = 0; j < n; j++){
			int me = (mask & a[j]);
			if (me != mask)
				continue;
			string now;
			for (int x = 0; x < m; x++)
				if (mask & (1 << x))
					now += s[j][x];
			mp[a[j]][now] ++;
		}
		for (int j = 0; j < n; j++){
			int me = (mask & a[j]);
			if (me != mask)
				continue;
			string now;
			for (int x = 0; x < m; x++)
				if (mask & (1 << x))
					now += s[j][x];

			for (int sub = 0; sub < (1 << m); sub++){
				if ((sub & a[j]) != mask)
					continue;
				answer += mp[sub][now];
			}
		}
		for (int j = 0; j < (1 << m); j++)
			mp[j].clear();
	}
	cout << (answer - n) / 2 << endl;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2168 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2168 KB Output is correct
2 Correct 18 ms 2172 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2168 KB Output is correct
2 Correct 27 ms 2296 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 2936 KB Output is correct
2 Correct 24 ms 2296 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 2808 KB Output is correct
2 Correct 37 ms 2552 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 5368 KB Output is correct
2 Correct 36 ms 2424 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 182 ms 5728 KB Output is correct
2 Correct 43 ms 2552 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 9512 KB Output is correct
2 Correct 158 ms 5624 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 549 ms 10104 KB Output is correct
2 Correct 86 ms 2680 KB Output is correct

Subtask #10
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 832 ms 13272 KB Output is correct
2 Correct 419 ms 8440 KB Output is correct