Submission #1240545
Source Code Expand
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
using ll=long long;
using R=long double;
const R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max(x,0.0L));}
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
// Problem Specific Parameter:
ll n;
const int m=62;
ll dp[m+1][3];
const ll mod=1000000007LL;
int main(void){
cin >> n;
dp[0][0]=1LL;
rep(i,m)rep(j,3){
const int cur=(n>>(m-1-i))&1;
rep(d,3){
const int ni=i+1;
const int nj=min(2,2*j+cur-d);
if(nj<0) continue;
dp[ni][nj]+=dp[i][j];
dp[ni][nj]%=mod;
}
}
ll ans=0LL;
rep(j,3) ans+=dp[m][j];
ans%=mod;
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Xor Sum |
User |
Hec |
Language |
C++14 (GCC 5.4.1) |
Score |
600 |
Code Size |
1615 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 |