#9562 (Java) No.133 カードゲーム

• 問題: No.133 カードゲーム
• ユーザー: ki_ki33
• 提出日時: 2015-01-22 23:45:15
• 言語: Java (openjdk 23)
• 結果: WA (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 1,635 bytes
• コンパイル時間: 2,296 ms
• コンパイル使用メモリ: 78,284 KB
• 実行使用メモリ: 54,324 KB
• 最終ジャッジ日時: 2024-10-07 03:31:06
• 合計ジャッジ時間: 6,248 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
sample	AC * 4
other	AC * 16 WA * 3

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
import java.io.BufferedInputStream;
import java.io.IOException;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
import java.util.Map.Entry;
public class Main {
    public static final int C =  1000000007;
    static final int CY = 1000000000;
    //static boolean MAP[][];
    static int N;
    static int M;
    static int MAX = -1;
    //static int tic[][];
    static int A[];
    static int B[];
    //static int max;
    static long DP[];
    static int ST[][];
    //static int p[];
    //static ArrayList<HashSet<Integer>> al;
    static TreeMap<Integer, ArrayList<Integer>> hm;
    //static ArrayList<Integer> al;
    //static int a[][];
    //static char[][] ch;
    //static ArrayList<HashMap<Long, Long>> al;
    //static String a[];
    //static String str;
    public static void main(String[] args) {
        //StringBuilder sb = new StringBuilder();
        BufferedInputStream bs = new BufferedInputStream(System.in);
        Scanner sc = new Scanner(bs);
        
        N = sc.nextInt();
        
        A = new int[N];
        B = new int[N];
        for (int i=0; i < N; i++) {
            A[i] = sc.nextInt();
            
        }
        for (int i=0; i< N;i++) {
            B[i] = sc.nextInt();
        }
        
        double ans = 0;
        
        double num = 0;
        switch (N) {
        case 1:
            num = 1;
            break;
        case 2:
            num = 2;
            break;
        case 3:
            num = 6;
            break;
        case 4:
            num = 24;
            break;
        }
        double win = 0;
        int c = 0;
        for (int i=0; i < num; i++) {
            
            int in = A[0];
            A[0] = A[c];
            A[c] = in;
            
            c = (c+1 == N? c=1:c+1);
            
            int n = 0;
            
            for (int t =0; t < N; t++) {
                if (A[t] > B[t]) {
                    n++;
                }
            }
            if (n > N/2) {
                win++;
            }
        }
        
        ans = win / num;
        
        System.out.println(ans);
    }
    
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX