Submission #1213070
Source Code Expand
#include <iostream> #include <string> #include <algorithm> using namespace std; int main(void) { int N; cin >> N; string *S = new string[N+1]; for (int i = 0; i < N; ++i) { cin >> S[i]; } string T; cin >> T; S[N] = T; sort(S, S + N + 1); for (int i = 0; i < N + 1; ++i) { if (S[i] == T) cout << i + 1 << " "; } cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Atcoder Handles |
User | cosmos0906 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 387 Byte |
Status | WA |
Exec Time | 12 ms |
Memory | 896 KB |
Judge Result
Set Name | Subtask1 | Subtask2 | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 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 | WA | 7 ms | 764 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 | 6 ms | 512 KB |
sub2_in3.txt | WA | 12 ms | 896 KB |