Submission #1213101

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include <iomanip>
typedef long long int ll;
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define EREP(i,n) for (int i=1;i<=(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define EVEL 1

#ifndef EVEL
#define DEB(X) cout << #X << ":" <<X<<" " ;
#define TF(f) f ? cout<<"true  " : cout<<"false ";
#define END cout<<"\n";
#else
#define DEB(X) {X=X;}
#define TF(f) {f=f;}
#define END {}
#endif
const int MOD = 1000000007;
const int INF = 1000000;
#define NMAX 50
#define MAX 10
    int N;
    vector<string> S;
    vector<int> a;
    string T;
int main(){
    cin>>N;
    REP(i,N){
        string s;
        cin>>s;
        S.push_back(s);
    }
    cin>>T;
    S.push_back(T);
    sort(ALL(S));
    int k=0;
    for(auto x:S){
        DEB(x)
        if(k>(signed)S.size())break;
        if(x==T){
            a.push_back(k);
        }
        k++;
    }
    k=0;
    for(auto x:a){
        if(k>=(signed)S.size())break;
        cout<<x+1;
        if(k!=(signed)S.size()-1)cout<<" ";
        k++;
    }
}

Submission Info

Judge Result