AtCoder Beginner Contest 242

已于 2022-03-22 21:24:51 修改
阅读量518 收藏
点赞数
分类专栏： 比赛题解 容斥原理 文章标签： c++ 算法 数列
于 2022-03-08 06:32:17 首次发布
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/nike0good/article/details/123343922
版权

A - T-shirt

Time Limit: 2 sec / Memory Limit: 1024 MB

Score : 100 points

Problem Statement
In a certain programming contest, T-shirts are awarded to participants according to the following rules.

All participants who ranked A-th or higher get a T-shirt.
Additionally, from the participants who ranked between (A+1)-th and B-th (inclusive), C participants chosen uniformly at random get a T-shirt.
There were 1000 participants in this contest, and all of them got different ranks.
Iroha-chan, who participated in this contest, ranked X-th.
Find the probability that she gets a T-shirt.

Constraints
All values in input are integers.
1≤A<B≤1000
1≤C≤B−A
1≤X≤1000
Input
Input is given from Standard Input in the following format:

A B C X
Output
Print the answer. Your output will be considered correct if the absolute or relative error from the judge’s answer is at most 10^−6
.

#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;
} 
int main()
{
//	freopen("A.in","r",stdin);
//	freopen(".out","w",stdout);
	double a,b,c,x;
	cin>>a>>b>>c>>x;
	if(x<=a) cout<<"1"<<endl;
	else if(a+1<=x&&x<=b) {
		cout<<(double)(c)/(b-a)<<endl;
	}else cout<<0<<endl;
	
	return 0;
}

B - Minimize Ordering

You are given a string S. Find the lexicographically smallest string S’ obtained by permuting the characters of S.

#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;
} 
int main()
{
//	freopen("B.in","r",stdin);
//	freopen(".out","w",stdout);
	char s[212345];
	cin>>(s+1);
	int n=strlen(s+1);
	sort(s+1,s+n+1);
	cout<<(s+1);
	
	
	return 0;
}

C - 1111gal password

Given an integer N N N, find the number of integers X X X that satisfy all of the following conditions, modulo 998244353 998244353 998244353.
X X X is an N N N-digit positive integer.
Let X i X_i Xi​ be the digits of X from top to bottom. They satisfy all of the following:
1 ≤ X i ≤ 9 1\le X_i \le 9 1≤Xi​≤9 for all integers 1 ≤ i ≤ N 1≤i≤N 1≤i≤N
∣ X i − X i + 1 ∣ ≤ 1 ∣X_i −X_{i+1}∣≤1 ∣Xi​−Xi+1​∣≤1 for all integers 1 ≤ i ≤ N − 1 1≤i≤N−1 1≤i≤N−1.

#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 (998244353)
#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;
} 
ll f[1123456][10];
int main()
{
//	freopen("C.in","r",stdin);
//	freopen(".out","w",stdout);
	int n=read();
	For(i,9)f[1][i]=1;
	For(i,n-1) {
		For(j,9) {
			upd(f[i+1][j],f[i][j]);
			if(j<9)upd(f[i+1][j+1],f[i][j]);
			if(j>1)upd(f[i+1][j-1],f[i][j]);
		}
	}
	ll ans=0;
	For(j,9) upd(ans,f[n][j]);cout<<ans<<endl;	
	
	return 0;
}

D - ABC Transform

You are given a string S S S consisting of A , B , C A, B, C A,B,C.

Let S ( 0 ) : = S S(0):=S S(0):=S. For i = 1 , 2 , 3 , … , i=1,2,3,…, i=1,2,3,…, let S ( i ) S(i) S(i) be the result of simultaneously replacing the characters of S ( i − 1 ) S(i−1) S(i−1) as follows: A → B C , B → C A , C → A B A → BC, B → CA, C → AB A→BC,B→CA,C→AB.

Answer Q Q Q queries. The i i i-th query is as follows.

Print the k k k-th character from the beginning of S ( t i ) S(t_i) S(ti​) .

#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 (998244353)
#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;
} 
char s[112345];
int main()
{
//	freopen("D.in","r",stdin);
//	freopen(".out","w",stdout);
	cin>>(s+1);
	int n=strlen(s+1);
	int q=read();
	For(i,q) {
		ll t,k;cin>>t>>k;
		ll p=0;
		while(t>0 && k>1) {
			p=p+1+(k%2==0);
			p%=3ll;
			k=(k+1)/2;
			--t;
		}
		if(t>0) p=(p+t%3)%3;
		char cc=((s[k]-'A')+p)%3+'A';
		cout<<cc<<endl;
	}
	
	
	return 0;
}

