紫书训练 7.11

https://vjudge.net/contest/310148#overview 贪心场次

密码：996996

A - Bits Equalizer

有点思维

#include<bits/stdc++.h>
#define il inline
#define pb push_back
#define fi first
#define se second
#define ms(_data,v) memset(_data,v,sizeof(_data))
#define sc(n) scanf("%d",&n)
#define SC(n,m) scanf("%d %d",&n,&m)
#define SZ(a) int((a).size())
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define drep(i,a,b)	for(int i=a;i>=b;--i)
using namespace std;
typedef long long ll;
const ll inf=0x3f3f3f3f;
const double PI=acos(-1.0);
const double eps=1e-9;
int T; 
int main(){
	std::ios::sync_with_stdio(0);
	cin>>T;
	string a,b;
	rep(t,1,T){
		cin>>a>>b;
		int s01=0,s10=0,sq1=0,sq0=0;
		for(int i=0;i<SZ(a);++i){
			if(a[i]=='0' && b[i]=='1') s01++;
			else if(a[i]=='1' && b[i]=='0') s10++;
			else if(a[i]=='?' && b[i]=='1') sq1++;
			else if(a[i]=='?' && b[i]=='0') sq0++; 
		}
		if(s01+sq1 < s10)	cout<<"Case "<<t<<": "<<-1<<endl;
		else	cout<<"Case "<<t<<": "<<sq1+sq0+max(s01,s10)<<endl;
	}
	return 0;
}

B - Hell on the Markets

 这个结论根本猜不到T_T

#include<bits/stdc++.h>
#define il inline
#define pb push_back
#define fi first
#define se second
#define ms(_data,v) memset(_data,v,sizeof(_data))
#define sc(n) scanf("%d",&n)
#define SC(n,m) scanf("%d %d",&n,&m)
#define SZ(a) int((a).size())
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define drep(i,a,b)	for(int i=a;i>=b;--i)
using namespace std;
typedef long long ll;
const ll inf=0x3f3f3f3f;
const double PI=acos(-1.0);
const double eps=1e-9;
const int maxn=1e5+5; 
int n,b[maxn];
struct node{
	int id,num;
}a[maxn];
bool cmp(node x,node y){
	return x.num>y.num;
}
int main(){
	std::ios::sync_with_stdio(0);
	while(cin>>n){
		ll sum=0;
		rep(i,1,n) cin>>a[i].num,sum+=a[i].num,a[i].id=i;
		if(sum&1) cout<<"No"<<endl;
		else{
			sum/=2;
			sort(a+1,a+n+1,cmp);
			for(int i=1;i<=n;++i){
				if(a[i].num<=sum) sum-=a[i].num,b[a[i].id]=1;
				else b[a[i].id]=-1;
			}
			cout<<"Yes"<<endl;
			for(int i=1;i<=n-1;++i) cout<<b[i]<<" ";
			cout<<b[n]<<endl;
		}
	}
	return 0;
}

C - Highway

 题目又说公路是X轴吗

#include<bits/stdc++.h>
#define il inline
#define pb push_back
#define fi first
#define se second
#define ms(_data,v) memset(_data,v,sizeof(_data))
#define sc(n) scanf("%d",&n)
#define SC(n,m) scanf("%d %d",&n,&m)
#define SZ(a) int((a).size())
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define drep(i,a,b)	for(int i=a;i>=b;--i)
using namespace std;
typedef long long ll;
const ll inf=0x3f3f3f3f;
const double PI=acos(-1.0);
const double eps=1e-9;
const int maxn=1e5+5;
struct node {
	double l,r;
} a[maxn];
bool cmp(node x,node y) {
	if(x.r != y.r) return x.r<y.r;
	else return x.l<y.l;
}
int main() {
	std::ios::sync_with_stdio(0);
	double l,d;
	int n;
	while(cin>>l>>d>>n) {
		double x,y;
		rep(i,1,n) {
			cin>>x>>y;
			a[i].l=max(0.0,x-sqrt(d*d-y*y));
			a[i].r=min(l,x+sqrt(d*d-y*y));
		}
		sort(a+1,a+n+1,cmp);
		int ans=1;
		double np=a[1].r;
		rep(i,2,n) {
			if(a[i].r==np)	continue;
			else if(a[i].l>np){
				ans++;
				np=a[i].r;	
			} 
		}
		cout<<ans<<endl;
	}
	return 0;
}

