Codeforces Round #744 (Div. 3)题解

66 阅读 0 评论 44 点赞

我是靠谱客的博主曾经钢笔，最近开发中收集的这篇文章主要介绍Codeforces Round #744 (Div. 3)题解，觉得挺不错的，现在分享给大家，希望可以做个参考。

概述

A - Casimir’s String Solitaire

#include<bits/stdc++.h>
using namespace std;
string s;
int n;
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		int a=0,b=0,c=0;cin>>s;
		for(int j=0;j<s.size();j++){
			if(s[j]=='A') a++;
			else if(s[j]=='B') b++;
			else c++;
		}
		if(b==(a+c)) cout<<"YES"<<endl;
		else cout<<"NO"<<endl;
	}
}

B - Shifting Sort

#include<bits/stdc++.h>
using namespace std;
int t,n;const int N=55;
int a[N];
vector<pair<int,int>> v;
pair<int,int> p[N];
int main(){
    scanf("%d",&t);
    while(t--){
        v.clear();
        scanf("%d",&n);for(int i=1;i<=n;i++) scanf("%d",&a[i]);
        for(int i=1;i<=n;i++){
            int maxi=-1e9-5,pos;
            for(int j=1;j<=n-i+1;j++){
                if(maxi<a[j]){
                    maxi=a[j];pos=j;
                }
            }
            if(pos==n-i+1) continue;
            v.push_back({pos,n-i+1});
            for(int j=pos;j<=n-i+1;j++) a[j]=a[j+1];
            a[n-i+1]=maxi;
        }
        cout<<v.size()<<endl;
        for(int i=0;i<v.size();i++){
            cout<<v[i].first<<" "<<v[i].second<<" 1"<<endl;
        }

    }
}

C - Ticks

#include<bits/stdc++.h>
using namespace std;
const int N=50;
char ch[N][N];
int t,n,m,k,vis[N][N];
int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%d%d%d",&n,&m,&k);
		memset(vis,0,sizeof vis);
		for(int i=1;i<=n;i++){
			cin>>ch[i]+1;
		}
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				if(ch[i][j]=='*'){
					int x=i,y=j,xx=i,yy=j;
					vector<pair<int,int>> v;
					while(x>0&&y>0&&xx>0&&yy<=m){
						if(ch[x][y]==ch[xx][yy]&&ch[x][y]=='*'){
//							vis[x][y]=vis[xx][yy]=1;
//							cout<<x<<" "<<y<<" "<<xx<<" "<<yy<<endl;
							v.push_back({x,y});v.push_back({xx,yy});
							x-=1;y-=1;xx-=1;yy+=1;
							
						}else break;
					}
					if(v.size()/2-1>=k){
						for(int k=0;k<v.size();k++){
							vis[v[k].first][v[k].second]=1;
						}
					}
				}
			}
		}
		int fl=0;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				if(vis[i][j]==0&&ch[i][j]=='*'){
					fl=1;
				}
			}
		}
		if(fl==1){
			cout<<"NO"<<endl;
		}else cout<<"YES"<<endl;
	}
}

D - Productive Meeting

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
struct node{
	int num,id;
	bool operator < (const node &a)const
    {
    	if(num==a.num) return id<a.id;
    	return num<a.num;
    }
};
priority_queue<node> q;
int t,n;
int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		while(q.size()) q.pop();
		for(int i=1;i<=n;i++){
			int x;
			scanf("%d",&x);
			if(x>=1)
			q.push({x,i});
		}
		vector< pair<int,int> > v;
//		v.push_back({1,0});
		while(q.size()>=2){
			auto tp1=q.top();q.pop();
			auto tp2=q.top();q.pop();
			int x=tp1.id,y=tp2.id;
			v.push_back( {x,y} );
			if(tp1.num-1>0) q.push({tp1.num-1,tp1.id});
			if(tp2.num-1>0) q.push({tp2.num-1,tp2.id});
		}
		cout<<v.size()<<endl;
		for(int i=0;i<v.size();i++){
			printf("%d %dn",v[i].first,v[i].second);
		}
	}
}

E1 - Permutation Minimization by Deque

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int t,n,a[N],pos[N],vis[N];
int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		for(int i=1;i<=n;i++) vis[i]=0;
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
			pos[a[i]]=i;
		}
		int pre=n;
		vector<pair<int,int>> v;
		for(int i=1;i<=n;i++){
			int l=pos[i],r=pre;
			if(vis[i]==1) continue;
			v.push_back({l,r});
			for(int j=l;j<=r;j++) vis[a[j]]=1;
			pre=l-1;
		}
		for(int i=0;i<v.size();i++){
			printf("%d ",a[v[i].first]);
		}
		for(int i=v.size()-1;i>=0;i--){
			int l=v[i].first,r=v[i].second;
			for(int j=l+1;j<=r;j++){
				printf("%d ",a[j]);
			}
		}
		cout<<endl;
	}
}

E2 - Array Optimization by Deque

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
struct BIT{
    int n,c[N];//n为所维护的bit的范围，注意不要混用，离散化时会改变范围
    void init(int _n){n=_n;for(int i=1;i<=n;++i) c[i]=0;}
    int lowbit(int x){return x&(-x);}//负数为对应正数二进制保留最低位1及之前的0不变，其它取反 故该操作可获得x最位为1对应的值（2的几次方）
    int get_sum(int k){int ans=c[k];while((k-=lowbit(k))>0) ans+=c[k];return ans;}
    void add(int t,int v){c[t]+=v;while((t+=lowbit(t))<=n) c[t]+=v;}
}bit1;
int t,n,a[N];vector<int> v;
map<int,int> mp;
int main(){
	scanf("%d",&t);
	while(t--){
		v.clear();mp.clear();
		scanf("%d",&n);for(int i=1;i<=n;i++) scanf("%d",&a[i]),v.push_back(a[i]);
		sort(v.begin(),v.end());
		v.erase(unique(v.begin(),v.end()),v.end());
		for(int i=0;i<v.size();i++){
			mp[v[i]]=i+1;
		}
		bit1.init(N-1);
		long long ans=0;
		for(int i=1;i<=n;i++){
			int to=mp[a[i]];
			int sum1=bit1.get_sum(N-1),tp1=bit1.get_sum(to-1),tp2=bit1.get_sum(to);
			ans+=min(tp1,sum1-tp2);
			bit1.add(to,1);
		}
		cout<<ans<<endl;
		
	}
}

F - Array Stabilization (AND version)

#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int t,n,d,a[N];
int main(){
	scanf("%d",&t);
	while(t--){
//		memset(cnt,0,sizeof cnt);
		scanf("%d%d",&n,&d);
		queue<pair<int,int>> q;
		for(int i=0;i<n;i++){
			scanf("%d",&a[i]);
			if(a[i]==0) q.push({i,0});
		}
		int maxi=0,f=0;
		while(q.size()){
			auto tp=q.front();q.pop();
			maxi=max(maxi,tp.second);
			int pos=tp.first,to=(pos+n-d)%n;
			if(a[to]==1){
				a[to]=0;
				q.push({to,tp.second+1});
			}
		}
		for(int i=0;i<n;i++){
			if(a[i]==1) f=1;
		}
		if(f==1) printf("-1n");
		else  printf("%dn",maxi);
		
	}
}