Submission #2530567
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define REP(i,m) for(int i=0; i<m; i++) #define FOR(i,n,m) for(long long i=n; i<m; i++) #define INF 1000000001 #define INFL (1LL << 60) #define MOD 1000000007 #define ALL(v) v.begin(),v.end() #define pb push_back #define ll long long int #define P pair<ll, ll> int main() { int n; cin >> n; string s[n+1], t[n+1]; REP(i, n){ string k; cin >> k; s[i] = k; t[i] = k; REP(j, s[i].size()) if(s[i][j] == '?') s[i][j] = 'a'; REP(j, s[i].size()) if(t[i][j] == '?') t[i][j] = 'z'; } cin >> s[n]; t[n] = s[n]; string p = s[n]; sort(s, s+n+1); sort(t, t+n+1); vector<int> v; REP(i, n+1){ if(s[i] == p || t[i] == p) v.pb(i+1); } sort(ALL(v)); FOR(i, v[0], v[v.size()-1]+1){ cout << i; if(i == v[v.size()-1]) cout << endl; else cout << " "; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Atcoder Handles |
User | EctoPlasma |
Language | C++14 (GCC 5.4.1) |
Score | 250 |
Code Size | 909 Byte |
Status | AC |
Exec Time | 18 ms |
Memory | 1408 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 | 256 KB |
sub1_in3.txt | AC | 2 ms | 384 KB |
sub2_in1.txt | AC | 1 ms | 256 KB |
sub2_in2.txt | AC | 10 ms | 768 KB |
sub2_in3.txt | AC | 18 ms | 1408 KB |