Tokio Marine & Nichido Fire Insurance Programming Contest 2021（AtCoder Regular Contest 122) 题解(代

Posted 2021-06-27 nike0good

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了Tokio Marine & Nichido Fire Insurance Programming Contest 2021（AtCoder Regular Contest 122) 题解(代相关的知识，希望对你有一定的参考价值。

A Many Formulae

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \\
						For(j,m-1) cout<<a[i][j]<<' ';\\
						cout<<a[i][m]<<endl; \\
						} 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
	int x=0,f=1; char ch=getchar();
	while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
	while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
	return x*f;
} 
#define MXAN (112345)
int n;
ll dp[112233];
int main()
{
//	freopen("A.in","r",stdin);
//	freopen(".out","w",stdout);
	
	dp[0]=1;
    dp[1]=2;
    Fork(i,2,1e5+10)
        dp[i]=(dp[i-1]+dp[i-2])%F;
    n=read();
    ll ans=0;
    For(i,n) {
    	int x=read();
    	if(i==1) upd(ans,dp[n-1]*x%F);
    	else {
    		upd(ans,sub(mul(dp[max(0,i-2)],dp[n-i]),dp[max(0,i-3)]*dp[max(0,n-i-1)])*x%F);
		}
	}
	cout<<ans<<endl;
	
	return 0;
}

B Insurance

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \\
						For(j,m-1) cout<<a[i][j]<<' ';\\
						cout<<a[i][m]<<endl; \\
						} 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
	int x=0,f=1; char ch=getchar();
	while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
	while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
	return x*f;
} 
#define MXAN (112345)
int n;
ll a[112233];
double ck(double x) {
    double p=0;
    For(i,n)
        p+=x+a[i]-min(a[i]*1.,2*x);
    return p;
}
int main()
{
//	freopen("A.in","r",stdin);
//	freopen(".out","w",stdout);
	
    n=read();
    For(i,n) a[i]=read();
    double l=0,r=3e9,ans;
    Rep(i,404) {
    	double m=(l+r)/2;
		double l1=l+(r-l)/3,r1=r-(r-l)/3;
		if(ck(l1)>ck(r1)) l=l1;else r=r1;			
	}
    printf("%.20lf\\n",ck((l+r)/2)/n);
	return 0;
}

C Calculator

交替进行3，4操作可以构造Fib数列，
如果在其中插入1个1或2操作，得到的会是 $Fib_x+Fib_1$ ,继续进行得到 $Fib_{x+k}+Fib_{k-1}$

以上是关于Tokio Marine & Nichido Fire Insurance Programming Contest 2021（AtCoder Regular Contest 122) 题解(代的主要内容，如果未能解决你的问题，请参考以下文章

Tokio Marine & Nichido Fire Insurance Programming Contest 2021（AtCoder Regular Contest 122) 题解(代

Aveva Marine C# 二次开发入门001