結果

問題 No.133 カードゲーム
ユーザー jun0sck
提出日時 2018-04-18 09:19:20
言語 Java
(openjdk 23)
結果
AC  
実行時間 57 ms / 5,000 ms
コード長 4,406 bytes
コンパイル時間 2,496 ms
コンパイル使用メモリ 80,676 KB
実行使用メモリ 37,584 KB
最終ジャッジ日時 2024-06-27 04:27:51
合計ジャッジ時間 4,825 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 19
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Main {
    private static Scanner sc;
    private static int[][] neg8 = new int[][]{{-1, -1}, {0, -1}, {1, -1}, {-1, 0}, {1, 0}, {-1, 1}, {0, 1}, {1, 1}};
    private static int[][] neg4 = new int[][]{{1, 0}, {0, -1}, {-1, 0}, {0, 1}};
    public static void main(String[] args) {
        Main instance = new Main();
        sc = instance.new Scanner();
        instance.solve();
    }
    private void solve() {
        try {
            int N = sc.nextInt();
            int[]a = new int[N];
            for (int i = 0; i < N; i++) {
                a[i] = sc.nextInt();
            }
            int[]b = new int[N];
            for (int i = 0; i < N; i++) {
                b[i] = sc.nextInt();
            }
            List<List<Integer>> al = new ArrayList<>();
            {
                Arrays.sort(a);
                al.add(genList(a));
                while (nextPermutation(a)) {
                    al.add(genList(a));
                }
            }
            List<List<Integer>> bl = new ArrayList<>();
            {
                Arrays.sort(b);
                bl.add(genList(b));
                while (nextPermutation(b)) {
                    bl.add(genList(b));
                }
            }
            int gameCount = 0;
            int totalWinA = 0;
            for (List<Integer> inta : al) {
                for (List<Integer> intb : bl) {
                    gameCount++;
                    int win = 0;
                    for (int i = 0; i < N; i++) {
                        if (intb.get(i) < inta.get(i)) win++;
                    }
                    if ((N/2) < win) totalWinA++;
                }
            }
            System.out.println(totalWinA / (float)gameCount);
        } catch (Exception e) {
            e.printStackTrace();
        }
    }
    private List<Integer> genList(int[]arr) {
        List<Integer> res = new ArrayList<>();
        for (int i : arr) {
            res.add(i);
        }
        return res;
    }
    private class Scanner {
        String[] s;
        int i;
        BufferedReader br;
        String regex = " ";
        public Scanner() {
            s = new String[0];
            i = 0;
            br = new BufferedReader(new InputStreamReader(System.in));
        }
        @Override
        protected void finalize() throws Throwable {
            try {
                super.finalize();
            } finally {
                destruction();
            }
        }
        private void destruction() throws IOException {
            if (br != null) br.close();
        }
        public String next() throws IOException {
            if (i < s.length) return s[i++];
            String st = br.readLine();
            while (st == "") st = br.readLine();
            s = st.split(regex, 0);
            i = 0;
            return s[i++];
        }
        public int nextInt() throws NumberFormatException, IOException {
            return Integer.parseInt(next());
        }
        public Long nextLong() throws NumberFormatException, IOException {
            return Long.parseLong(next());
        }
        public Double nextDouble() throws NumberFormatException, IOException {
            return Double.parseDouble(next());
        }
    }
    private static double distance(int x1, int x2, int y1, int y2) {
        return Math.sqrt((Math.pow(x1 - x2, 2) + Math.pow(y1 - y2, 2)));
    }
    private static boolean nextPermutation(int[] nums) {
        int i = nums.length - 2;
        while (i >= 0 && nums[i + 1] <= nums[i]) {
            i--;
        }
        boolean swap = false;
        if (i >= 0) {
            int j = nums.length - 1;
            while (j >= 0 && nums[j] <= nums[i]) {
                j--;
            }
            swap(nums, i, j);
            swap = true;
        }
        reverse(nums, i + 1);
        return swap;
    }
    private static void reverse(int[] nums, int start) {
        int i = start, j = nums.length - 1;
        while (i < j) {
            swap(nums, i, j);
            i++;
            j--;
        }
    }
    private static void swap(int[] nums, int i, int j) {
        int temp = nums[i];
        nums[i] = nums[j];
        nums[j] = temp;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0