Codeforces Global Round 23题解

A. Maxmina

思路：  只要有1就能做到，保留一个1，其他位置全部按规则一合并，最后用规则二让最后k个数变为1。

#include <bits/stdc++.h>//#include<iostream>//#include<string.h>//#include<math.h//#include<algorithm>
#define ll long long
#define db double
#define pii pair<int,int>
#define cf int _;cin>>_;while(_--)
#define de cout<<"---"<<endl;
#define mem(x,v) memset(x,v,sizeof(x))
#define L(x) x&(-x)
#define pb push_back//emplace_back//priority_queue <int,vector<int>,greater<int> > q;
#define INF 0x3f3f3f3f
#define endl '\n'
//function<void(int)> dfs = [&](int u);
//#define x first
//#define y second
using namespace std;
const int mod=998244353;
int n,k;
int a[55];
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
void solve(){
	cin>>n>>k;
	for(int i=1;i<=n;i++)cin>>a[i];
	bool ok=0;
	for(int i=1;i<=n;i++){
		if(a[i]){
			ok=1;
		}
	}
	if(ok)cout<<"YES";
	else cout<<"NO";
	cout<<endl;
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
	cf{
		solve();
	}
}

B. Rebellion

思路：贪心把前面的1全部加到最后的0直到1的后面没有0，这样操作步数最少。

#include <bits/stdc++.h>//#include<iostream>//#include<string.h>//#include<math.h//#include<algorithm>
#define ll long long
#define db double
#define pii pair<int,int>
#define cf int _;cin>>_;while(_--)
#define de cout<<"---"<<endl;
#define mem(x,v) memset(x,v,sizeof(x))
#define L(x) x&(-x)
#define pb push_back//emplace_back//priority_queue <int,vector<int>,greater<int> > q;
#define INF 0x3f3f3f3f
#define endl '\n'
//function<void(int)> dfs = [&](int u);
//#define x first
//#define y second
using namespace std;
const int mod=998244353,N=1e5+10;
int n,k;
int a[N];
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
void solve(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	int res=0;
	for(int i=1;i<=n;i++){
		 if(a[i])res++;
	}
	int ans=0;
	for(int i=n;i>n-res;i--){
		if(!a[i])ans++;
	}
	cout<<ans;
	cout<<endl;
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
	cf{
		solve();
	}
}

C. Permutation Operations

思路：首先可以发现最后逆序对数一定是0，那么根据差分数组对i进行排序，接着输出i即可。

#include <bits/stdc++.h>//#include<iostream>//#include<string.h>//#include<math.h//#include<algorithm>
#define ll long long
#define db double
#define pii pair<int,int>
#define cf int _;cin>>_;while(_--)
#define de cout<<"---"<<endl;
#define mem(x,v) memset(x,v,sizeof(x))
#define L(x) x&(-x)
#define pb push_back//emplace_back//priority_queue <int,vector<int>,greater<int> > q;
#define INF 0x3f3f3f3f
#define endl '\n'
//function<void(int)> dfs = [&](int u);
#define x first
#define y second
using namespace std;
const int mod=998244353;
int n;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
int main(){
	ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
	cf{
		cin>>n;
		vector<pii>a(n);
		for(int i=0;i<n;i++){
			cin>>a[i].x;
			a[i].y=i;
		}
		for(int i=n-1;i>0;i--){
			a[i].x-=a[i-1].x;
		}
		sort(a.begin(),a.end(),[&](pii a,pii b){
			return a>b;
		});
		for(auto &[i,j]:a){
			cout<<j+1<<" ";
		}
		cout<<endl;
	}
}

D. Paths on the Tree

思路： 树形dp。假设父节点的路径数是t,子节点个数为cnt，平均分配k/cnt路径给子节点，剩下t%cnt条路径，取其子节点中（t/cnt+1)的答案减k/cnt的答案最大k%cnt个，然后也可以算出父节点经过路径数是t+1的答案，记录其为t+1的答案。最后就可得到根节点路径为k时的答案。

#include <bits/stdc++.h>//#include<iostream>//#include<string.h>//#include<math.h//#include<algorithm>
#define ll long long
#define db double
#define pii pair<int,int>
#define cf int _;cin>>_;while(_--)
#define de cout<<"---"<<endl;
#define mem(x,v) memset(x,v,sizeof(x))
#define L(x) x&(-x)
#define pb push_back//emplace_back//priority_queue <int,vector<int>,greater<int> > q;
#define INF 0x3f3f3f3f
#define endl '\n'
//function<void(int)> dfs = [&](int u);
//#define x first
//#define y second
using namespace std;
const int mod=998244353;
int n,k;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
int main(){
	ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
	cf{
		cin>>n>>k;
		vector<int>e[n+1];
		vector<ll>s(n+1);
		vector<vector<ll> >dp(n+1,vector<ll>(2,0));
		for(int i=2;i<=n;i++){
			int t;
			cin>>t;
			e[t].pb(i);
		}
		for(int i=1;i<=n;i++)cin>>s[i];
		function<void(int,int)> dfs = [&](int u,int res){
			int cnt=e[u].size();
			if(cnt==0){
				dp[u][1]=(res+1)*s[u];
				dp[u][0]=res*s[u];
				return ;
			}
			int t=res/cnt;
			ll ress=res*s[u];
			priority_queue <ll> q;
			for(int i=0;i<cnt;i++){
				dfs(e[u][i],t);
				ress+=dp[e[u][i]][0];
				q.push(dp[e[u][i]][1]-dp[e[u][i]][0]);
			}		
			for(int i=0;i<res%cnt;i++){
				ress+=q.top();
				q.pop();
			}
			dp[u][0]=ress;
			ress+=q.top();
			ress+=s[u];
			dp[u][1]=ress;
			return ;
		};
		dfs(1,k);
		cout<<dp[1][0]<<endl;
	}
}