結果

問題 No.1729 ～サンプルはちゃんと見て！～　16進数と8進数(1)
ユーザー shojin_proshojin_pro
提出日時 2021-11-05 21:45:00
言語 Java21
(openjdk 21)
結果
AC  
実行時間 49 ms / 2,000 ms
コード長 5,026 bytes
コンパイル時間 2,720 ms
コンパイル使用メモリ 82,192 KB
実行使用メモリ 50,104 KB
最終ジャッジ日時 2023-08-06 09:33:55
合計ジャッジ時間 4,969 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
49,544 KB
testcase_01 AC 46 ms
49,440 KB
testcase_02 AC 45 ms
49,716 KB
testcase_03 AC 48 ms
49,916 KB
testcase_04 AC 45 ms
49,712 KB
testcase_05 AC 46 ms
49,836 KB
testcase_06 AC 46 ms
49,920 KB
testcase_07 AC 47 ms
49,728 KB
testcase_08 AC 47 ms
49,656 KB
testcase_09 AC 48 ms
50,104 KB
testcase_10 AC 47 ms
47,628 KB
testcase_11 AC 47 ms
49,812 KB
testcase_12 AC 49 ms
49,712 KB
testcase_13 AC 47 ms
49,712 KB
testcase_14 AC 46 ms
49,672 KB
testcase_15 AC 47 ms
49,552 KB
testcase_16 AC 47 ms
49,496 KB
testcase_17 AC 47 ms
49,752 KB
testcase_18 AC 47 ms
49,932 KB
testcase_19 AC 46 ms
49,620 KB
testcase_20 AC 46 ms
49,768 KB
testcase_21 AC 47 ms
49,596 KB
testcase_22 AC 46 ms
49,732 KB
testcase_23 AC 46 ms
49,612 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    static long mod = (long) 1e9 + 7;

    public static void main(String[] args) throws Exception {
        solve();
        pw.flush();
    }

    public static void solve() {
        HashMap<Character,String> map = new HashMap<>();
        map.put('A',"1010");
        map.put('B',"1011");
        map.put('C',"1100");
        map.put('D',"1101");
        map.put('E',"1110");
        map.put('F',"1111");
        char[] s = sc.next().toCharArray();
        for(char c : s){
            sb.append(map.get(c));
        }
        String s2 = sb.toString();
        int[] cnt = new int[8];
        for(int i = s2.length(); i > 0; i-=3){
            char[] ss = s2.substring(Math.max(0,i-3),i).toCharArray();
            if(ss.length == 3){
                int now = (ss[0]-'0')*4+(ss[1]-'0')*2+(ss[2]-'0');
                cnt[now]++;
            }else if(ss.length == 2){
                int now = (ss[0]-'0')*2+(ss[1]-'0');
                cnt[now]++;
            }else{
                int now = ss[0]-'0';
                cnt[now]++;
            }
        }
        ArrayList<int[]> arr = new ArrayList<>();
        for(int i = 0; i < 8; i++){
            arr.add(new int[]{i,cnt[i]});
        }
        Collections.sort(arr, new ArrayComparator());
        int max = arr.get(0)[1];
        sb.setLength(0);
        for(int i = 0; i < 8; i++){
            if(arr.get(i)[1] != max){
                break;
            }else{
                sb.append(arr.get(i)[0]).append(" ");
            }
        }
        pw.println(sb.toString().trim());
    }
    
    static class ArrayComparator implements Comparator<int[]> {
        @Override
        public int compare(int[] a1, int[] a2) {
            if(a1[1] > a2[1]){
                return -1;
            }else if(a1[1] < a2[1]){
                return 1;
            }else{
                if(a1[0] < a2[0]){
                    return -1;
                }else{
                    return 1;
                }
            }
        }
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
0