AISing Programming Contest 2021（AtCoder Beginner Contest 202）ABCDE

AISing Programming Contest 2021（AtCoder Beginner Contest 202）

A Three Dice

#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
//#define int long long
//#define double long double
#define re register int
#define void inline void
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define pi acos(-1.0)
#define pb push_back
#define P pair < int , int > 
using namespace std;
//const int mod=1e9+7;
const int M=5e6;
const int N=2*1e5+5;//?????????? 4e8
int a,b,c;
void solve()
{
	cin>>a>>b>>c;
	a=7-a;
	b=7-b;
	c=7-c;
	cout<<a+b+c;
}
signed main()
{
    int T=1;
//    cin>>T;
    for(int index=1;index<=T;index++)
    {
        solve();
//        puts("");
    }
    return 0;
}
/*

#((((#

*/ 

B 180°

#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
//#define int long long
//#define double long double
#define re register int
#define void inline void
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define pi acos(-1.0)
#define pb push_back
#define P pair < int , int > 
using namespace std;
//const int mod=1e9+7;
const int M=5e6;
const int N=2*1e5+5;//?????????? 4e8
char s[N];
char change(char c)
{
	if(c=='0'||c=='1'||c=='8')  return c;
	if(c=='6')  return '9';
	if(c=='9')  return '6';
}
void solve()
{
	scanf("%s",s+1);
	int sz=strlen(s+1);
	for(re i=sz;i>=1;i--)  cout<<change(s[i]);
}
signed main()
{
    int T=1;
//    cin>>T;
    for(int index=1;index<=T;index++)
    {
        solve();
//        puts("");
    }
    return 0;
}
/*

#((((#

*/ 

C Made Up

#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
#define int long long
//#define double long double
#define re register int
#define void inline void
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define pi acos(-1.0)
#define pb push_back
#define P pair < int , int > 
using namespace std;
//const int mod=1e9+7;
const int M=5e6;
const int N=2*1e5+5;//?????????? 4e8
int n;
int a[N],b[N],c[N];
int ans;
map < int , int > mp;
void solve()
{
	cin>>n;
	for(re i=1;i<=n;i++)  scanf("%lld",&a[i]);
	for(re i=1;i<=n;i++)  scanf("%lld",&b[i]);
	for(re i=1;i<=n;i++)  scanf("%lld",&c[i]);
	for(re i=1;i<=n;i++)  mp[b[c[i]]]++;
	for(re i=1;i<=n;i++)  ans+=mp[a[i]];
	cout<<ans<<endl;
}
signed main()
{
    int T=1;
//    cin>>T;
    for(int index=1;index<=T;index++)
    {
        solve();
//        puts("");
    }
    return 0;
}
/*

#((((#

*/ 

D aab aba baa

首先打一张，组合的表，然后优先考虑a的情况

#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
#define int long long
//#define double long double
#define re register int
#define void inline void
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define pi acos(-1.0)
#define pb push_back
#define P pair < int , int > 
using namespace std;
//const int mod=1e9+7;
const int M=5e6;
const int N=2*1e5+5;//?????????? 4e8
int a,b,k,l=1;
int f[105][105];
void solve()
{
	cin>>a>>b>>k;
	f[0][0]=1;
	for(re i=1;i<=a+b;i++)  for(re j=0;j<=i;j++)  if(j)  f[i][j]=f[i-1][j]+f[i-1][j-1];
	else  f[i][j]=f[i-1][j];
	a+=b;
	while(a--)
	{
		int x=f[a][b];
		if(k<l+x)  printf("a");
		else  printf("b"),b--,l+=x;
	}
}
signed main()
{
    int T=1;
//    cin>>T;
    for(int index=1;index<=T;index++)
    {
        solve();
//        puts("");
    }
    return 0;
}
/*

#((((#

*/ 

E Count Descendants

好吧，没想到这么好的办法。
首先记录DFS前驱的数量，并且记录该深度下的DFS前驱的数量，在回溯的时候记录DFS序，两者的差便是子树大小。
因为该题求的是进过u到子树且深度为d+1的节点数，因此直接二分，求得递归回溯时的l,r，两者下标的差就是所求节点个数。

#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
//#define int long long
//#define double long double
#define re register int
#define void inline void
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define pi acos(-1.0)
#define pb push_back
#define P pair < int , int > 
using namespace std;
//const int mod=1e9+7;
const int M=5e6;
const int N=2*1e5+5;//?????????? 4e8
int n,m;
vector < int > p[N],d[N],v;
int l[N],r[N];
void dfs(int x,int dep)
{
	l[x]=v.size();
	v.pb(x);
	d[dep].pb(l[x]);
	int sz=p[x].size();
	for(re i=0;i<sz;i++)
	{
		int y=p[x][i];
		dfs(y,dep+1);
	}
	r[x]=v.size();
}
void solve()
{
	cin>>n;
	for(re i=2;i<=n;i++)
	{
		int x;
		scanf("%d",&x);
		p[x].pb(i);
	}
	dfs(1,1);
	cin>>m;
	while(m--)
	{
		int u,dd;
		scanf("%d%d",&u,&dd);dd++;
		int ll=l[u],rr=r[u];
		cout<<lower_bound(d[dd].begin(),d[dd].end(),rr)-lower_bound(d[dd].begin(),d[dd].end(),ll)<<endl;
	}
}
signed main()
{
    int T=1;
//    cin>>T;
    for(int index=1;index<=T;index++)
    {
        solve();
//        puts("");
    }
    return 0;
}
/*

#((((#

*/