Gym100971BCFGKL--2016, IX Samara Regional Intercollegiate Programming Contest

2016, IX Samara Regional Intercollegiate Programming Contest

题目链接：http://codeforces.com/gym/100971

B. Derangement

Problem: 交换数列中的项，使i！=pi,求最少交换次数，并输出交换的两者的位置

Solution: 遍历依次交换先出现的两个，当存在奇数项时，考虑首项末项来交换

Code:

#include<bits/stdc++.h>
using namespace std;
const int maxn=200005;
int n,a[maxn],cnt=0,pos=0;
int main() {
	scanf("%d",&n);
	for(int i=1; i<=n; i++) {
		scanf("%d",&a[i]);
		if(a[i]==i) cnt++;
	}
	printf("%d\n",(cnt+1)/2);
	for(int i=1; i<=n; i++) {
		if(a[i]==i) {
			if(!pos) pos=i;
			else {
				printf("%d %d\n",pos,i);
				pos=0;
				swap(a[i],a[pos]);
			}
		}
	}
	if(pos) {
		if(pos==1) printf("%d %d",n,1);
		else printf("%d %d",1,pos);
	}
	return 0;
}

C. Triangles

Problem: 求能与给定的任意两数都能组成三角形的长度

Solution:
$$max(L_i-L_j)<Ans<min(L_i+L_j)$$
Code:

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=200005;
ll n,a[maxn];
int main(){
	scanf("%lld",&n);
	for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
	sort(a+1,a+n+1);
	ll mx=a[n]-a[1];
	ll mi=a[1]+a[2];
	if(mi-mx>=2) return cout<<"YES"<<endl<<mx+1,0;
	return cout<<"NO",0;
}

F. Two Points

Problem: 给定两点及运动方向，求两点最小距离

Solution：简单数学

Code:

#include<bits/stdc++.h>
using namespace std;
int xa,ya,xb,yb,vx1,vx2,vy1,vy2;
int main() {
scanf("%d%d%d%d%d%d%d%d",&xa,&ya,&xb,&yb,&vx1,&vy1,&vx2,&vy2);
	if(!(vx1-vx2)&&!(vy1-vy2)) {
		return printf("%.7lf",(double)(sqrt((xa-xb)*(xa-xb)+(ya-yb)*(ya-yb)))),0;
	}
	if((xb-xa)*(vx2-vx1)+(yb-ya)*(vy2-vy1)<0) {
		return printf("%.7lf",fabs((double)((vx2-vx1)*(yb-ya)-(vy2-vy1)*(xb-xa)))/sqrt((vx2-vx1)*(vx2-vx1)+(vy2-vy1)*(vy2-vy1))),0;
	}
	return printf("%.7lf",(double)(sqrt((xa-xb)*(xa-xb)+(ya-yb)*(ya-yb)))),0;
}

G. Repair

Problem: 从a*b的纸上能否裁掉a1 * b1和a2 * b2的纸板

Solution: 考虑8种情况

Code:

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a,b,a1,b1,a2,b2;
int main(){
	scanf("%lld%lld%lld%lld%lld%lld",&a,&b,&a1,&b1,&a2,&b2);
	if(a1<b1) swap(a1,b1);
	if(a2<b2) swap(a2,b2);
	if(a1+a2<=a&&b>=max(b1,b2)) return cout<<"YES",0;
	if(a1+b2<=a&&b>=max(b1,a2)) return cout<<"YES",0;
	if(b1+a2<=a&&b>=max(a1,b2)) return cout<<"YES",0;
	if(b1+b2<=a&&b>=max(a1,a2)) return cout<<"YES",0;  
	if(a1+a2<=b&&a>=max(b1,b2)) return cout<<"YES",0;
	if(a1+b2<=b&&a>=max(b1,a2)) return cout<<"YES",0;
	if(b1+a2<=b&&a>=max(a1,b2)) return cout<<"YES",0;
	if(b1+b2<=b&&a>=max(a1,a2)) return cout<<"YES",0; 
	return cout<<"NO",0;
}

K. Palindromization

Problem: 删掉一个字母，使成为回文字符串

Solution: 前后比对，找到第一个不符合的字母后，进行分类讨论

Code:

#include<bits/stdc++.h>
using namespace std;
const int maxn=200005;
char s[maxn];
int main() {
	scanf("%s",s);
	int len=strlen(s);
	for(int i=0; i<len/2; i++) {
		if(s[i]!=s[len-i-1]) {
			bool flag=true;
			for(int j=i; j<len/2; j++) {
				if(s[j]!=s[len-j-1-1]) {
					flag=false;
					break;
				}
			}
			if(flag) return cout<<"YES"<<endl<<len-i,0;
			bool flag2=true;
			for(int j=i; j<len/2; j++) {
				if(s[j+1]!=s[len-j-1]) {
					flag2=false;
					break;
				}
			}
			if(flag2) return cout<<"YES"<<endl<<i+1,0;
			return cout<<"NO",0;
		}
	}
	return cout<<"YES"<<endl<<len/2+1,0;

}

L. Chess Match

Problem: 两组能力值，能力值打者赢，判断两组的结果：只有第一组能赢，只有第二组能赢，两组都能赢，两组都不会赢

Solution: 两组降序排列，田忌赛马，第一组把第二组中比他小的最大者打掉，统计胜场>n/2，就可能赢

Code:

#include<bits/stdc++.h>
using namespace std;
const int maxn=200005;
int n,a[maxn],b[maxn];
bool f(int s[],int t[]){
	int cnt=1,ans=0;
	for(int i=1;i<=n;i++){
		if(s[i]>t[cnt]){
			cnt++;
			ans++;
		}
	}
	if(ans>n/2) return true;
	return false;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]); 
	for(int i=1;i<=n;i++) scanf("%d",&b[i]); 
	sort(a+1,a+n+1);
	sort(b+1,b+n+1);
	bool flag1=f(a,b); 
	bool flag2=f(b,a);
	if(flag1&&flag2) return cout<<"Both",0;
	if(flag1) return cout<<"First",0;
	if(flag2) return cout<<"Second",0;
	return cout<<"None",0;
}