Submission #1213075
Source Code Expand
#include<map> #include<set> #include<list> #include<cmath> #include<queue> #include<stack> #include<cstdio> #include<string> #include<vector> #include<complex> #include<cstdlib> #include<cstring> #include<numeric> #include<sstream> #include<iostream> #include<algorithm> #include<functional> #define mp make_pair #define pb push_back #define all(x) (x).begin(),(x).end() #define YES() printf("YES\n") #define NO() printf("NO\n") using namespace std; #define int long long //typedef long long ll; typedef unsigned long long ull; typedef vector<bool> vb; typedef vector<int> vi; typedef vector<vb> vvb; typedef vector<vi> vvi; typedef pair<int,int> P; const int INF=1e+9; const double EPS=1e-9; const int MOD = 1000000007; const int dx[]={1,0,-1,0},dy[]={0,-1,0,1}; signed main(){ int n,prev = 0,next = 0; string s[10000],t,a[10000],z[10000]; cin >> n; for(int i = 0;i < n;i++) { cin >> s[i]; a[i] = s[i]; z[i] = s[i]; for(int j = 0;j < s[i].length();j++){ if(s[i][j] == '?') { a[i][j] = 'a'; z[i][j] = 'z'; } else{ a[i][j] = s[i][j]; z[i][j] = s[i][j]; } } } cin >> t; for(int i = 0;i < n;i++){ if(z[i] < t) prev++; if(a[i] > t) next++; } for(int i = prev + 1;i <= n - next + 1;i++) cout << (i != prev + 1 ? " " : "") << i; cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Atcoder Handles |
User | hoget157 |
Language | C++14 (GCC 5.4.1) |
Score | 250 |
Code Size | 1458 Byte |
Status | AC |
Exec Time | 12 ms |
Memory | 2048 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 | 2 ms | 512 KB |
sub1_in2.txt | AC | 2 ms | 512 KB |
sub1_in3.txt | AC | 2 ms | 640 KB |
sub2_in1.txt | AC | 2 ms | 512 KB |
sub2_in2.txt | AC | 7 ms | 1280 KB |
sub2_in3.txt | AC | 12 ms | 2048 KB |