oj.uz

Submission #862181

# Submission time Handle Problem Language Result Execution time Memory
862181 2023-10-17T16:08:39 Z TAhmed33 Set (COCI21_set) C++
0 / 110
 59 ms 150308 KB 
#include <bits/stdc++.h>
using namespace std;
string op (string a, string b) {
	string ret;
	for (int i = 0; i < (int)a.length(); i++) {
		if (a[i] == b[i]) ret += a[i];
		else {
			set <char> x = {'1', '2', '3'};
			x.erase(a[i]); x.erase(b[i]);
			ret += *(x.begin());
		}
	}
	return ret;
}
string op2[2188][2188];
int main () {
	int n, m;
	cin >> n >> m;
	map <string, int> cnt;
	string arr[n];
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < i; j++) {
			op2[i][j] = op(arr[i], arr[j]);
		}
	}
	long long ans = 0;
	for (int i = 0; i < n; i++) {
		cin >> arr[i];
		map <string, int> freq2;
		for (int j = 0; j < i; j++) {
			if (arr[i] == arr[j]) continue;
			ans += freq2[op2[i][j]];
			freq2[arr[j]]++;
		}
		ans += cnt[arr[i]] * (cnt[arr[i]] - 1) / 2;
		cnt[arr[i]]++;
	}
	cout << ans << '\n';
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 150308 KB Output is correct
2 Correct 58 ms 150120 KB Output is correct
3 Incorrect 59 ms 150228 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 150308 KB Output is correct
2 Correct 58 ms 150120 KB Output is correct
3 Incorrect 59 ms 150228 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 150308 KB Output is correct
2 Correct 58 ms 150120 KB Output is correct
3 Incorrect 59 ms 150228 KB Output isn't correct
4 Halted 0 ms 0 KB -