結果

問題 No.685 Logical Operations
ユーザー uwi
提出日時 2018-05-11 23:17:26
言語 Java
(openjdk 23)
結果
AC  
実行時間 57 ms / 2,000 ms
コード長 4,371 bytes
コンパイル時間 4,017 ms
コンパイル使用メモリ 88,236 KB
実行使用メモリ 50,404 KB
最終ジャッジ日時 2024-06-28 09:01:09
合計ジャッジ時間 6,579 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

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

package contest180511;
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 D {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
    
    void solve()
    {
        long n = nl();
        if(n == 0){
            out.println(0);
            return;
        }
        
        int mod = 1000000007;
        long[][] dp = new long[4][3];
        dp[3][0] = 1;
        for(int i = Long.numberOfTrailingZeros(Long.highestOneBit(n));i >= 0;i--){
            long[][] ndp = new long[4][3];
            for(int o = 0;o < 3;o++){
                for(int j = 0;j < 4;j++){
                    int no = o;
                    if(j == 3){
                        if(o == 1)no = 2;
                        if(o == 0)continue;
                    }
                    if((j == 2 || j == 1) && o == 0)no = 1;
                    ndp[0][no] += dp[0][o];
                    ndp[0][no] %= mod;
                    
                    if(!(n<<~i>=0 && (j&1) == 1)){
                        int nu = (j&1) == 0 && n<<~i<0 ? 0 : 1;
                        ndp[nu][no] += dp[1][o];
                        ndp[nu][no] %= mod;
                    }
                    if(!(n<<~i>=0 && (j&2) == 2)){
                        int nu = (j&2) == 0 && n<<~i<0 ? 0 : 2;
                        ndp[nu][no] += dp[2][o];
                        ndp[nu][no] %= mod;
                    }
                    if(!(n<<~i>=0 && j > 0)){
                        int nu = ((j&2) == 0 && n<<~i<0 ? 0 : 2) | ((j&1) == 0 && n<<~i<0 ? 0 : 1);
                        ndp[nu][no] += dp[3][o];
                        ndp[nu][no] %= mod;
                    }
                }
            }
            dp = ndp;
        }
        
        long ans = 0;
        for(int i = 0;i < 4;i++){
            ans += dp[i][2];
        }
        out.println(ans%mod*invl(2, mod)%mod);
    }
    
    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 D().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