E - (∀x∀)

Solve the following problem for T test cases.

Given an integer N and a string S, find the number of strings X that satisfy all of the conditions below, modulo 998244353.

X is a string of length N consisting of uppercase English letters.
X is a palindrome.
X≤S in lexicographical order.
That is, X=S or X is lexicographically smaller than S.

#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 (998244353)
#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;
} 
char s[1123456];
char s2[1123456];
ll p26[1123456];
int main()
{
//	freopen("E.in","r",stdin);
//	freopen(".out","w",stdout);
	p26[0]=1;
	For(i,1e6) p26[i]=p26[i-1]*26ll%F;
	
	int T=read();
	
	while(T--) {
		ll ans=0;
		int n=read();
		cin>>(s+1);		
		int m=(n+1)/2;
		For(i,m) {
			int p=s[i]-'A';
			upd(ans,mul(p,p26[m-i]));
		}
		For(i,m) s2[i]=s[i];
		Fork(i,m+1,n) s2[i]=s2[n-i+1];
		s2[0]=s2[n+1]=0;
//		cout<<(s2+1)<<endl;
//		cout<<(s+1)<<endl;
		if (strcmp(s2+1,s+1)<=0) upd(ans,1);
		cout<<ans<<endl;
	}
	
	
	return 0;
}

F - Black and White Rooks

Time Limit: 2 sec / Memory Limit: 1024 MB

Score : 500 points

Problem Statement
在一个 N ∗ M N*M N∗M的矩阵中放 B B B个黑石子和 W W W个白石子。

要求：
所有石子放在一个格子里
一个格子最多放一个石子。
同行或同列，没有同色石子。

求方案数 modulo 998244353.

同色石子无区别。

Constraints
1≤N,M≤50
1≤B,W≤2500
B+W≤N×M
All values in input are integers.
Input
Input is given from Standard Input in the following format:

N M B W
Output
Print the count modulo 998244353.

Sample Input 1
Copy
2 2 1 1
Sample Output 1
Copy
4

容斥原理：
答案 = ∑ i = 1 n ∑ j = 1 m ∑ k = 1 n − i ∑ l = 1 m − j ( − 1 ) n + m − i − j − k − l ∗ C ( n , i ) C ( n − i , k ) C ( m , j ) C ( m − j , l ) C ( i j , w ) C ( k l , b ) =\sum_{i=1}^n\sum_{j=1}^m\sum_{k=1}^{n-i}\sum_{l=1}^{m-j}(-1)^{n+m-i-j-k-l}*C(n,i)C(n-i,k)C(m,j)C(m-j,l)C(ij,w)C(kl,b) =∑i=1n​∑j=1m​∑k=1n−i​∑l=1m−j​(−1)n+m−i−j−k−l∗C(n,i)C(n−i,k)C(m,j)C(m−j,l)C(ij,w)C(kl,b)

#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 (998244353)
#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 MAXN (101015)
ll inj[MAXN],jie[MAXN];
inline ll C(int a,int b) {
	return (ll)jie[a]*inj[b]%F*inj[a-b]%F;
}
ll p=F;
inline int pow2(int a,ll b)  //a^b mod p 
{  
    if (b==0) return 1%p;  
    int c=pow2(a,b/2);  
    c=(ll)c*c%p;  
    if (b&1) c=(ll)c*a%p;  
    return c;  
}  
void pre(int n) {
	jie[0]=1;For(i,n) jie[i]=mul(jie[i-1],i);
	inj[0]=inj[1]=1;Fork(i,2,n) inj[i]=(F-(F/i))*inj[F%i]%F;
	For(i,n) inj[i]=mul(inj[i],inj[i-1]);  
} 
ll n,m,b,w;
int main()
{
//	freopen("E.in","r",stdin);
//	freopen(".out","w",stdout);
	pre(101010);
	ll ans=0;
	cin>>n>>m>>b>>w;
	For(i,n) For(j,m) For(k,n-i) For(l,m-j) if(k*l>=b &&i*j>=w){
		ll p=mul(C(n,i),C(m,j));
		p=mul(p,C(n-i,k));
		p=mul(p,C(m-j,l));
		p=mul(p,C(k*l,b));
		p=mul(p,C(i*j,w));
		if((n+m-i-j-k-l)%2) p=sub(0,p);
		upd(ans,p);
	}
	cout<<ans<<endl;
	return 0;
}

