Submission #862183

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
862183	2023-10-17T16:09:11 Z	TAhmed33	Set (COCI21_set)	C++	10 / 110	1000 ms	150536 KB

Main

#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++) cin >> arr[i];
	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++) {
		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

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	50 ms	150096 KB	Output is correct
2	Correct	47 ms	150096 KB	Output is correct
3	Correct	46 ms	150100 KB	Output is correct
4	Correct	65 ms	150356 KB	Output is correct
5	Correct	47 ms	150260 KB	Output is correct
6	Correct	44 ms	150096 KB	Output is correct
7	Correct	46 ms	150108 KB	Output is correct
8	Correct	64 ms	150348 KB	Output is correct
9	Correct	45 ms	150100 KB	Output is correct
10	Correct	71 ms	150140 KB	Output is correct
11	Correct	44 ms	150100 KB	Output is correct
12	Correct	59 ms	150100 KB	Output is correct
13	Correct	44 ms	150100 KB	Output is correct
14	Correct	43 ms	150108 KB	Output is correct
15	Correct	40 ms	150100 KB	Output is correct

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	50 ms	150096 KB	Output is correct
2	Correct	47 ms	150096 KB	Output is correct
3	Correct	46 ms	150100 KB	Output is correct
4	Correct	65 ms	150356 KB	Output is correct
5	Correct	47 ms	150260 KB	Output is correct
6	Correct	44 ms	150096 KB	Output is correct
7	Correct	46 ms	150108 KB	Output is correct
8	Correct	64 ms	150348 KB	Output is correct
9	Correct	45 ms	150100 KB	Output is correct
10	Correct	71 ms	150140 KB	Output is correct
11	Correct	44 ms	150100 KB	Output is correct
12	Correct	59 ms	150100 KB	Output is correct
13	Correct	44 ms	150100 KB	Output is correct
14	Correct	43 ms	150108 KB	Output is correct
15	Correct	40 ms	150100 KB	Output is correct
16	Correct	42 ms	150224 KB	Output is correct
17	Correct	41 ms	150256 KB	Output is correct
18	Correct	41 ms	150072 KB	Output is correct
19	Execution timed out	1060 ms	150536 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-

Subtask #3

0 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	50 ms	150096 KB	Output is correct
2	Correct	47 ms	150096 KB	Output is correct
3	Correct	46 ms	150100 KB	Output is correct
4	Correct	65 ms	150356 KB	Output is correct
5	Correct	47 ms	150260 KB	Output is correct
6	Correct	44 ms	150096 KB	Output is correct
7	Correct	46 ms	150108 KB	Output is correct
8	Correct	64 ms	150348 KB	Output is correct
9	Correct	45 ms	150100 KB	Output is correct
10	Correct	71 ms	150140 KB	Output is correct
11	Correct	44 ms	150100 KB	Output is correct
12	Correct	59 ms	150100 KB	Output is correct
13	Correct	44 ms	150100 KB	Output is correct
14	Correct	43 ms	150108 KB	Output is correct
15	Correct	40 ms	150100 KB	Output is correct
16	Correct	42 ms	150224 KB	Output is correct
17	Correct	41 ms	150256 KB	Output is correct
18	Correct	41 ms	150072 KB	Output is correct
19	Execution timed out	1060 ms	150536 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-