제출 #156644

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
156644		IvanC	Parametriziran (COCI19_parametriziran)	C++17	110 / 110	1892 ms	56884 KiB

Main

#include <bits/stdc++.h>
using namespace std;

typedef tuple<char,char,char,char,char,char> sexta;

map<sexta, int> dicio;
long long total;
string original;
int M, N;

inline sexta set_pos(sexta s, int pos, char c){

	if(pos == 0){
		return make_tuple(c, get<1>(s), get<2>(s), get<3>(s), get<4>(s), get<5>(s));
	}
	else if(pos == 1){
		return make_tuple(get<0>(s), c, get<2>(s), get<3>(s), get<4>(s), get<5>(s));
	}
	else if(pos == 2){
		return make_tuple(get<0>(s), get<1>(s), c, get<3>(s), get<4>(s), get<5>(s));
	}
	else if(pos == 3){
		return make_tuple(get<0>(s), get<1>(s), get<2>(s), c, get<4>(s), get<5>(s));
	}
	else if(pos == 4){
		return make_tuple(get<0>(s), get<1>(s), get<2>(s), get<3>(s), c, get<5>(s));
	}
	else if(pos == 5){
		return make_tuple(get<0>(s), get<1>(s), get<2>(s), get<3>(s), get<4>(s), c);
	}

	return s;

}

void brute_insert(int pos, sexta davez){

	if(pos == M){
		//cout << "Original: " << original << " Davez: " << davez << endl;
		dicio[davez]++;
		return;
	}

	if(original[pos] != '?'){
		brute_insert(pos+1, set_pos(davez, pos, original[pos]));
		brute_insert(pos+1, set_pos(davez, pos, '?'));
	}
	else{
		brute_insert(pos+1, set_pos(davez, pos, '!'));
	}

}

void brute_count(int pos, sexta davez){

	if(pos == M){
		//cout << "Original: " << original << " Davez: " << davez << endl;
		if(dicio.count(davez)) total += dicio[davez];
		return;
	}

	brute_count(pos+1, set_pos(davez, pos, original[pos]));
	brute_count(pos+1, set_pos(davez, pos, '!'));

}

int main(){

	sexta vazia = make_tuple('0', '0', '0', '0', '0', '0');

	cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
	cin >> N >> M;

	for(int i = 0; i < N; i++){
		cin >> original;
		brute_count(0, vazia);
		brute_insert(0, vazia);
	}

	cout << total << endl;

	return 0;

}

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