Submission #1213088


Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cctype>
#define rep(i,a,b) for(int i=(a);i<b;i++)
#define INF 1000000000
#define MAX_N 100000000
using namespace std;
bool debug=false;

int main(){
  bool space=false;
  int n;
  string s[100001],t;
  cin>>n;
  rep(i,0,n)cin>>s[i];
  sort(s,s+n);
  cin>>t;
  if(s[0]>=t){
    if(space)cout<<" ";
    else space=true;
    cout<<1;
  }
  for(int i=1;i<n;i++){
    if(s[i-1]<=t&&s[i]>=t){
    if(space)cout<<" ";
    else space=true;
      cout<<i+1;
    }
  }
  if(s[n-1]<=t){
    if(space)cout<<" ";
    else space=true;
    cout<<n+1;
  }
  cout<<endl;
  return 0;
}

Submission Info

Submission Time
Task A - Atcoder Handles
User mkan_0141
Language C++14 (GCC 5.4.1)
Score 130
Code Size 747 Byte
Status WA
Exec Time 13 ms
Memory 1536 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 2 ms 1024 KB
sub1_in2.txt AC 3 ms 1024 KB
sub1_in3.txt AC 3 ms 1024 KB
sub2_in1.txt WA 2 ms 1024 KB
sub2_in2.txt WA 7 ms 1280 KB
sub2_in3.txt WA 13 ms 1536 KB