D - Unique Snowflakes

 离散化+尺取

#include<bits/stdc++.h>
#define il inline
#define pb push_back
#define fi first
#define se second
#define ms(_data,v) memset(_data,v,sizeof(_data))
#define sc(n) scanf("%d",&n)
#define SC(n,m) scanf("%d %d",&n,&m)
#define SZ(a) int((a).size())
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define drep(i,a,b)	for(int i=a;i>=b;--i)
using namespace std;
typedef long long ll;
const ll inf=0x3f3f3f3f;
const double PI=acos(-1.0);
const double eps=1e-9;
const int maxn=1e6+5;
int T,n,a[maxn],b[maxn];
int vis[maxn];
int main(){
	std::ios::sync_with_stdio(0);
	cin>>T;
	while(T--){
		cin>>n;
		rep(i,1,n)	cin>>a[i],b[i]=a[i];
		sort(b+1,b+n+1);
		rep(i,1,n) a[i]=lower_bound(b+1,b+n+1,a[i])-b;
		ms(vis,0);
		int l=1,r=2,ans=1;
		vis[a[1]]++,vis[a[2]]++;
		while(r<=n){
			while(vis[a[r]]>1){
				vis[a[l++]]--;
			}
			ans=max(ans,r-l+1);
			vis[a[++r]]++;
		}
		cout<<ans<<endl;
	}
	return 0;
}

E - Fabled Rooks

 把x和y分开了考虑，用y从小到大排序。

#include<bits/stdc++.h>
#define il inline
#define pb push_back
#define fi first
#define se second
#define ms(_data,v) memset(_data,v,sizeof(_data))
#define sc(n) scanf("%d",&n)
#define SC(n,m) scanf("%d %d",&n,&m)
#define SZ(a) int((a).size())
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define drep(i,a,b)	for(int i=a;i>=b;--i)
using namespace std;
typedef long long ll;
const ll inf=0x3f3f3f3f;
const double PI=acos(-1.0);
const double eps=1e-9;
const int maxn=1e5+5;
int n,ax[maxn],ay[maxn];
struct node {
	int l,r,id;
} X[maxn],Y[maxn];
bool cmp(node x,node y) {
	return x.r<y.r;
}
bool fgx[maxn],fgy[maxn];
int main() {
	std::ios::sync_with_stdio(0);
	while(cin>>n && n) {
		ms(fgx,0),ms(fgy,0);
		rep(i,1,n) {
			cin>>X[i].l>>Y[i].l>>X[i].r>>Y[i].r;
			X[i].id=i,Y[i].id=i;
		}
		bool fg=0;
		sort(X+1,X+n+1,cmp);
		rep(i,1,n) {
			int j;
			for(j=X[i].l; j<=X[i].r; ++j) {
				if(fgx[j]==0) {
					ax[X[i].id]=j,fgx[j]=1;
					break;
				}
			}
			if(j>X[i].r) {
				fg=1;
				break;
			}
		}
		if(fg) cout<<"IMPOSSIBLE"<<endl;
		else {
			sort(Y+1,Y+n+1,cmp);
			rep(i,1,n) {
				int j;
				for(j=Y[i].l; j<=Y[i].r; ++j) {
					if(fgy[j]==0) {
						ay[Y[i].id]=j,fgy[j]=1;
						break;
					}
				}
				if(j>Y[i].r) {
					fg=1;
					break;
				}
			}
			if(fg) cout<<"IMPOSSIBLE"<<endl;
			else{
				rep(i,1,n){
					cout<<ax[i]<<" "<<ay[i]<<endl;
				}
			}
		}

	}
	return 0;
}

