Submission #1213041

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"

using namespace std;
const long long int MOD = 1000000007;

int M;
string s[10000];
string t;
int l, r;

int main(){
	cin >> M;
	for (int i = 0; i < M; i++) {
		cin >> s[i];
	}
	cin >> t;
	l = 1;
	r = 1;
	for (int i = 0; i < M; i++) {
		string box = s[i];
		for (auto j = box.begin(); j != box.end(); ++j) {
			if (*j == '?')*j = 'a';
		}
		if (t >= box) {
			r++;
		}
		box = s[i];
		for (auto j = box.begin(); j != box.end(); ++j) {
			if (*j == '?')*j = 'z';
		}
		if (t > box)l++;
	}
	for (int i = l; i <= r; i++)cout << i << " ";
	cout << endl;
	return 0;
}

Submission Info

Judge Result