Submission #7029596
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define p(s) std::cout << s ;
# define pl(s) std::cout << s << endl;
# define printIf(j,s1,s2) cout << (j ? s1 : s2) << endl;
# define YES(j) cout << (j ? "YES" : "NO") << endl;
# define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
# define yes(j) std::cout << (j ? "yes" : "no") << endl;
# define all(v) v.begin(),v.end()
# define showVector(v) REP(i,v.size()){p(v[i]);p(" ")} pl("")
template<class T> inline bool chmin(T &a, T b){ if(a > b) { a = b; return true;} return false;}
template<class T> inline bool chmax(T &a, T b){ if(a < b) { a = b; return true;} return false;}
typedef long long int ll;
typedef pair<ll,ll> P_ii;
typedef pair<double,double> P_dd;
template<class T>
vector<T> make_vec(size_t a){
return vector<T>(a);
}
template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}
template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
for(auto &e:t) fill_v(e,v);
}
const int MOD = 1000000007;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
void addM(long long &a, long long b) {
a += b;
if (a >= MOD) a -= MOD;
}
void mulM(long long &a, long long b) {
a = ((a%MOD)*(b%MOD))%MOD ;
}
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
vector<pair<long long, long long> > prime_factorize(long long n) {
vector<pair<long long, long long> > res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0) continue;
int num = 0;
while (n % p == 0) { ++num; n /= p; }
res.push_back(make_pair(p, num));
}
if (n != 1) res.push_back(make_pair(n, 1));
return res;
}
// ビット判定
// 2^nビットが1か0かを返す
int nth_bit(ll num, int n){
return (num >> n) & 1;
}
// dp[i][j]:2^i桁目の数まで決めて、Nとの差がj(0,1,2以上)である時の場合の数
ll dp[61][3];
int main(){
ll N;
cin >> N;
dp[60][0] = 1;
for(int d = 59; d >= 0; d--){
int isBitOn = nth_bit(N, d);
if (isBitOn) {
// s = 0
addM(dp[d][1], dp[d + 1][0]); // (0,0)
addM(dp[d][0], dp[d + 1][0]); // (0,1)
// (1,1)は不可
// s = 1
addM(dp[d][2], dp[d + 1][1]); // (0,0)
addM(dp[d][2], dp[d + 1][1]); // (0,1)
addM(dp[d][1], dp[d + 1][1]); // (1,1)
// s = 2
addM(dp[d][2], dp[d + 1][2]); // (0,0)
addM(dp[d][2], dp[d + 1][2]); // (0,1)
addM(dp[d][2], dp[d + 1][2]); // (1,1)
} else {
// s = 0
addM(dp[d][0], dp[d + 1][0]); // (0,0)
// (0,1),(1,1)は不可
// s = 1
addM(dp[d][2], dp[d + 1][1]); // (0,0)
addM(dp[d][1], dp[d + 1][1]); // (0,1)
addM(dp[d][0], dp[d + 1][1]); // (1,1)
// s = 2
addM(dp[d][2], dp[d + 1][2]); // (0,0)
addM(dp[d][2], dp[d + 1][2]); // (0,1)
addM(dp[d][2], dp[d + 1][2]); // (1,1)
}
}
ll ans = (dp[0][0] + dp[0][1] + dp[0][2]) % MOD;
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Xor Sum |
User |
azz |
Language |
C++14 (GCC 5.4.1) |
Score |
600 |
Code Size |
4038 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
600 / 600 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_max_01.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_rand_03.txt, subtask_1_rand_04.txt, subtask_1_rand_05.txt, subtask_1_small_rand_01.txt, subtask_1_small_rand_02.txt, subtask_1_small_rand_03.txt, subtask_1_small_rand_04.txt, subtask_1_small_rand_05.txt, subtask_1_specific_01.txt, subtask_1_specific_02.txt, subtask_1_specific_03.txt, subtask_1_specific_04.txt, subtask_1_specific_05.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
sample_03.txt |
AC |
1 ms |
256 KB |
subtask_1_max_01.txt |
AC |
1 ms |
256 KB |
subtask_1_rand_01.txt |
AC |
1 ms |
256 KB |
subtask_1_rand_02.txt |
AC |
1 ms |
256 KB |
subtask_1_rand_03.txt |
AC |
1 ms |
256 KB |
subtask_1_rand_04.txt |
AC |
1 ms |
256 KB |
subtask_1_rand_05.txt |
AC |
1 ms |
256 KB |
subtask_1_small_rand_01.txt |
AC |
1 ms |
256 KB |
subtask_1_small_rand_02.txt |
AC |
1 ms |
256 KB |
subtask_1_small_rand_03.txt |
AC |
1 ms |
256 KB |
subtask_1_small_rand_04.txt |
AC |
1 ms |
256 KB |
subtask_1_small_rand_05.txt |
AC |
1 ms |
256 KB |
subtask_1_specific_01.txt |
AC |
1 ms |
256 KB |
subtask_1_specific_02.txt |
AC |
1 ms |
256 KB |
subtask_1_specific_03.txt |
AC |
1 ms |
256 KB |
subtask_1_specific_04.txt |
AC |
1 ms |
256 KB |
subtask_1_specific_05.txt |
AC |
1 ms |
256 KB |