Submission #1213098


Source Code Expand

#include<iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int N,A=0,Z=0;
string str[10000],a[10000],z[10000],T;
int main(){
	cin>>N;
	for(int i=0;i<N;++i){
		cin>>str[i];
		a[i]=str[i];
		z[i]=str[i];
		for(int j=0;j<str[i].size();++j){
			if(str[i][j]=='?'){
				a[i][j]='a';
				z[i][j]='z';
			}
		}
	}
	cin>>T;
	for(int i=0;i<N;++i){
		if(T>a[i]&&T>z[i])++A;
		if(T<a[i]&&T<z[i])++Z;
	}
	for(int i=A+1;i<=N-Z;++i){
		cout<<i<<" ";
	}
	cout<<N-Z+1<<endl;
	return 0;
}

Submission Info

Submission Time
Task A - Atcoder Handles
User peejee0904
Language C++14 (GCC 5.4.1)
Score 250
Code Size 541 Byte
Status AC
Exec Time 11 ms
Memory 1920 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 5 ms 1020 KB
sub1_in2.txt AC 2 ms 512 KB
sub1_in3.txt AC 2 ms 512 KB
sub2_in1.txt AC 1 ms 512 KB
sub2_in2.txt AC 6 ms 1280 KB
sub2_in3.txt AC 11 ms 1920 KB