Submission #2553921

---

Source Code Expand

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1LL << 30;
int MOD = 1e9+7;
main(){
    int N;
    cin >> N;
    vector<string> S(N+1),sub,sub2;   
    for(int i = 0;i < N+1;i++){
        cin >> S[i];
        if(S[i].find("?") == -1)sub.push_back(S[i]);
        else    sub2.push_back(S[i]);
    }
    //cout << sub.size() << endl;//
    int l = 0,r = 1;
    if(sub.size() != 1){
        sort(sub.begin(),sub.end());
        auto itl = lower_bound(sub.begin(),sub.end(),S.back());
        auto itr = upper_bound(sub.begin(),sub.end(),S.back());
        //cout << *itl << endl << *itr << endl;//
        l = distance(sub.begin(), itl);
        r = distance(sub.begin(), itr);
    }
    
    //cout << l << " " << r << endl;
    if(sub2.size()){
        for(auto ss:sub2){
            //cout << ss << endl;
            bool lf,rf;//左にある　右にある
            string str = ss;
            for(char &c :str)if(c == '?')c = 'a';
            //cout << str << endl;//
            lf = (S.back() < str);

            str = ss;
            for(char &c :str)if(c == '?')c = 'z';
            //cout << str << endl;//
            rf = (S.back() > str);

            if(!lf && rf){
                l++,r++;
            }else if(!lf && !rf){
                r++;
            }
        }
    }
    for(int i = l;i < r;i++){
        cout << i+1 << " ";
    }cout << endl;
//    cout << l << " " << r << endl;
}

Submission Info

Judge Result