Submission #5878727


Source Code Expand

Copy
#define DEBUG 0
/**
 * File    : E.cpp
 * Author  : Kazune Takahashi
 * Created : 6/11/2019, 7:23:52 PM
 * Powered by Visual Studio Code
 */
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <complex>
#include <tuple>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <functional>
#include <random>
#include <chrono>
#include <cctype>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
typedef long long ll;
void Yes()
{
  cout << "Yes" << endl;
  exit(0);
}
void No()
{
  cout << "No" << endl;
  exit(0);
}
const int MAX_SIZE = 1000010;
class mint
{
public:
  static ll MOD;
  ll x;
  mint() : x(0) {}
  mint(ll x) : x(x % MOD) {}
  mint operator-() const { return mint(0) - *this; }
  mint &operator+=(const mint &a)
  {
    if ((x += a.x) >= MOD)
    {
      x -= MOD;
    }
    return *this;
  }
  mint &operator-=(const mint &a) { return *this += -a; }
  mint &operator*=(const mint &a)
  {
    (x *= a.x) %= MOD;
    return *this;
  }
  mint &operator/=(const mint &a) { return (*this *= power(MOD - 2)); }
  mint operator+(const mint &a) const { return mint(*this) += a; }
  mint operator-(const mint &a) const { return mint(*this) -= a; }
  mint operator*(const mint &a) const { return mint(*this) *= a; }
  mint operator/(const mint &a) const { return mint(*this) /= a; }
  bool operator<(const mint &a) const { return x < a.x; }
  bool operator==(const mint &a) const { return x == a.x; }
  const mint power(ll N)
  {
    if (N == 0)
    {
      return 1;
    }
    else if (N % 2 == 1)
    {
      return *this * power(N - 1);
    }
    else
    {
      mint half = power(N / 2);
      return half * half;
    }
  }
};
ll mint::MOD = 1e9 + 7;
istream &operator>>(istream &stream, mint &a) { return stream >> a.x; }
ostream &operator<<(ostream &stream, const mint &a) { return stream << a.x; }
mint inv[MAX_SIZE];
mint fact[MAX_SIZE];
mint factinv[MAX_SIZE];
void init()
{
  inv[1] = 1;
  for (int i = 2; i < MAX_SIZE; i++)
  {
    inv[i] = (-inv[mint::MOD % i]) * (mint::MOD / i);
  }
  fact[0] = factinv[0] = 1;
  for (int i = 1; i < MAX_SIZE; i++)
  {
    fact[i] = mint(i) * fact[i - 1];
    factinv[i] = inv[i] * factinv[i - 1];
  }
}
mint choose(int n, int k)
{
  if (n >= 0 && k >= 0 && n - k >= 0)
  {
    return fact[n] * factinv[k] * factinv[n - k];
  }
  return 0;
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
// const double epsilon = 1e-10;
// const ll infty = 1000000000000000LL;
// const int dx[4] = {1, 0, -1, 0};
// const int dy[4] = {0, 1, 0, -1};

string L;
int N;
mint dp[2][100010];

int main()
{
  // init();
  cin >> L;
  N = L.size();
  dp[0][0] = 1;
  for (auto i = 0; i < N; i++)
  {
    dp[1][i + 1] += (mint)3 * dp[1][i];
    if (L[i] == '0')
    {
      dp[0][i + 1] += dp[0][i];
    }
    else
    {
      dp[0][i + 1] += (mint)2 * dp[0][i];
      dp[1][i + 1] += dp[0][i];
    }
  }
  cout << dp[0][N] + dp[1][N] << endl;
}

Submission Info

Submission Time
Task E - Sum Equals Xor
User kazunetakahashi
Language C++14 (GCC 5.4.1)
Score 500
Code Size 3229 Byte
Status
Exec Time 15 ms
Memory 25472 KB

Test Cases

Set Name Score / Max Score Test Cases
All 500 / 500 all_one, one_one, only_one, random_large_01, random_large_010, random_large_02, random_large_03, random_large_04, random_large_05, random_large_06, random_large_07, random_large_08, random_large_09, random_small_01, random_small_02, random_small_03, random_small_04, sample_01, sample_02
Sample 0 / 0 sample_01, sample_02
Case Name Status Exec Time Memory
all_one 15 ms 25472 KB
one_one 13 ms 25472 KB
only_one 8 ms 25216 KB
random_large_01 15 ms 25472 KB
random_large_010 15 ms 25472 KB
random_large_02 15 ms 25472 KB
random_large_03 15 ms 25472 KB
random_large_04 15 ms 25472 KB
random_large_05 15 ms 25472 KB
random_large_06 15 ms 25472 KB
random_large_07 15 ms 25472 KB
random_large_08 15 ms 25472 KB
random_large_09 15 ms 25472 KB
random_small_01 8 ms 25216 KB
random_small_02 8 ms 25216 KB
random_small_03 8 ms 25216 KB
random_small_04 8 ms 25216 KB
sample_01 8 ms 25216 KB
sample_02 8 ms 25216 KB