結果

問題 No.641 Team Contest Estimation
ユーザー uwi
提出日時 2018-01-26 23:44:54
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 4,807 bytes
コンパイル時間 7,367 ms
コンパイル使用メモリ 84,512 KB
実行使用メモリ 52,436 KB
最終ジャッジ日時 2024-12-28 02:50:09
合計ジャッジ時間 6,245 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 5 WA * 4
権限があれば一括ダウンロードができます

ソースコード

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

package contest180126;
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 E {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
    
    void solve()
    {
        int n = ni(), K = ni();
        if(K == 0){
            out.println(0);
            out.println(0);
        }else{
            long[] a = new long[n];
            for(int i = 0;i < n;i++){
                a[i] = nl();
            }
            int[] cto = new int[K];
            for(int i = 0;i < n;i++){
                for(int j = 0;j < K;j++){
                    if(a[i]<<~j<0)cto[j]++;
                }
            }
            // j k 
            // 2^(K-2)*2^j*2^k
            
            // E(x) = n/2*(2^k-1)
            // V = (n/2*(2^k-1))^2 - 2^k*(2^k-1)(2^(k+1)-1)/6*n
            // V = (2^k*(2^k-1)(2^(k+1)-1)/6*n/2^K - (n/2*(2^k-1))^2)*4^k
            // (4.5)^2-
            // 14*3/4
            int mod = 1000000009;
            long mu = K == 0 ? 0 : n*pow(2, K-1, mod) % mod * (pow(2, K, mod) - 1) % mod;
            out.println(mu);
            // 5/4 4 -> 13?
            long base = (pow(2, K, mod) - 1)
                     * (pow(2, K+1, mod) - 1) % mod * invl(6, mod) % mod * n;
            long s = 0;
            for(int j = 0;j < K;j++){
                for(int k = j+1;k < K;k++){
                    s += pow(2, j+k+K, mod);
                }
            }
            s %= mod;
            s = s * ((long)n*(n-1)/2%mod) % mod;
            
            long u = 0;
            for(int j = 0;j < K;j++){
                long num = ((long)cto[j]*(cto[j]-1)/2+(long)(n-cto[j])*(n-cto[j]-1)/2)%mod*pow(2, 2*j+K, mod);
                u += num;
                u %= mod;
            }
            long e2 = (base*pow(2, K, mod)+s + u)% mod;
            e2 = e2 * invl(pow(2, K, mod), mod) % mod;
            
            long ans= e2*pow(4, K, mod) - mu*mu;
            ans %= mod;
            if(ans < 0)ans += mod;
            out.println(ans);
        }
    }
    
    public static long pow(long a, long n, long mod) {
        //      a %= mod;
        long ret = 1;
        int x = 63 - Long.numberOfLeadingZeros(n);
        for (; x >= 0; x--) {
            ret = ret * ret % mod;
            if (n << 63 - x < 0)
                ret = ret * a % mod;
        }
        return ret;
    }
    
    public static long invl(long a, long mod) {
        long b = mod;
        long p = 1, q = 0;
        while (b > 0) {
            long c = a / b;
            long d;
            d = a;
            a = b;
            b = d % b;
            d = p;
            p = q;
            q = d - c * q;
        }
        return p < 0 ? p + mod : p;
    }
    
    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//      Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//          @Override
//          public void run() {
//              long s = System.currentTimeMillis();
//              solve();
//              out.flush();
//              if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//          }
//      };
//      t.start();
//      t.join();
    }
    
    public static void main(String[] args) throws Exception { new E().run(); }
    
    private byte[] inbuf = new byte[1024];
    public int lenbuf = 0, ptrbuf = 0;
    
    private 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 boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private 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 int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private long[] nal(int n)
    {
        long[] a = new long[n];
        for(int i = 0;i < n;i++)a[i] = nl();
        return a;
    }
    
    private 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 int[][] nmi(int n, int m) {
        int[][] map = new int[n][];
        for(int i = 0;i < n;i++)map[i] = na(m);
        return map;
    }
    
    private int ni() { return (int)nl(); }
    
    private 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) { System.out.println(Arrays.deepToString(o)); }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0