結果
| 問題 | No.1253 雀見椪 |
| ユーザー |
 hamamu
|
| 提出日時 | 2020-10-09 22:12:29 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 48 ms / 2,000 ms |
| コード長 | 4,995 bytes |
| コンパイル時間 | 1,777 ms |
| コンパイル使用メモリ | 202,260 KB |
| 実行使用メモリ | 4,380 KB |
| 最終ジャッジ日時 | 2023-09-27 17:39:05 |
| 合計ジャッジ時間 | 3,220 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge15 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
4,380 KB |
| testcase_01 | AC | 1 ms
4,376 KB |
| testcase_02 | AC | 1 ms
4,380 KB |
| testcase_03 | AC | 5 ms
4,376 KB |
| testcase_04 | AC | 45 ms
4,376 KB |
| testcase_05 | AC | 46 ms
4,376 KB |
| testcase_06 | AC | 45 ms
4,376 KB |
| testcase_07 | AC | 47 ms
4,376 KB |
| testcase_08 | AC | 47 ms
4,376 KB |
| testcase_09 | AC | 46 ms
4,380 KB |
| testcase_10 | AC | 47 ms
4,376 KB |
| testcase_11 | AC | 48 ms
4,380 KB |
| testcase_12 | AC | 47 ms
4,376 KB |
| testcase_13 | AC | 46 ms
4,376 KB |
| testcase_14 | AC | 2 ms
4,376 KB |
ソースコード
#include "bits/stdc++.h"
using namespace std;
using ll=long long;
using vll=vector< ll>;
using vvll=vector< vll>;
using vvvll=vector< vvll>;
using vvvvll=vector<vvvll>;
using dd=double;
using vdd=vector< dd>;
using vvdd=vector< vdd>;
using pll=pair<ll,ll>; using tll=tuple<ll,ll,ll>; using qll=tuple<ll,ll,ll,ll>;
constexpr ll INF = 1LL << 60;
struct Fast{ Fast(){ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(numeric_limits<double>::max_digits10); } } fast;
#define REPS(i, S, E) for (ll i = (S); i <= (E); i++)
#define REP(i, N) REPS(i, 0, (N)-1)
#define DEPS(i, S, E) for (ll i = (E); i >= (S); i--)
#define DEP(i, N) DEPS(i, 0, (N)-1)
#define rep(i, S, E) for (ll i = (S); i <= (E); i++)
#define dep(i, E, S) for (ll i = (E); i >= (S); i--)
#define each(e, v) for (auto&& e : v)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
template<class T> inline T MaxE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmax(m,v[i]); return m; }
template<class T> inline T MinE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmin(m,v[i]); return m; }
template<class T> inline T MaxE(vector<T> &v) { return MaxE(v,0,(ll)v.size()-1); }
template<class T> inline T MinE(vector<T> &v) { return MinE(v,0,(ll)v.size()-1); }
template<class T> inline T Sum(vector<T> &v,ll S,ll E){ T s=T(); rep(i,S,E)s+=v[i]; return s; }
template<class T> inline T Sum(vector<T> &v) { return Sum(v,0,v.size()-1); }
template<class T> inline ll sz(T &v){ return (ll)v.size(); }
inline ll CEIL(ll a,ll b){ return (a<0) ? -(-a/b) : (a+b-1)/b; }
inline ll FLOOR(ll a,ll b){ return -CEIL(-a,b); }
template<ll MOD> struct mll_{
ll val;
mll_(ll v = 0): val(v % MOD){ if (val < 0) val += MOD; }
mll_ operator - () const { return -val; }
mll_ operator + (const mll_ &b) const { return val + b.val; }
mll_ operator - (const mll_ &b) const { return val - b.val; }
mll_ operator * (const mll_ &b) const { return val * b.val; }
mll_ operator / (const mll_ &b) const { return mll_(*this) /= b; }
mll_ operator + (ll b) const { return *this + mll_(b); }
mll_ operator - (ll b) const { return *this - mll_(b); }
mll_ operator * (ll b) const { return *this * mll_(b); }
friend mll_ operator + (ll a,const mll_ &b) { return b + a; }
friend mll_ operator - (ll a,const mll_ &b) { return -b + a; }
friend mll_ operator * (ll a,const mll_ &b) { return b * a; }
friend mll_ operator / (ll a,const mll_ &b) { return mll_(a)/b; }
mll_ &operator += (const mll_ &b) { val=(val+b.val)%MOD; return *this; }
mll_ &operator -= (const mll_ &b) { val=(val+MOD-b.val)%MOD; return *this; }
mll_ &operator *= (const mll_ &b) { val=(val*b.val)%MOD; return *this; }
mll_ &operator /= (const mll_ &b) {
ll c=b.val,d=MOD,u=1,v=0;
while (d){
ll t = c / d;
c -= t * d; swap(c,d);
u -= t * v; swap(u,v);
}
val = val * u % MOD;
if (val < 0) val += MOD;
return *this;
}
mll_ &operator += (ll b) { return *this += mll_(b); }
mll_ &operator -= (ll b) { return *this -= mll_(b); }
mll_ &operator *= (ll b) { return *this *= mll_(b); }
mll_ &operator /= (ll b) { return *this /= mll_(b); }
bool operator == (const mll_ &b) const { return val == b.val; }
bool operator != (const mll_ &b) const { return val != b.val; }
bool operator == (ll b) const { return *this == mll_(b); }
bool operator != (ll b) const { return *this != mll_(b); }
friend bool operator == (ll a,const mll_ &b) { return mll_(a) == b.val; }
friend bool operator != (ll a,const mll_ &b) { return mll_(a) != b.val; }
friend ostream &operator << (ostream &os,const mll_ &a) { return os << a.val; }
friend istream &operator >> (istream &is,mll_ &a) { return is >> a.val; }
static mll_ Combination(ll a,ll b){
chmin(b,a-b);
if (b<0) return mll_(0);
mll_ c = 1;
rep(i,0,b-1) c *= a-i;
rep(i,0,b-1) c /= i+1;
return c;
}
};
using mll = mll_<1000000007LL>;
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;
template<class T> inline T POW(T a,ll n){ T r=1; for (; n>0; n>>=1,a*=a){ if (n&1)r*=a; } return r; }
inline ll POW(int a,ll n){ return POW((ll)a,n); }
#if 0
#include <atcoder/all>
using namespace atcoder;
#endif
void solve()
{
ll n; cin >> n;
mll ag,bg; cin >> ag >> bg;
mll ac,bc; cin >> ac >> bc;
mll ap,bp; cin >> ap >> bp;
mll g=ag/bg;
mll c=ac/bc;
mll p=ap/bp;
mll x=POW(1-c,n)-POW(p,n)-POW(g,n);
mll y=POW(1-g,n)-POW(c,n)-POW(p,n);
mll z=POW(1-p,n)-POW(g,n)-POW(c,n);
mll ans=1-x-y-z;
cout << ans << '\n';
}
int main(){
#if 0
solve();
#else
ll t; cin >> t;
rep(i, 0, t-1){
solve();
}
#endif
return 0;
}