Submission #1244505


Source Code Expand

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mt make_tuple
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef tuple<int,int,int> tp;
typedef vector<tp> vt;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-7;
const int inf=1e8;
const ll INF=1e16;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
int main(){
	int n;
	cin>>n;
	vs in(n);
	rep(i,n)cin>>in[i];
	string t;
	cin>>t;
	int a=0,b=0;
	rep(i,n){
		string S="",T="";
		rep(j,in[i].size()){
			if(in[i][j]=='?'){
				S+="a";
				T+="z";
			}else{
				S+=in[i][j];
				T+=in[i][j];
			}
		}
		if(S<=t)a++;
		if(t<=T)b++;
	}
	loop(i,n-b+1,a+2)cout<<i<<" ";
	cout<<endl;
}









Submission Info

Submission Time
Task A - Atcoder Handles
User ixmel_rd
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1356 Byte
Status WA
Exec Time 15 ms
Memory 896 KB

Judge Result

Set Name Subtask1 Subtask2
Score / Max Score 0 / 130 0 / 120
Status
WA × 3
WA × 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 WA 1 ms 256 KB
sub1_in2.txt WA 2 ms 256 KB
sub1_in3.txt WA 2 ms 256 KB
sub2_in1.txt WA 1 ms 256 KB
sub2_in2.txt WA 8 ms 640 KB
sub2_in3.txt WA 15 ms 896 KB