結果

問題 No.118 門松列(2)
ユーザー yuya178yuya178
提出日時 2017-09-22 17:25:11
言語 Java21
(openjdk 21)
結果
AC  
実行時間 179 ms / 5,000 ms
コード長 4,983 bytes
コンパイル時間 2,352 ms
コンパイル使用メモリ 81,452 KB
実行使用メモリ 59,392 KB
最終ジャッジ日時 2024-04-25 22:52:28
合計ジャッジ時間 7,034 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 99 ms
56,504 KB
testcase_01 AC 179 ms
59,148 KB
testcase_02 AC 164 ms
59,260 KB
testcase_03 AC 166 ms
59,080 KB
testcase_04 AC 166 ms
59,244 KB
testcase_05 AC 165 ms
59,116 KB
testcase_06 AC 98 ms
56,736 KB
testcase_07 AC 103 ms
57,548 KB
testcase_08 AC 95 ms
56,796 KB
testcase_09 AC 162 ms
58,784 KB
testcase_10 AC 107 ms
57,016 KB
testcase_11 AC 107 ms
57,160 KB
testcase_12 AC 100 ms
56,704 KB
testcase_13 AC 96 ms
56,732 KB
testcase_14 AC 164 ms
59,392 KB
testcase_15 AC 100 ms
56,692 KB
testcase_16 AC 127 ms
58,004 KB
testcase_17 AC 99 ms
56,640 KB
testcase_18 AC 110 ms
56,988 KB
testcase_19 AC 152 ms
58,560 KB
testcase_20 AC 153 ms
59,072 KB
testcase_21 AC 150 ms
59,316 KB
testcase_22 AC 109 ms
57,040 KB
testcase_23 AC 156 ms
59,140 KB
testcase_24 AC 111 ms
57,500 KB
testcase_25 AC 148 ms
58,788 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Main {
    static InputStream is;
    static PrintWriter out;
    static String INPUT = "";
    
    static void solve()
    {
        int n = ni();
        int[] a = na(n);
        Arrays.sort(a);
        long[][] C = new long[100000 + 1][3 + 1];
        for (int i = 0; i <= 100000; i++) {
            C[i][0] = 1;
            for (int j = 1; j <= Math.min(i,3); j++) {
                C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
            }
        }
        long res = C[n][3];
        int cout = 1;
        for(int i = 0; i < a.length-1; i++){
            if(a[i] == a[i+1]) cout++;
            if(a[i] != a[i+1] || i == a.length-2){
                res -= (n-cout)*C[cout][2]+C[cout][3];
                cout = 1;
            }
        }
        out.println(res%(1000000000+7));
    }
    
    public static void main(String[] args) throws Exception
    {
        long S = System.currentTimeMillis();
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        solve();
        out.flush();
        long G = System.currentTimeMillis();
        tr(G-S+"ms");
    }
    
    private static boolean eof()
    {
        if(lenbuf == -1)return true;
        int lptr = ptrbuf;
        while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
        
        try {
            is.mark(1000);
            while(true){
                int b = is.read();
                if(b == -1){
                    is.reset();
                    return true;
                }else if(!isSpaceChar(b)){
                    is.reset();
                    return false;
                }
            }
        } catch (IOException e) {
            return true;
        }
    }
    
    private static byte[] inbuf = new byte[1024];
    static int lenbuf = 0, ptrbuf = 0;
    
    private static int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
//  private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
    private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private static double nd() { return Double.parseDouble(ns()); }
    private static char nc() { return (char)skip(); }
    
    private static String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private static char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private static char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private static int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private static int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }

    private static int[] nsi(){
        char[] s = ns().toCharArray();
        int[] a = new int[s.length];
        for(int j = 0; j < s.length; j++){
           a[j] = s[j] - '0';
        }
        return a;
    }
}
0