Submission #2713041


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair


ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }
//

map<ll,ll> memo;

ll f(ll N) {
    if (found(memo,N)) return memo[N];

    for (ll i=0,p=1LL;p<=N;++i,p<<=1LL) {
        ll d = N - p;
        if (d < p) {
            // ll a = f(d) + pow(3,i) - f(p*2-1-N); //d*2-N);
            ll a = SUB(ADD(f(d), POW(3,i)), f(p*2-1-N));
#ifdef DEBUG
            fprintf(stderr, "f(%lld) = %lld; d=%lld,i=%lld,p=%g\n", N, a, d,i,pow(3,i));
#endif
            memo[N] = a;
            return a;
        }
    }
}

int main() {
    memo[0] = 0LL;
    memo[1] = 1LL;

    ll N; cin >> N;
    cout << f(N+1) << endl;
    // cout << (solve(N,a) ? "Yes":"No") << endl;
    return 0;
}

Submission Info

Submission Time
Task D - Xor Sum
User naoya_t
Language C++14 (GCC 5.4.1)
Score 600
Code Size 2357 Byte
Status
Exec Time 1 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt, sample_03.txt
All 600 / 600 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 1 ms 256 KB
sample_02.txt 1 ms 256 KB
sample_03.txt 1 ms 256 KB
subtask_1_max_01.txt 1 ms 256 KB
subtask_1_rand_01.txt 1 ms 256 KB
subtask_1_rand_02.txt 1 ms 256 KB
subtask_1_rand_03.txt 1 ms 256 KB
subtask_1_rand_04.txt 1 ms 256 KB
subtask_1_rand_05.txt 1 ms 256 KB
subtask_1_small_rand_01.txt 1 ms 256 KB
subtask_1_small_rand_02.txt 1 ms 256 KB
subtask_1_small_rand_03.txt 1 ms 256 KB
subtask_1_small_rand_04.txt 1 ms 256 KB
subtask_1_small_rand_05.txt 1 ms 256 KB
subtask_1_specific_01.txt 1 ms 256 KB
subtask_1_specific_02.txt 1 ms 256 KB
subtask_1_specific_03.txt 1 ms 256 KB
subtask_1_specific_04.txt 1 ms 256 KB
subtask_1_specific_05.txt 1 ms 256 KB