Submission #1213008


Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef pair<int,int> pii;

int main(void) {
  int i,j;
  int n;
  cin>>n;
  vector<string> s(n);
  rep(i,n)cin>>s[i];
  string t;
  cin>>t;
  s.push_back(t);
  sort(all(s));
  vi ans;
  rep(i,n+1)
    if(s[i]==t)ans.push_back(i+1);
  rep(i,ans.size()){
    if(i)cout<<" ";
    cout<<ans[i];
  }
  cout<<endl;
}

Submission Info

Submission Time
Task A - Atcoder Handles
User rika0384
Language C++14 (GCC 5.4.1)
Score 130
Code Size 920 Byte
Status WA
Exec Time 12 ms
Memory 1024 KB

Judge Result

Set Name Subtask1 Subtask2
Score / Max Score 130 / 130 0 / 120
Status
AC × 3
AC × 3
WA × 3
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 8 ms 764 KB
sub1_in2.txt AC 2 ms 256 KB
sub1_in3.txt AC 2 ms 256 KB
sub2_in1.txt WA 1 ms 256 KB
sub2_in2.txt WA 6 ms 640 KB
sub2_in3.txt WA 12 ms 1024 KB