Submission #168484

#	Time	Username	Problem	Language	Result	Execution time	Memory
168484		RiscadoA	Parametriziran (COCI19_parametriziran)	C++14	11 / 110	3088 ms	888 KiB

Main

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 50000;
const int MAX_M = 6;

int N, M;

int main() {
	cin >> N >> M;
	
	int c = 0;
	char words[MAX_N][MAX_M];
	
	for (int i = 0; i < N; ++i) { // Read input O(NM)
		for (int j = 0; j < M; ++j) {
			cin >> words[i][j];
		}
	}
	
	// For every pair (a, b) - O(N^2 * M)
	for (int i = 0; i < N; ++i) {
		for (int j = i + 1; j < N; ++j) {
			int valid = 1;
			for (int k = 0; k < M; ++k) {
				if (words[i][k] == '?' || words[j][k] == '?')
					continue;
				if (words[i][k] != words[j][k])
				{
					valid = 0;
					break;
				}
			}
			c += valid;
		}
	}
	
	cout << c;
	
	return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 0 / 11
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 11
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11