結果

問題 No.685 Logical Operations
ユーザー ミドリムシミドリムシ
提出日時 2018-05-12 00:05:49
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,407 bytes
コンパイル時間 606 ms
コンパイル使用メモリ 72,064 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-06-28 09:08:52
合計ジャッジ時間 1,402 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 13 WA * 14
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
int character_count(string text, char character){ int ans = 0; for(int i = 0; i < text.size(); i++){ ans += (text[i] == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position move_pattern[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
long gcd(long a, long b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }}
#define mod long(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))

long N;

long dp[70][3][3];

long choose(int now, int is_less_count, int phase){ // is_less_count : is_less_x + is_less_y, phase : nothing -> hetero -> dominant homo
    if(now < 0){
        return phase == 2;
    }else if(dp[now][is_less_count][phase] != -1){
        return dp[now][is_less_count][phase];
    }else if(is_less_count == 2){
        if(phase == 2){
            return dp[now][is_less_count][phase] = choose(now - 1, 2, 2) * 4 % mod;
        }else if(phase == 1){
            return dp[now][is_less_count][phase] = (choose(now - 1, 2, 2) + choose(now - 1, 2, 1) * 3) % mod;
        }else{
            return dp[now][is_less_count][phase] = (choose(now - 1, 2, 1) * 2 + choose(now - 1, 2, 0)) % mod;
        }
    }else if(is_less_count == 1 && ((N >> now) & 1)){
        if(phase == 2){
            return dp[now][is_less_count][phase] = (choose(now - 1, 2, 2) * 2 + choose(now - 1, 1, 2) * 2) % mod;
        }else{
            return dp[now][is_less_count][phase] = (choose(now - 1, 1, 2) + choose(now - 1, 1, 1) + choose(now - 1, 2, 1) * 2) % mod;
        }
    }else if(is_less_count == 1){
        return dp[now][is_less_count][phase] = choose(now - 1, 1, phase) * 2 % mod;
    }else if((N >> now) & 1){
        return dp[now][is_less_count][phase] = (choose(now - 1, 1, 1) * 2 + choose(now - 1, 2, 0)) % mod;
    }else{
        return dp[now][is_less_count][phase] = choose(now - 1, 0, 0) % mod;
    }
}

int main(){
    cin >> N;
    for(int i = 0; i < 70; i++){
        for(int j = 0; j < 3; j++){
            for(int k = 0; k < 3; k++){
                dp[i][j][k] = -1;
            }
        }
    }
    cout << choose(60, 0, 0) / 2 << endl;
}
0