AtCoder Grand Contest 016

Submission #1575689

Source codeソースコード

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.Globalization;
using System.Diagnostics;



class Myon
{
    public Myon() { }
    public static int Main()
    {
        new Myon().calc();
        return 0;
    }
    

    Scanner cin;

    void calc()
    {
        cin = new Scanner();
        string S = cin.next();
        int ans = S.Length;
        for (int i = 0; i < 26; i++)
        {
            char c = (char)('a' + i);

            int tmp = 0;
            int cnt = 0;
            for (int j = 0; j < S.Length; j++)
            {
                if (S[j] == c)
                {
                    tmp = Math.Max(tmp, cnt);
                    cnt = 0;
                }
                else cnt++;
            }
            tmp = Math.Max(tmp, cnt);
            ans = Math.Min(tmp, ans);
        }
        Console.WriteLine(ans);
    }
    


}


class Scanner
{
    string[] s;
    int i;

    char[] cs = new char[] { ' ' };

    public Scanner()
    {
        s = new string[0];
        i = 0;
    }

    public string next()
    {
        if (i < s.Length) return s[i++];
        string st = Console.ReadLine();
        while (st == "") st = Console.ReadLine();
        s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
        if (s.Length == 0) return next();
        i = 0;
        return s[i++];
    }

    public int nextInt()
    {
        return int.Parse(next());
    }
    public int[] ArrayInt(int N, int add = 0)
    {
        int[] Array = new int[N];
        for (int i = 0; i < N; i++)
        {
            Array[i] = nextInt() + add;
        }
        return Array;
    }

    public long nextLong()
    {
        return long.Parse(next());
    }

    public long[] ArrayLong(int N, long add = 0)
    {
        long[] Array = new long[N];
        for (int i = 0; i < N; i++)
        {
            Array[i] = nextLong() + add;
        }
        return Array;
    }

    public double nextDouble()
    {
        return double.Parse(next());
    }


    public double[] ArrayDouble(int N, double add = 0)
    {
        double[] Array = new double[N];
        for (int i = 0; i < N; i++)
        {
            Array[i] = nextDouble() + add;
        }
        return Array;
    }
}

Submission

Task問題 A - Shrinking
User nameユーザ名 chokudai
Created time投稿日時
Language言語 C# (Mono 4.6.2.0)
Status状態 AC
Score得点 300
Source lengthソースコード長 2437 Byte
File nameファイル名
Exec time実行時間 20 ms
Memory usageメモリ使用量 11092 KB

Test case

Set

Set name Score得点 / Max score Cases
Sample - 0_00.txt,0_01.txt,0_02.txt,0_03.txt
All 300 / 300 0_00.txt,0_01.txt,0_02.txt,0_03.txt,1_00.txt,1_01.txt,1_02.txt,1_03.txt,1_04.txt,1_05.txt,1_06.txt,1_07.txt,1_08.txt,1_09.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
0_00.txt AC 20 ms 9044 KB
0_01.txt AC 19 ms 11092 KB
0_02.txt AC 20 ms 11092 KB
0_03.txt AC 19 ms 9044 KB
1_00.txt AC 20 ms 11092 KB
1_01.txt AC 20 ms 11092 KB
1_02.txt AC 19 ms 9044 KB
1_03.txt AC 19 ms 9044 KB
1_04.txt AC 20 ms 9044 KB
1_05.txt AC 20 ms 9044 KB
1_06.txt AC 19 ms 9044 KB
1_07.txt AC 19 ms 9044 KB
1_08.txt AC 20 ms 11092 KB
1_09.txt AC 19 ms 11092 KB