Submission #1213081
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(int i = (l) ; i < (r); i++)
#define incII(i, l, r) for(int i = (l) ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r) ; i >= (l); i--)
#define inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) < (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define FOR(it, v) for(auto it = v.begin(); it != v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)
template<typename T> bool setmin(T & a, T b) { if(b < a) { a = b; return true; } else { return false; } }
template<typename T> bool setmax(T & a, T b) { if(b > a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
// ---- ----
int n;
string s[10001], t;
int main() {
cin >> n;
inc(i, n + 1) {
cin >> s[i];
if(i == n) { t = s[i]; }
inc(j, s[i].size()) { if(s[i][j] == '?') { return 1; } }
}
sort(s, s + n + 1);
bool flag = false;
inc(i, n + 1) {
if(s[i] == t) { cout << (flag ? " " : "") << i + 1; flag = true; }
}
cout << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Atcoder Handles |
User |
FF256grhy |
Language |
C++14 (GCC 5.4.1) |
Score |
130 |
Code Size |
1974 Byte |
Status |
RE |
Exec Time |
6 ms |
Memory |
892 KB |
Judge Result
Set Name |
Subtask1 |
Subtask2 |
Score / Max Score |
130 / 130 |
0 / 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 |
6 ms |
892 KB |
sub1_in2.txt |
AC |
2 ms |
384 KB |
sub1_in3.txt |
AC |
2 ms |
384 KB |
sub2_in1.txt |
RE |
1 ms |
256 KB |
sub2_in2.txt |
RE |
1 ms |
256 KB |
sub2_in3.txt |
RE |
1 ms |
256 KB |