Codeforces Round #604 (Div. 2)

 

 

D：

贪心：优先010101，再212121再232323.（最左边的数必须先用完，用完后次左边的数变成最左边的数也要先用完）

双端队列两头加，模拟了所有情况

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128 LL;
//typedef unsigned long long ull;
//#define F first
//#define S second
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
const ld PI=acos(-1);
const ld eps=1e-9;
//unordered_map<int,int>mp;
#define ls (o<<1)
#define rs (o<<1|1)
#define pb push_back
//#define a(i,j) a[(i)*(m+2)+(j)]  //m是矩阵的列数
//pop_back()
const int seed=131;
const int M = 4e5+7;
/*
int head[M],cnt;
void init(){cnt=0,memset(head,0,sizeof(head));}
struct EDGE{int to,nxt,val;}ee[M*2];
void add(int x,int y,int z){ee[++cnt].nxt=head[x],ee[cnt].to=y,ee[cnt].val=z,head[x]=cnt;}
*/
int a[5];
deque<int>v;
int main()
{
	ios::sync_with_stdio(false);
  	cin.tie(0);
  	int sum=0;
	for(int i=0;i<=3;i++)cin>>a[i],sum+=a[i];
	int l=1e5+1,r=1e5;
	for(int j=1;j<=sum;j++)
	{
	//	cout<<l<<" "<<r<<endl;
		for(int i=0;i<=3;i++)
		{
			if(a[i]<=0)continue;
			if(v.empty()||abs(i-v.back())==1)
			{
				v.push_back(i),a[i]--;
				break;
			}
			if(v.empty()||abs(i-v.front())==1)
			{
				v.push_front(i),a[i]--;
				break;
			}
			
		}
 
	}
	if(v.size()<sum)cout<<"NO"<<endl;
	else {
		cout<<"YES"<<endl;
		for(auto x:v)
		cout<<x<<" ";
	}
	return 0;
}

 

E:

概率DP：

f[i]:到第i个镜子的期望步数

 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128 LL;
//typedef unsigned long long ull;
//#define F first
//#define S second
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
const ld PI=acos(-1);
const ld eps=1e-9;
//unordered_map<int,int>mp;
#define ls (o<<1)
#define rs (o<<1|1)
#define pb push_back
//#define a(i,j) a[(i)*(m+2)+(j)]  //m是矩阵的列数
//pop_back()
const int seed=131;
const int M = 2e5+7;
const int mod =998244353  ;
/*
int head[M],cnt;
void init(){cnt=0,memset(head,0,sizeof(head));}
struct EDGE{int to,nxt,val;}ee[M*2];
void add(int x,int y,int z){ee[++cnt].nxt=head[x],ee[cnt].to=y,ee[cnt].val=z,head[x]=cnt;}
*/

int  f[M];

ll qpow(ll a,ll b)
{
	ll ans=1;
	while(b)
	{
		if(b&1)ans=ans*a%mod;
		a=a*a%mod;
		b/=2;
	}
	return ans%mod;
}
ll p[M];
int main()
{
	ios::sync_with_stdio(false);
  	cin.tie(0);
  	int n;
  	cin>>n;
  	for(int i=1;i<=n;i++)
  		cin>>p[i];
	//(fi+1)*pi+(fi+1+f(i+1)*(1-pi)=f(i+1)  => fi+1=(fi + 1)/pi;
	ll ans=0;
	for(int i=1;i<=n;i++)
	ans=((ans+1)*100%mod)*qpow(p[i],mod-2)%mod;
	cout<<ans<<endl;
	return 0;
}

f[i]:第i个镜子到结束还需要的期望步数。

 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128 LL;
//typedef unsigned long long ull;
//#define F first
//#define S second
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
const ld PI=acos(-1);
const ld eps=1e-9;
//unordered_map<int,int>mp;
#define ls (o<<1)
#define rs (o<<1|1)
#define pb push_back
//#define a(i,j) a[(i)*(m+2)+(j)]  //m是矩阵的列数
//pop_back()
const int seed=131;
const int M = 1e5+7;
const int mod =998244353  ;
/*
int head[M],cnt;
void init(){cnt=0,memset(head,0,sizeof(head));}
struct EDGE{int to,nxt,val;}ee[M*2];
void add(int x,int y,int z){ee[++cnt].nxt=head[x],ee[cnt].to=y,ee[cnt].val=z,head[x]=cnt;}
*/

int  f[110];

ll qpow(ll a,ll b)
{
	ll ans=1;
	while(b)
	{
		if(b&1)ans=ans*a%mod;
		a=a*a%mod;
		b/=2;
	}
	return ans%mod;
}
ll p[110];
int main()
{
	ios::sync_with_stdio(false);
  	cin.tie(0);
  	int n;
  	cin>>n;
  	for(int i=1;i<=n;i++)
  		cin>>p[i];
		  //p[i]/=100.0;
  	ll nx=100,ny=(100-p[n]),d=100;
  	for(int i=n-1;i>=1;i--)
  	{
  	//	cout<<nx<<"  "<<ny<<endl;
		
  		nx=(d*100+p[i]*nx)%mod;
  		ny=(d*(100-p[i])+p[i]*ny)%mod;
  //		cout<<nx<<"  "<<ny<<endl;
  		d=d*100%mod;
	}
//	cout<<nx<<"  "<<ny<<endl;
//	printf("%lld\n",nx/(d-ny));
	printf("%lld\n",nx*qpow((d-ny)%mod,mod-2)%mod);
	return 0;
}