F - Meeting with Aliens

 暴力，枚举每一个点为起始点，贪心交换

#include<bits/stdc++.h>
#define il inline
#define pb push_back
#define fi first
#define se second
#define ms(_data,v) memset(_data,v,sizeof(_data))
#define sc(n) scanf("%d",&n)
#define SC(n,m) scanf("%d %d",&n,&m)
#define SZ(a) int((a).size())
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define drep(i,a,b)	for(int i=a;i>=b;--i)
using namespace std;
typedef long long ll;
const ll inf=0x3f3f3f3f;
const double PI=acos(-1.0);
const double eps=1e-9;
const int maxn=1e3+5;
int n,a[maxn],p[maxn],b[maxn];
il int solve(int st){
	if(st>n) return inf;
	for(int i=1;i<=n;++i) b[i]=a[st+i-1];
	for(int i=1;i<=n;++i)	p[b[i]]=i;
	int res=0;
	for(int i=1;i<=n;++i){
		if(b[i]==i) continue;
		p[b[i]]=p[i];
		swap(b[i],b[p[i]]);
		res++;
	}
	return res;
}
il int solve2(int st){
	if(st<n) return inf;
	for(int i=1;i<=n;++i) b[i]=a[st-i+1];
	for(int i=1;i<=n;++i)	p[b[i]]=i;
	int res=0;
	for(int i=1;i<=n;++i){
		if(b[i]==i) continue;
		p[b[i]]=p[i];
		swap(b[i],b[p[i]]);
		res++;
	}
	return res;
}
int main(){
	std::ios::sync_with_stdio(0);
	while(cin>>n && n){
		rep(i,1,n)	cin>>a[i],a[i+n]=a[i];
		int ans=inf;
		rep(i,1,2*n){
			ans=min(ans,solve(i));
			ans=min(ans,solve2(i));
		} 
		cout<<ans<<endl;
	}
	return 0;
}

G - Average

 数形结合基础题，可是不会啊 可以先看这个  传送门

#include<bits/stdc++.h>
#define il inline
#define pb push_back
#define fi first
#define se second
#define ms(_data,v) memset(_data,v,sizeof(_data))
#define sc(n) scanf("%d",&n)
#define SC(n,m) scanf("%d %d",&n,&m)
#define SZ(a) int((a).size())
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define drep(i,a,b)	for(int i=a;i>=b;--i)
using namespace std;
typedef long long ll;
const ll inf=0x3f3f3f3f;
const double PI=acos(-1.0);
const double eps=1e-9;
const int maxn=1e5+5;
int T,n,l,sum[maxn],que[maxn];
string s; 
il double getK(int x,int y){
	return (sum[y]-sum[x]+0.0)/(y-x+0.0);
}
int main(){
	std::ios::sync_with_stdio(0);
	cin>>T;
	while(T--){
		cin>>n>>l>>s;
		for(int i=0;i<SZ(s);++i){
			sum[i+1]=sum[i]+(s[i]-'0');
		}
		int len=l,sta=0,end=l,top=-1,bot=0;
		double ans=getK(0,l);
		for(int i=l;i<=n;++i){
			int np=i-l;
			while(bot<top && getK(que[top],np) <= getK(que[top-1],que[top]))	top--;
			que[++top]=np;
			while(bot<top && getK(que[bot],i) <= getK(que[bot+1],i))	bot++;
			double nk=getK(que[bot],i);
			if(nk>ans || (ans==nk && len>i-que[bot])){
				ans=nk;
				len=i-que[bot];
				sta=que[bot];
				end=i;
			}
		}
		cout<<sta+1<<" "<<end<<endl;	
	}
	return 0;
}