답안 #862185

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
862185	2023-10-17T16:10:11 Z	TAhmed33	Set (COCI21_set)	C++	10 / 110	1000 ms	150352 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;
	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++) {
		unordered_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 += freq2[arr[i]] * (freq2[arr[i]] - 1) / 2;
	}
	cout << ans << '\n';
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	38 ms	150288 KB	Output is correct
2	Correct	37 ms	150220 KB	Output is correct
3	Correct	37 ms	150096 KB	Output is correct
4	Correct	53 ms	150332 KB	Output is correct
5	Correct	39 ms	150096 KB	Output is correct
6	Correct	39 ms	150352 KB	Output is correct
7	Correct	39 ms	150108 KB	Output is correct
8	Correct	50 ms	150108 KB	Output is correct
9	Correct	38 ms	150108 KB	Output is correct
10	Correct	51 ms	150196 KB	Output is correct
11	Correct	42 ms	150108 KB	Output is correct
12	Correct	56 ms	150276 KB	Output is correct
13	Correct	38 ms	150304 KB	Output is correct
14	Correct	37 ms	150108 KB	Output is correct
15	Correct	37 ms	150108 KB	Output is correct

Subtask #2

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	38 ms	150288 KB	Output is correct
2	Correct	37 ms	150220 KB	Output is correct
3	Correct	37 ms	150096 KB	Output is correct
4	Correct	53 ms	150332 KB	Output is correct
5	Correct	39 ms	150096 KB	Output is correct
6	Correct	39 ms	150352 KB	Output is correct
7	Correct	39 ms	150108 KB	Output is correct
8	Correct	50 ms	150108 KB	Output is correct
9	Correct	38 ms	150108 KB	Output is correct
10	Correct	51 ms	150196 KB	Output is correct
11	Correct	42 ms	150108 KB	Output is correct
12	Correct	56 ms	150276 KB	Output is correct
13	Correct	38 ms	150304 KB	Output is correct
14	Correct	37 ms	150108 KB	Output is correct
15	Correct	37 ms	150108 KB	Output is correct
16	Correct	44 ms	150100 KB	Output is correct
17	Correct	38 ms	150116 KB	Output is correct
18	Correct	38 ms	150104 KB	Output is correct
19	Execution timed out	1068 ms	150148 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-

Subtask #3

0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	38 ms	150288 KB	Output is correct
2	Correct	37 ms	150220 KB	Output is correct
3	Correct	37 ms	150096 KB	Output is correct
4	Correct	53 ms	150332 KB	Output is correct
5	Correct	39 ms	150096 KB	Output is correct
6	Correct	39 ms	150352 KB	Output is correct
7	Correct	39 ms	150108 KB	Output is correct
8	Correct	50 ms	150108 KB	Output is correct
9	Correct	38 ms	150108 KB	Output is correct
10	Correct	51 ms	150196 KB	Output is correct
11	Correct	42 ms	150108 KB	Output is correct
12	Correct	56 ms	150276 KB	Output is correct
13	Correct	38 ms	150304 KB	Output is correct
14	Correct	37 ms	150108 KB	Output is correct
15	Correct	37 ms	150108 KB	Output is correct
16	Correct	44 ms	150100 KB	Output is correct
17	Correct	38 ms	150116 KB	Output is correct
18	Correct	38 ms	150104 KB	Output is correct
19	Execution timed out	1068 ms	150148 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-