AtCoder Beginner Contest 232 (A,B,C,D,E,F)

A. QQ solver

语法基础题

ACcode

#include<bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;


int main(){
	
	int a, b; char c;
	cin >> a >> c >> b;
	cout << a * b << endl;
	
	return 0;
}

B. Caesar Cipher

计算对应位置上字母的距离差是否相等。

ACcode

#include<bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;

int main(){
	
	string a, b;
	cin >> a >> b;
	
	int len = a.size(), res = 1;
  	int flag = b[0] - a[0]; 
	if(flag < 0) flag += 26;
	for(int i = 1; i < len; i++){
		int tmp = b[i] - a[i];
		if(tmp < 0) tmp += 26;
      	if(flag != tmp) res = 0;
	}
	
	if(res) cout << "Yes" << endl;
	else cout << "No" << endl;
	
	return 0;
}

C. Graph Isomorphism

暴力枚举所有的 P 序列，时间复杂度 $O(n!\ast n\ast n)$

ACcode

#include<bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;

const int maxn = 1e5 + 5;

int a[10][10];
int b[10][10];
int p[10];

int main(){

	int n, m;
	cin >> n >> m;
	int u, v;
	for(int i = 1; i <= m; i++){
		cin >> u >> v;
		a[u][v] = 1;
		a[v][u] = 1;
	}	
	for(int i = 1; i <= m; i++){
		cin >> u >> v;
		b[u][v] = 1;
		b[v][u] = 1;
	}
	
	for(int i = 1; i <= n; i++) p[i] = i;
	
	int res = 0;
	do{
		int flag = 1;
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= n; j++){
				if(i == j) continue;
				if(a[i][j]){
					if(!b[p[i]][p[j]]){
						flag = 0;
						break;	
					}
				}
			}
			if(!flag) break;
		}
		if(flag == 1){
			res = 1;
			break;
		}
	}while(next_permutation(p+1, p+1+n));
	
	if(res) cout << "Yes" << endl;
	else cout << "No" << endl;
	
	
	return 0;
}

D. Weak Takahashi

枚举一遍即可，遇到 $.$ 就在上两个位置$+1$, 遇到 $\#$ 就让这个位置的价值为一个很小的负数(不会影响答案)。

ACcode

#include<bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;

const int mn = -999999;

char a[105][105];
int v[105][105];

int main(){

	int n, m;
	cin >> n >> m;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			cin >> a[i][j];
			v[i][j] = mn;
		}
	}
	
	int res = 0;
	for(int i = 1; i <= n; i++) v[i][0] = mn;
	for(int j = 1; j <= m; j++) v[0][j] = mn;
	v[1][0] = v[0][1] = 0;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			v[i][j] = max(v[i][j], v[i-1][j]+1);
			v[i][j] = max(v[i][j], v[i][j-1]+1);
			if(a[i][j] == '#') v[i][j] = mn;
			res = max(res, v[i][j]);
		}
	}
	cout << res << endl;
	
	return 0;
}

E. Rook Path

计数dp。
定义：
* $d{p}_{i,0}$ 表示移动 $i$ 次，到达终点的移动方案数
* $d{p}_{i,1}$ 表示移动 $i$ 次，到达与终点同行但不同列的点的移动方案数
* $d{p}_{i,2}$ 表示移动 $i$ 次，到达与终点同列但不同行的点的移动方案数
* $d{p}_{i,3}$ 表示移动 $i$ 次，到达与终点不同行不同列的点的移动方案数

状态转移方程和初始值看代码。

ACcode

#include<bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;

const int maxn = 1e6 + 5;
const int mod = 998244353;

ll dp[maxn][5];

int main(){
	
	int n, m, k;
	cin >> n >> m >> k;
	int x1, y1, x2, y2;
	cin >> x1 >> y1 >> x2 >> y2;
	
	dp[0][0] = (x1 == x2 && y1 == y2);
	dp[0][1] = (x1 == x2 && y1 != y2);
	dp[0][2] = (x1 != x2 && y1 == y2);
	dp[0][3] = (x1 != x2 && y1 != y2);
	for(int i = 1; i <= k; i++){
		dp[i][0] = (dp[i-1][1] + dp[i-1][2]) % mod;
		dp[i][1] = (dp[i-1][1] * (m-2) % mod + dp[i-1][0] * (m-1) % mod + dp[i-1][3]) % mod;
		dp[i][2] = (dp[i-1][2] * (n-2) % mod + dp[i-1][0] * (n-1) % mod + dp[i-1][3]) % mod;
		dp[i][3] = (dp[i-1][1] * (n-1) % mod + dp[i-1][2] * (m-1) % mod + dp[i-1][3] * (n+m-4)) % mod;
	}
	
	cout << dp[k][0] << endl;
	
	return 0;
}

F. Simple Operations on Sequence

状压DP。

详解传送门：~~~