Submission #1258495

---

Source Code Expand

#include <bits/stdc++.h>
#include<vector>
#include<queue>

#define ll long long
#define ld long double

using namespace std;

const int MAXN = 1001 * 1001 , MOD = 1e9 + 7 ;

string s[MAXN] ;


int cmp(string s , string t , char x)
{
    int n = s.size() ;
    for(int i = 0 ; i < n ; i ++  ) if(s[i]=='?') s[i] = x ;
    if(s<t) return 0 ;
    if(s==t) return 1 ;
    return 2 ;
}

int main() {
    ios::sync_with_stdio(0) ;
    cin.tie(0) ; cout.tie(0) ;
    int n ;
    cin >> n ;
    for(int i = 0 ; i < n ; i ++ )
        cin >> s[i] ;
    string t ;
    cin >> t ;

    int x = 0 , y = 0 ;

    int m = t.size() ;

    for(int i = 0 ; i < n ; i ++ )
    {
        if(!cmp(s[i],t,'z'))
            x ++ ;
    }


    for(int i = 0 ; i < n ; i ++ )
    {
        if(cmp(s[i],t,'a')==2)
            y ++ ;
    }

  //  cout << x << ' ' << y << endl ;

    //for(int i = 1 ; i <= n ; i ++ )
    vector<int> v ;
    for(int i = x + 1 ; i + y  <= n + 1 ; i ++ )
        v.push_back(i) ;
    x = v.back() ;
    v.pop_back() ;
    for(auto u : v) cout << u << ' ' ;
    cout << x ;
    cout << endl ;

    return 0;
}

Submission Info

Judge Result