結果

問題 No.1410 A lot of Bit Operations
ユーザー cn_449cn_449
提出日時 2021-04-19 22:18:25
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 5,220 bytes
コンパイル時間 1,464 ms
コンパイル使用メモリ 134,120 KB
最終ジャッジ日時 2025-01-20 22:16:37
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 44
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define range(i, a, b) for (ll i = (a); i < (b); i++)
#define pb push_back
#define debug(x) cerr << __LINE__ << ' ' << #x << ':' << (x) << '\n'
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef complex<ld> com;
template<class T> using pri_s = priority_queue<T, vector<T>, greater<T>>;
template<class T> using pri_b = priority_queue<T>;
constexpr int inf = 1000000010;
constexpr ll INF = 1000000000000000010;
constexpr int mod1e9 = 1000000007;
constexpr int mod998 = 998244353;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
constexpr ll ten(int n) { return n ? 10 * ten(n - 1) : 1; };
int dx[] = { 1,0,-1,0,1,1,-1,-1 }; int dy[] = { 0,1,0,-1,1,-1,1,-1 };
ll mul(ll a, ll b) { return (a > INF / b ? INF : a * b); }
void fail() { cout << "-1\n"; exit(0); } void no() { cout << "No\n"; exit(0); }
template<class T> void er(T a) { cout << a << '\n'; exit(0); }
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }
template<class T> istream &operator >> (istream &s, vector<T> &v) { for (auto &e : v) s >> e; return s; }
template<class T> ostream &operator << (ostream &s, const vector<T> &v) { for (auto &e : v) s << e << ' '; return s; }
template<class T, class U> ostream &operator << (ostream &s, const pair<T, U> &p) { s << p.first << ' ' << p.second; return s; }
struct fastio {
fastio() {
cin.tie(0); cout.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
cerr << fixed << setprecision(20);
}
}fastio_;
constexpr ll mod = mod1e9;
template <int mod> class modint {
public:
int n;
modint() : n(0) {};
modint(ll n_) {
n = n_ % mod;
if (n < 0) n += mod;
}
modint operator -() const { return n > 0 ? mod - n : -n; }
bool operator == (const modint &m) const { return n == m.n; }
bool operator != (const modint &m) const { return n != m.n; }
modint &operator += (const modint &m) { n += m.n; if (n >= mod) n -= mod; return *this; }
modint &operator -= (const modint &m) { n -= m.n; if (n < 0) n += mod; return *this; }
modint &operator *= (const modint &m) { n = ll(n) * m.n % mod; return *this; }
modint &operator /= (const modint &m) { n = ll(n) * modinv(m).n % mod; return *this; }
modint operator +(modint m) const { return modint(*this) += m; }
modint operator -(modint m) const { return modint(*this) -= m; }
modint operator *(modint m) const { return modint(*this) *= m; }
modint operator /(modint m) const { return modint(*this) /= m; }
modint &operator ++ () { *this += 1; return *this; }
modint operator ++ (int) { *this += 1; return *this - 1; }
modint &operator -- () { *this -= 1; return *this; }
modint operator -- (int) { *this -= 1; return *this + 1; }
modint pow(ll b) const {
modint res = 1, a = modint(*this);
while (b) {
if (b & 1) res *= a;
a *= a;
b >>= 1;
}
return res;
}
friend istream &operator >> (istream &s, modint<mod> &a) { s >> a.n; return s; }
friend ostream &operator << (ostream &s, modint<mod> &a) { s << a.n; return s; }
};
using mint = modint<mod>;
vector<mint> fac, inv, facinv;
mint modinv(mint x) {
ll a = x.n;
if (a == 0) abort();
if (a < (ll)inv.size()) return inv[a];
ll b = mod, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
mint res = u;
return res;
}
void modcalc(int n) {
fac.resize(n); inv.resize(n); facinv.resize(n);
fac[0] = 1; fac[1] = 1; inv[1] = 1;
facinv[0] = 1; facinv[1] = 1;
for (ll i = 2; i < n; i++) {
fac[i] = fac[i - 1] * i;
inv[i] = -inv[mod % i] * (mod / i);
facinv[i] = facinv[i - 1] * inv[i];
}
}
mint comb(ll n, ll k) {
if (n < 0 || k < 0 || n < k) return 0;
return fac[n] * facinv[k] * facinv[n - k];
}
mint perm(ll n, ll k) {
if (n < 0 || k < 0 || n < k) return 0;
return fac[n] * facinv[n - k];
}
mint hom(ll n, ll k) {
if (n < 0 || k < 0 || n == 0 && k > 0) return 0;
if (n == 0 && k == 0) return 1;
return fac[n + k - 1] * facinv[k] * facinv[n - 1];
}
int main() {
ll n;
cin >> n;
string s;
cin >> s;
vector<int> v = { 0,1,1,2,1,2,2,3 };
mint ans = 0;
rep(i, 8) {
if (s[i] == 'o') {
int x = v[i];
int y = 4 - v[i];
ans += mint(4).pow(n);
if (n >= 1) {
ans += mint(2).pow(n - 1) * mint(4).pow(n);
}
if (n >= 2) {
ans += mint(4).pow(n - 2) * y * (y - x) * (mint(2).pow(n - 1) - 1);
ans += mint(4).pow(n - 2) * x * (x - y) * (mint(2).pow(n - 1) - 1);
}
}
}
cout << ans << '\n';
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0