G - Range Pairing Query

N people numbered 1 , 2 , … , N 1,2,…,N 1,2,…,N are standing in a row. Person i wears Color A i A_i Ai​
Answer Q Q Q queries of the format below.

You are given integers l l l and r r r. Considering only Person l , l + 1 , … , r , l,l+1,…,r, l,l+1,…,r, how many pairs of people wearing the same color can be formed at most?


#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cstring>
#include<cctype>
#include<ctime>
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 Rep(i,n) for(int i=0;i<n;i++)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define MAXN (1123456+10)
#define MAXM MAXN
int n,m,a[MAXN];
int b[MAXN]={0};
long long Ti2=0;
struct commend
{
	int l,r,no;
	commend(){}
	commend(int _l,int _r,int _no):l(_l),r(_r),no(_no){}
	friend bool operator<(commend a,commend b){return int(a.l/sqrt(n))<int(b.l/sqrt(n))||(int(a.l/sqrt(n))==int(b.l/sqrt(n)))&&a.r<b.r;	}
}p1[MAXM],p2[MAXM];
long long ans[MAXN];
long long gcd(long long a,long long b){if (!b) return a;return gcd(b,a%b);}
int main()
{
//	freopen("bzoj2038.in","r",stdin);
//	freopen(".out","w",stdout);
	scanf("%d",&n);
	For(i,n) scanf("%d",&a[i]);
	scanf("%d",&m);
	For(i,m) scanf("%d%d",&p1[i].l,&p1[i].r),p1[i].no=i;
	memcpy(p2,p1,sizeof(p1));
	sort(p2+1,p2+1+m);p2[0].l=1,p2[0].r=0;
	For(i,m)
	{
		if (p2[i-1].l<p2[i].l) Fork(j,p2[i-1].l,p2[i].l-1) Ti2-=(long long)b[a[j]]/2,b[a[j]]--,Ti2+=(long long)b[a[j]]/2;
		if (p2[i].l<p2[i-1].l) Fork(j,p2[i].l,p2[i-1].l-1) Ti2-=(long long)b[a[j]]/2,b[a[j]]++,Ti2+=(long long)b[a[j]]/2;
		if (p2[i-1].r<p2[i].r) Fork(j,p2[i-1].r+1,p2[i].r) Ti2-=(long long)b[a[j]]/2,b[a[j]]++,Ti2+=(long long)b[a[j]]/2;
		if (p2[i].r<p2[i-1].r) Fork(j,p2[i].r+1,p2[i-1].r) Ti2-=(long long)b[a[j]]/2,b[a[j]]--,Ti2+=(long long)b[a[j]]/2;
		ans[p2[i].no]=Ti2;
	}
	For(i,m)
		cout<<ans[i]<<endl;
	return 0;
}
nike0good
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
AtCoder Beginner Contest 241
Z_Y_S_的博客
02-27 525
Ex - Card Deck Score 这题还比较有意思，设Fi(x)=∑j=0BjAjxj=1−AjBi+1xBi+11−AjxF_{i}(x)=\sum_{j=0}^{B_j}A_jx^j=\frac{1-A_j^{B_i+1}x^{B_{i+1}}}{1-A_jx}Fi​(x)=∑j=0Bj​​Aj​xj=1−Aj​x1−AjBi​+1​xBi+1​​，答案显然就是[xm]∏i=1nFi(x)=[xm]1∏i=1n(1−Ajx)∏i=1n(1−AjBi+1xBi+1)[x^m]\prod_{i=1}
AtCoder Beginner Contest 224
Code_Shark的博客
10-29 174
A. 简单判断 题意：给定一个字符串，判断是以 ererer 结尾还是以 ististist 结尾 判断最后一个字母是 rrr 还是 ttt 即可 #include<bits/stdc++.h> using namespace std; string s; int main(void) { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> s; if (s.back() == 'r') cout &l
AtCoder Beginner Contest 242(C-E, G)
m0_53430148的博客
03-06 473
C - 1111gal password (DP) 题意：找到长度为n的且满足相邻位之差的绝对值不超过1的方案数 思路：f[i][j]表示前i个位且第i位填j满足要求的方案数, 第i位填j，那么第i-1位肯定就只能填(j-1, j, j + 1)这三个数,因此可以得到转移方程: f[i][j] = f[i-1][j-1] + f[i-1][j] + f[i-1][j+1];时间复杂度是O(10*N) 代码: #include <bits/stdc++.h> using namespac
AtCoder Beginner Contest 042解析（日文原版）
01-20
AtCoder Beginner Contest 042 解析（日文原版） 本资源摘要信息将对 AtCoder Beginner Contest 042 解析（日文原版）进行详细的知识点解析。 Overall Editorial 官方编辑=adminA - 和風いろはちゃんイージー /...
题解：AtCoder Beginner Contest 265C - Belt Conveyor (atcoder.jp)
最新发布
06-18
这篇题解是关于AtCoder Beginner Contest 265C题目——"Belt Conveyor"的解决方案。这是一道入门级别的算法问题，主要考察的是模拟和边界条件处理能力。在这个问题中，你需要模拟一个传送带系统，并根据给定的网格...
atcoder beginner contest #237 c- kasaka
02-06
这个是abc#237 c题的答案cpp，转载请加上版权。
Atcoder Beginner Contest 113A题
11-04
#include using namespace std; int main(){ int x,y; cin>>x>>y; cout(y/2); return 0; }
AtCoder Beginner Contest 263D - Left Right Operation
06-16
代码
AtCoder Beginner Contest 242 补题记录
bunny_1024的博客
03-06 409
D - ABC Transform 解法：首先第0层是给定的字符串，然后，第t层可以看做是t个t层的完全二叉树，这样的话，最后一层的最大编号数为n*2^t，最大达到了1e5 * 2^(1e18)，一个巨大的数字。但是显然给定的k范围没有这么大，所以要从k下手。 首先如果考虑朴素做法，从树底部往上一步一步走，是O(t)解法，过不了，但是可以通过k来剪枝，当t比较大的时候，k每次找父亲的时候会变成(k+1)/2，最多64次左右变成1，也就是第一个二叉树的最左边一列，容易发现最左边一列是有规律的，假如最左边字
AtCoder Beginner Contest 241「D multiset」「E 环 + 细节」「F bfs + 思维」
Suryxin's blogs
02-28 780
AtCoder Beginner Contest 241 D - Sequence Query 题目描述： 开始有一个空序列，三种操作： 1 x， 表示将x插入序列中 2 x k，表示询问序列中小于等于x的数中第k大的数是什么 3 x k，表示询问序列中大于等于x的数中第k小的数是什么 k小于等于5 思路： 我们可以使用multiset，通过二分来查找，然后暴力计算k即可 对于操作2，找的是<=x的数，lower_bound是找的是大于等于x的所有的数，upper_bound是找的大于x的所
AtCoder Beginner Contest 241EX(推式子)
m0_53688600的博客
11-03 292
abc241EX
AtCoder Beginner Contest 242(A-E)
RIPKEY的博客
03-06 432
A - T-shirt 题意： 输入四个整数a,b,c,x，已知自己的排名为x，当你排名在a之前一定会获得奖励，在a+1到b名之间有c/(b+1-a）的概率会获得奖励 思路： 看图说话 #include<bits/stdc++.h> using namespace std; int main() { int a,b,c,x; cin>>a>>b>>c>>x; if(x<=a){ cout
ABC242_c 1111gal password
NEFU AB-IN's Blog
03-06 561
ABC242_c 1111gal password
「Atcoder」abc242 题解
CodeTty的博客
03-09 783
A - T-shirt Code void solve() { int a, b, c, x; cin >> a >> b >> c >> x; if(x <= a) printf("%.12lf\n", 1.0); else if(x <= b) { double res=c; res /= (b-a); printf("%.12lf\n",res);
UVA 10209(Is This Integration ?-容斥原理)
nike0good |Oier&ACMer | 熟能生巧
02-14 2316
Problem C Is This Integration ? Input: Standard Input Output: Standard Output Time Limit: 3 seconds   In the image below you can see a square ABCD, where AB = BC = CD = DA = a. Four arcs are
atcoder beginner contest 242
03-16
atcoder beginner contest 242 是一个由 AtCoder 组织的初级比赛，旨在为初学者提供一个锻炼和展示自己编程能力的平台。比赛通常包括多个问题，每个问题都有不同的难度级别和分值。参赛者需要在规定的时间内完成尽可能多的问题，并获得尽可能高的分数。该比赛受到了全球范围内程序员的广泛关注和参与。
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值