Submission #3623013


Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define eps LDBL_EPSILON
#define int long long
#define ll long long
#define moder 1000000007
#define P std::pair<int,int>
using namespace std;

int n;
string s[10010],t,r;
int a,b;
signed main(){
	cin>>n;
	rep(i,n)cin>>s[i];
	cin>>t;
	rep(i,n){
		r=s[i];
		rep(j,s[i].size()){
			if(s[i][j]=='?')s[i][j]='a';
		}
		if(s[i]<=t)a++;
		rep(j,r.size()){
			if(r[j]=='?')r[j]='z';
		}
		if(r<t)b++;
	}
	for(int i=b+1;i<=a;i++){
		cout<<i<<" ";
	}
	cout<<a+1<<endl;
	return 0;
}

Submission Info

Submission Time
Task A - Atcoder Handles
User kaage
Language C++14 (GCC 5.4.1)
Score 250
Code Size 567 Byte
Status AC
Exec Time 10 ms
Memory 1024 KB

Judge Result

Set Name Subtask1 Subtask2
Score / Max Score 130 / 130 120 / 120
Status
AC × 3
AC × 6
Set Name Test Cases
Subtask1 sub1_in1.txt, sub1_in2.txt, sub1_in3.txt
Subtask2 sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt
Case Name Status Exec Time Memory
sub1_in1.txt AC 1 ms 384 KB
sub1_in2.txt AC 2 ms 384 KB
sub1_in3.txt AC 2 ms 384 KB
sub2_in1.txt AC 1 ms 384 KB
sub2_in2.txt AC 6 ms 640 KB
sub2_in3.txt AC 10 ms 1024 KB