Submission #1213086


Source Code Expand

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Globalization;
using System.Diagnostics;
using static System.Console;
using Pair = System.Collections.Generic.KeyValuePair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().Solve();
        Out.Flush();
    }
    Scanner cin = new Scanner();
    Random rnd = new Random();
    Stopwatch sw = new Stopwatch();
    readonly int[] dd = { 0, 1, 0, -1, 0 };
    readonly int mod = 1000000007;
    readonly string alfa = "abcdefghijklmnopqrstuvwxyz";


    void Solve()
    {
        int N = cin.Nextint;
        var S = new String[N];

        for (int i = 0; i < N; i++)
        {
            S[i] = cin.Next;
            //if (S[i] == "?") cnt++;
        }
        Array.Sort(S);
        var T = cin.Next;
        int min = LowerBound(S, T);
        int cnt = UpperBound(S, T);
        for (int i = min; i <= cnt; i++)
        {
            Write($"{i + 1}");
            if (i != cnt) Write(" ");
        }
        WriteLine();


    }

    int LowerBound(string[] arr, string val)
    {
        int low = 0, high = arr.Length;
        int mid;

        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }

    int UpperBound(string[] arr, string val)
    {
        int low = 0, high = arr.Length;
        int mid;

        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Scanner
{
    string[] s; int i;
    char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] Scan { get { return ReadLine().Split(); } }
    public int[] Scanint { get { return Array.ConvertAll(Scan, int.Parse); } }
    public long[] Scanlong { get { return Array.ConvertAll(Scan, long.Parse); } }
    public double[] Scandouble { get { return Array.ConvertAll(Scan, double.Parse); } }
    public string Next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return Next;
        }
    }
    public int Nextint { get { return int.Parse(Next); } }
    public long Nextlong { get { return long.Parse(Next); } }
    public double Nextdouble { get { return double.Parse(Next); } }
}

Submission Info

Submission Time
Task A - Atcoder Handles
User claw88
Language C# (Mono 4.6.2.0)
Score 130
Code Size 2816 Byte
Status WA
Exec Time 142 ms
Memory 13532 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 29 ms 13532 KB
sub1_in2.txt AC 32 ms 11484 KB
sub1_in3.txt AC 33 ms 11484 KB
sub2_in1.txt WA 29 ms 11484 KB
sub2_in2.txt WA 83 ms 13532 KB
sub2_in3.txt WA 142 ms 9476 KB