Codeforces Round #790 (Div. 4) (AC代码)

G题题目看错了，一直在调，结果是输入n-1个数不是n个数，难受的一批。导致H题一个简单的树状数组也没写出来，比赛完就调出来了。Rank 3000/29000
A题

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;

typedef pair<int,int>pii;
typedef pair<long,long> lpii;
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
int gcd(int a,int b){return b?gcd(b,a%b):a;}
const int P=131;

int t;
string s;

void work(){
	int psum=0,lsum=0;
	rep(i,0,2) psum+=s[i]-'0';
	rep(i,3,5) lsum+=s[i]-'0';
	
	if(lsum==psum) cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
} 
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin>>t;
	while(t--){
		cin>>s;
		work();
	}
	return 0;
}

B题

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;

typedef pair<int,int>pii;
typedef pair<long,long> lpii;
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
int gcd(int a,int b){return b?gcd(b,a%b):a;}
const int P=131;
const int N=100;

int t;
int n,a[N];

void work(){
	int minv=inf;
	ll sum=0;
	rep(i,1,n){
		sum+=a[i];
		minv=min(minv,a[i]);
	}
	cout<<sum-minv*n<<endl;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin>>t;
	while(t--){
		cin>>n;
		rep(i,1,n) cin>>a[i];
		
		work();
	}
	return 0;
}

C题

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;

typedef pair<int,int>pii;
typedef pair<long,long> lpii;
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
int gcd(int a,int b){return b?gcd(b,a%b):a;}
const int P=131;
const int N=100;

int t;
int n,m;
string s[N];

void work(){
	int minv=inf;
	int sum;
	int x,y;
	rep(i,1,n){
		rep(j,i+1,n){
			sum=0;
			rep(k,0,m-1){
				x=s[i][k]-'0';
				y=s[j][k]-'0';
				
				sum+=abs(x-y);
			}
			minv=min(minv,sum);
		}
	}
	cout<<minv<<endl;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin>>t;
	while(t--){
		cin>>n>>m;
		rep(i,1,n) cin>>s[i];
		
		work();
	}
	return 0;
}

D题

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;

typedef pair<int,int>pii;
typedef pair<long,long> lpii;
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
int gcd(int a,int b){return b?gcd(b,a%b):a;}
const int P=131;
const int N=205;

int t;
int n,m,mp[N][N];

void work(){
	int maxv=0;
	int sum;	
	int x,y;
	
	rep(i,1,n){
		rep(j,1,m){
			sum=0;
			x=i;y=j;
			while(x!=1 && y!=1) x--,y--;
			while(x<=n && y<=m) sum+=mp[x][y],x++,y++;
			
			x=i;y=j;
			while(x!=n && y!=1) x++,y--;
			while(x>=1 && y<=m) sum+=mp[x][y],x--,y++;
			
			maxv=max(maxv,sum-mp[i][j]);
		}
		
	}
	
	cout<<maxv<<endl;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin>>t;
	while(t--){
		cin>>n>>m;
		rep(i,1,n){
			rep(j,1,m){
				cin>>mp[i][j];
			}
		}
		work();
	}
	return 0;
}

E题

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;

typedef pair<int,int>pii;
typedef pair<long,long> lpii;
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
int gcd(int a,int b){return b?gcd(b,a%b):a;}
const int P=131;
const int N=2e5+10;

int t;
int n,q,a[N];
ll x;

int bin_serch(ll sum[],ll val){
	int l=1,r=n;
	while(l<=r){
		int mid=l+r>>1;
		if(sum[mid]>=val) r=mid-1;
		else l=mid+1;
	}
	
	if(l==n+1) return -1;
	else return l;
}
void work(){
	ll presum[N];
	int ans;
	rep(i,1,n) presum[i]=presum[i-1]+a[i];
	
	rep(i,1,q){
		cin>>x;
		ans=bin_serch(presum,x);
		cout<<ans<<endl;
	}
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin>>t;
	while(t--){
		cin>>n>>q;
		rep(i,1,n) cin>>a[i];
		sort(a+1,a+1+n,greater<int>());
		work();
	}
	return 0;
}

F题

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;

typedef pair<int,int>pii;
typedef pair<long,long> lpii;
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
int gcd(int a,int b){return b?gcd(b,a%b):a;}
const int P=131;
const int N=2e5+10;

int t;
int n,a[N],k;

void work(){
	map<int,int>mp;
	vector<int> ans;
	rep(i,1,n) mp[a[i]]++;
	
	for(map<int,int>::iterator it=mp.begin();it!=mp.end();it++){
		if(it->se>=k) ans.pb(it->fi);
	}
	if(ans.empty()){
		cout<<-1<<endl;
		return;
	}
	
	int size=ans.size();
	int dp[N];
	memset(dp,0,sizeof dp);
	
	dp[0]=1;
	rep(i,1,size-1){
		if(ans[i]==ans[i-1]+1) dp[i]=dp[i-1]+1;
		else dp[i]=1;
	}
	
	int maxj,maxlen=0;
	rep(i,0,size-1){
		if(dp[i]>maxlen){
			maxlen=dp[i];
			maxj=i;
		}
	}
	cout<<ans[maxj]-maxlen+1<<" "<<ans[maxj]<<endl;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin>>t;
	while(t--){
		cin>>n>>k;
		rep(i,1,n) cin>>a[i];
		sort(a+1,a+1+n);
		work();
	}
	return 0;
}

G题

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;

typedef pair<int,int>pii;
typedef pair<long,long> lpii;
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
int gcd(int a,int b){return b?gcd(b,a%b):a;}
const int P=131;
const int N=4010;

int t;
int n,a[N];
string s;

int ans;
//��� �Һ� 
pii dfs(int root,vector<int>p[N]){
	if(p[root].size()==0){
		if(s[root]=='W') return pii(1,0);
		else return pii(0,1);
	}
	
	pii L;
	int w=0,b=0;
	rep(i,0,p[root].size()-1){
		int v=p[root][i];
		L=dfs(v,p);
		
		w+=L.fi;
		b+=L.se;
	}
	

	
	if(s[root]=='W') w++;
	else b++;
	
	if(w==b) ans++;
	
	return pii(w,b);	
}
void work(){
	
	
	vector<int>p[N];
	rep(i,1,n-1) p[a[i]].pb(i+1);
	ans=0;
	dfs(1,p);
	
	cout<<ans<<endl;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin>>t;
	while(t--){
		cin>>n;
		rep(i,1,n-1) cin>>a[i];
		cin>>s;
		s=' '+s;
		work();
	}
	return 0;
}

H题

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;

typedef pair<int,int>pii;
typedef pair<long,long> lpii;
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
#define ll long long
#define ull unsigned long long
#define inf 0x3f3f3f3f
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
int gcd(int a,int b){return b?gcd(b,a%b):a;}
const int P=131;
const int N=2e5+10;

int t;
int n,a[N];
int sum[N];
int lowbit(int x){
	return x&(-x);
}

void add(int x,int val){
	while(x<=n){
		sum[x]+=val;
		x+=lowbit(x);
	}
}

int query(int x){
	int ans=0;
	while(x){
		ans+=sum[x];
		x-=lowbit(x);
	}
	return ans;
}
void work(){
	memset(sum,0,sizeof sum);
	ll ans=0;
	ll total=0;
	rep(i,1,n){
		ans+=(total-query(a[i]-1));
		total++;
		add(a[i],1);
	}
	cout<<ans<<endl;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin>>t;
	while(t--){
		cin>>n;
		rep(i,1,n) cin>>a[i];
		work();
	}
	return 0;
}