Submission #2908454

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<list>
#include<set>
using namespace std;
int mod = 1e9+7;

int main() {
  int n; cin >> n;
  vector<string> s(n);
  for(int i=0; i<n; i++) cin >> s[i];
  string t;
  cin >> t;

  int r = 0;
  int l = 0;
  for(int i=0; i<n; i++){
    string a = s[i];
    string b = s[i];
    for(int j=0; j<a.size(); j++){
      if( a[j] == '?' ) a[j] = 'a';
      if( b[j] == '?' ) b[j] = 'z';
    }
    if( a <= t ) r++;
    if( b >= t ) l++;
  }

  for(int i=n-l; i<=r; i++){
    if( i == r ) cout << i+1 << endl;
    else cout << i+1 << " ";
  }

  return 0;
}

//

Submission Info

Judge Result