Submission #1213102

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
using namespace std;

#define fi first
#define se second
typedef long long LL;
typedef long double LD;

int N; string s[10010],t;

int comp(string a, string b){
    int i;
    for (i=0; i<min(a.length(),b.length()); i++)
        if (a[i]<b[i]) return -1;
        else if (a[i]>b[i]) return 1;

    if (a.length()==b.length()) return 0;
    else if (a.length()<b.length()) return -1;
    return 1;
}

int main(){
    cin >> N;

    int i,j,cnt_b=0,cnt_s=0;
    for (i=1; i<=N; i++) cin >> s[i];
    cin >> t;

    for (i=1; i<=N; i++){
        bool sml=0,big=0;
        string aux=s[i];
        for (j=0; j<aux.length(); j++)
            if (aux[j]=='?') aux[j]='a';

        if (comp(aux,t)<1)
            sml=1;

        aux=s[i];
        for (j=0; j<aux.length(); j++)
            if (aux[j]=='?') aux[j]='z';

        if (comp(aux,t)>-1) big=1;

        if (sml && !big) cnt_s++;
        else if (big && !sml) cnt_b++;
    }

    for (i=cnt_s+1; i<=N+1-cnt_b; i++)
        cout << i << " ";
    cout << "\n";
    return 0;
}

Submission Info

Judge Result