Codeforces Round 313 div2 题解

A： 水， 判断有没有1即可

#include <bits/stdc++.h>
using namespace std;
int a[1010];
int main(){
	int n;
	cin>>n;
	bool flag = false;
	for(int i=1; i<=n; i++)
	{
		scanf("%d", a+i);
		if(a[i] == 1)
			flag = true;
	}
	if(!flag) cout<<1<<endl;
	else cout<<-1<<endl;
	return 0;
}

B：八种情况判断一下就行了

#include <bits/stdc++.h>
using namespace std;
int a[3], b[3];
int main(){
	cin>>a[0]>>b[0]>>a[1]>>b[1]>>a[2]>>b[2];
	bool flag = false;
	if(a[1] + a[2] <= a[0] && max(b[1], b[2]) <=b[0])
		flag = true;
	if(a[1] + b[2] <= a[0] && max(b[1], a[2]) <=b[0])
		flag = true;
	if(b[1] + a[2] <= a[0] && max(b[2], a[1]) <= b[0])
		flag = true;
	if(b[1] + b[2] <= a[0] && max(a[1], a[2]) <= b[0])
		flag = true;

	if(a[1] + a[2] <= b[0] && max(b[1], b[2]) <=a[0])
		flag = true;
	if(a[1] + b[2] <= b[0] && max(b[1], a[2]) <=a[0])
		flag = true;
	if(b[1] + a[2] <= b[0] && max(b[2], a[1]) <= a[0])
		flag = true;
	if(b[1] + b[2] <= b[0] && max(a[1], a[2]) <= a[0])
		flag = true;

	if(flag) puts("YES");
	else puts("NO");
	return 0;
}

C:把这个图形补全成为三角形就可以做了

#include <bits/stdc++.h>
using namespace std;
int a,b,c,d,e,f;
int main(){
	cin>>a>>b>>c>>d>>e>>f;
	int x = b + a + c;
	int y = d + c + e;
	int z = f + e + a;
	int sum = x * x;
	sum = sum - a*a - c*c - e*e;
	cout<<sum<<endl;
	return 0;
}

D：简单分治

<pre class="cpp" name="code">#include <bits/stdc++.h>
using namespace std;
char a[200010];
char b[200010];

bool dfs(int l1, int r1, int l2, int r2){
	if(l1 == r1) {
		if(a[l1] == b[l2]) return true;
		else return false;
	}
	bool res = true;
	for(int i=l1, j = l2; i<=r1&&j<=r2; i++, j++)
		if(a[i] != b[j]){
			res = false;
			break;
		}
	if(res) return true;
	if((l1 + r1)%2 == 0) return false;
	int mid1 = (l1 + r1) >> 1;
	int mid2 = (l2 + r2) >> 1; 
	if(dfs(l1, mid1, mid2+1, r2) && dfs(mid1+1, r1, l2, mid2))
		return true;
	if(dfs(l1, mid1, l2, mid2)&&dfs(mid1+1, r1, mid2+1, r2))
		return true;
	return false;
}

int main(){
	scanf("%s %s", a, b);
	int len = strlen(a);
	if(dfs(0, len-1, 0, len-1)) puts("YES");
	else puts("NO");
	return 0;
}

E： dp+组合计数 好题！

#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
const int maxn = 240010;
long long fac[maxn], inv[maxn];
const long long mod = 1000000007;
long long pow_mod(long long a, long long b){
	long long res = 1;
	while(b){
		if(b&1LL) res *= a;
		res %= mod;
		b >>= 1LL;
		a *= a;
		a %= mod;
	}
	return res;
}
void init(){
	fac[0] = 1;
	inv[0] = 1;
	for(int i=1; i<=210000; i++)
		fac[i] = (fac[i-1] * i) % mod, inv[i] = pow_mod(fac[i], mod-2);
}
long long C(long long a, long long b){
	return fac[a]*inv[b]%mod*inv[a-b]%mod;
}
pair<int, int> node[3010];
bool cmp(pair<int, int> c, pair<int, int> d){
	if(c.first != d.first)
		return c.first < d.first;
	return c.second < d.second;
}
long long dp[2010];
int main(){
	init();
	memset(dp, 0, sizeof(dp));
	int n,m,k;
	cin>>n>>m>>k;
	for(int i=1; i<=k; i++)
		scanf("%d %d", &node[i].first, &node[i].second);
	k++;
	node[k].x = n; node[k].y = m;	
	sort(node+1, node+k+1, cmp);
	for(int i=1; i<=k; i++){
		int xi = node[i].x;int yi = node[i].y;
		dp[i] = C(xi+yi-2, xi-1); 
		for(int j=1; j<i; j++){
			if(node[j].x <= node[i].x && node[j].y <= node[i].y){
				int xj = node[j].x; int yj = node[j].y;
				dp[i] -= dp[j]*C(xi - xj + yi - yj, xi-xj)%mod;
			}
		}
		dp[i] = (dp[i]%mod + mod) % mod;
	}
	cout<<dp[k]<<endl;
	return 0;
}