Submission #2548169
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define all(vec) vec.begin(),vec.end() typedef long long int ll; typedef pair<int,int> P; const ll MOD=1000000007; const ll INF=1000000010; const ll LINF=4000000000000000010LL; const int MAX=310; const double EPS=1e-9; int dx[4]={0,1,0,-1}; int dy[4]={1,0,-1,0}; int main(){ int n;cin>>n; vector<string> v1,v2; for(int i=0;i<n;i++){ string s;cin>>s; string t=""; string t2=""; for(auto c:s){ if(c=='?'){ t.push_back('a'); t2.push_back('z'); }else{ t.push_back(c); t2.push_back(c); } } v1.push_back(t); v2.push_back(t2); } string t;cin>>t; sort(all(v1)); sort(all(v2)); int a=0,b=0; for(auto s:v1){ if(s>=t){ break; } a++; } for(auto s:v2){ if(s>t){ break; } b++; } for(int i=min(a,b);i<=max(a,b);i++){ cout<<i+1; if(i!=max(a,b))cout<<" "; } cout<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Atcoder Handles |
User | TAISA_ |
Language | C++14 (GCC 5.4.1) |
Score | 250 |
Code Size | 1157 Byte |
Status | AC |
Exec Time | 21 ms |
Memory | 1536 KB |
Judge Result
Set Name | Subtask1 | Subtask2 | ||||
---|---|---|---|---|---|---|
Score / Max Score | 130 / 130 | 120 / 120 | ||||
Status |
|
|
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 | 256 KB |
sub1_in2.txt | AC | 2 ms | 384 KB |
sub1_in3.txt | AC | 2 ms | 384 KB |
sub2_in1.txt | AC | 1 ms | 256 KB |
sub2_in2.txt | AC | 11 ms | 896 KB |
sub2_in3.txt | AC | 21 ms | 1536 KB |