#254048 (C++11) No.681 Fractal Gravity Glue

提出ソース

結果

問題	No.681 Fractal Gravity Glue
ユーザー	n_vip
提出日時	2018-04-27 23:21:55
言語	C++11 (gcc 11.4.0)
結果	AC
実行時間	11 ms / 2,000 ms
コード長	6,886 bytes
コンパイル時間	1,122 ms
コンパイル使用メモリ	105,016 KB
実行使用メモリ	5,828 KB
最終ジャッジ日時	2023-09-10 06:49:17
合計ジャッジ時間	2,709 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	11 ms 5,756 KB
testcase_01	AC	11 ms 5,744 KB
testcase_02	AC	11 ms 5,316 KB
testcase_03	AC	11 ms 5,244 KB
testcase_04	AC	11 ms 5,296 KB
testcase_05	AC	11 ms 5,192 KB
testcase_06	AC	11 ms 5,188 KB
testcase_07	AC	11 ms 5,208 KB
testcase_08	AC	11 ms 5,196 KB
testcase_09	AC	11 ms 5,252 KB
testcase_10	AC	11 ms 5,744 KB
testcase_11	AC	11 ms 5,300 KB
testcase_12	AC	11 ms 5,752 KB
testcase_13	AC	11 ms 5,200 KB
testcase_14	AC	11 ms 5,756 KB
testcase_15	AC	11 ms 5,748 KB
testcase_16	AC	11 ms 5,192 KB
testcase_17	AC	11 ms 5,796 KB
testcase_18	AC	11 ms 5,360 KB
testcase_19	AC	11 ms 5,828 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T,size_t n> ostream& operator<<(ostream &os, const array<T,n> &t) {
	os<<"{"; rep(i,n) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T,class U> ostream& operator<<(ostream &os, const tuple<S,T,U> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class S, class T,class U,class V> ostream& operator<<(ostream &os, const tuple<S,T,U,V> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
#else
#define out
#endif
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
const ll MOD=1e9+7;

ll modpow(ll r,ll n,ll m=MOD){
  ll re=1,d=r%m;
  if(n<0)(n%=m-1)+=m-1;
  for(;n;n/=2){
    if(n&1)(re*=d)%=m;
    (d*=d)%=m;
  }
  return re;
}
template <int mod=MOD> struct modInt{
  int v;
  modInt(int v=0):v(v){}
  modInt operator+(const modInt &n)const{return v+n.v<mod ? v+n.v : v+n.v-mod;}
  modInt operator-(const modInt &n)const{return v-n.v<0 ? v-n.v+mod : v-n.v;}
  modInt operator*(const modInt &n)const{return ll(v)*n.v%mod;}
  modInt operator/(const modInt &n)const{return ll(v)*modpow(n.v%mod,-1,mod)%mod;}
  modInt operator+(const ll &n)const{return v+n<mod ? v+n : v+n-mod;}
  modInt operator-(const ll &n)const{return v-n<0 ? v-n+mod : v-n;}
  modInt operator*(const ll &n)const{return ll(v)*(n%mod)%mod;}
  modInt operator/(const ll &n)const{return ll(v)*modpow(n%mod,-1,mod)%mod;}
  modInt& operator+=(const modInt &n){v+=n.v; if(v>=mod) v-=mod; return *this;}
  modInt& operator-=(const modInt &n){v-=n.v; if(v<0) v+=mod; return *this;}
  modInt& operator*=(const modInt &n){v=ll(v)*n.v%mod; return *this;}
  modInt& operator/=(const modInt &n){v=ll(v)*modpow(n.v,-1,mod)%mod; return *this;}
  modInt& operator+=(const ll &n){v+=n; if(v>=mod) v-=mod; return *this;}
  modInt& operator-=(const ll &n){v-=n; if(v<0) v+=mod; return *this;}
  modInt& operator*=(const ll &n){v=ll(v)*n%mod; return *this;}
  modInt& operator/=(const ll &n){v=ll(v)*modpow(n,-1,mod)%mod; return *this;}
};
template<int mod> ostream& operator<<(ostream &os,const modInt<mod> &n){return os<<n.v;};
template<int mod> modInt<mod> operator+(const ll &n,const modInt<mod> &m){return m.v+n<mod ? m.v+n : m.v+n-mod;}
template<int mod> modInt<mod> operator-(const ll &n,const modInt<mod> &m){return n-m.v<0 ? n-m.v+mod : n-m.v;}
template<int mod> modInt<mod> operator*(const ll &n,const modInt<mod> &m){return ll(m.v)*(n%mod)%mod;}
template<int mod> modInt<mod> operator/(const ll &n,const modInt<mod> &m){return ll(m.v)*modpow(n%mod,-1,mod)%mod;}
typedef modInt<MOD> mint;
template <int mod> modInt<mod> modpow(modInt<mod> r,ll n){ modInt<mod> re(1); if(n<0)(n%=mod-1)+=mod-1; for(;n;n/=2){if(n&1) re*=r; r*=r;} return re;}
vector<mint> fact,finv,inv;
mint comb(ll n,ll r){ if(n<r||r<0)return 0; return fact[n]*finv[n-r]*finv[r];}
class Doralion{
  void Modinvs(vector<mint> &re,int n){ re.resize(n+1); re[1]=1; for(int i=2;i<=n;++i)re[i]=re[MOD%i]*(MOD-MOD/i);}
  void Facts(vector<mint> &re,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*(i+1);}
  void Factinvs(vector<mint> &re,const vector<mint> &inv,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*inv[i+1];}
public:
  Doralion(int n){ Modinvs(inv,n); Facts(fact,n); Factinvs(finv,inv,n);}
} doralion(212345);

mint sumxi(ll x,ll n){
	if(x==1) return n%MOD;
	mint xx=x%MOD;
	mint re=1-modpow(xx,n);
	re/=1-xx;
	return re;
};

mint sumixi(ll x,ll n){
	if(x==1) return n*(n-1)/2%MOD;
	mint xx=x%MOD;
	mint re=1-modpow(xx,n);
	re/=1-xx;
	re-=mint(n%MOD)*modpow(xx,n);
	re/=1-xx;
	return re-sumxi(x,n);
}

mint sumG(ll n,ll d){
	mint re=n%MOD;
	//out(re,n,d,sumxi(d+1,n),sumixi(d+1,n),1);
	re*=sumxi(d+1,n);
	re-=sumixi(d+1,n);
	return d%MOD*re;
}

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  reps(d,1,4)reps(n,1,10){
		mint ans=0;
		rep(i,n) ans+=mint(i)*modpow(mint(d),i);
		mint op=sumixi(d,n);
		if(ans.v!=op.v) out(d,n,ans,op,1);
	}
  reps(d,1,4){
		vector<mint> ans(10);
		ans[0]=0;
		reps(n,1,10){
			ans[n]=mint(d%MOD)*n+mint(d+1)*ans[n-1];
			mint op=sumG(n,d);
			if(ans[n].v!=op.v) out(d,n,ans[n],op,1);
		}
	}
	ll n,b,d;
	cin>>n>>b>>d;
	ll INF=n+1;
	vector<ll> dp(100);
	reps(i,1,100){
		dp[i]=d+(d+1)*dp[i-1];
		if(MN(dp[i],INF)){
			dp.resize(i+1);
			break;
		}
	}
	out(dp,1);
	mint re=sumG(b,d);
	rreps(i,1,(int)dp.size()){
		if(n==dp[i]){
			re+=sumG(i,d); n-=dp[i];
		}
		ll t=n/(dp[i-1]+1);
		out(t,sumG(i-1,d),i,1);
		re-=(sumG(i-1,d)+i)*t;
		n%=(dp[i-1]+1);
		if(n==dp[i-1]){
			re-=sumG(i-1,d);
			n-=dp[i-1];
		}
		out(n,re,i,1);
	}
	cout<<re<<endl;
  return 0;
}

yukicoder

結果

テストケース

ソースコード