牛客周赛 Round 32

牛客竞赛_ACM/NOI/CSP/CCPC/ICPC算法编程高难度练习赛_牛客竞赛OJ

A 

小红的 01 背包

#define _CRT_SECURE_NO_WARNINGS 1

#include<bits/stdc++.h>
using namespace std;

void solve()
{
	int v, x, y;
	cin >> v >> x >> y;
	cout << v / x * y;
}
int main()
{
	solve();
	return 0;
}

B

小红的 dfs

#define _CRT_SECURE_NO_WARNINGS 1

#include<bits/stdc++.h>
using namespace std;
string a[4],d,e,f;
void solve()
{
	for (int i = 1; i <=3; i++)
		cin >> a[i];
	d=d+ a[1][0] + a[2][0] + a[3][0];
	e=e+ a[1][1] + a[2][1] + a[3][1];
	f=f+ a[1][2] + a[2][2] + a[3][2];
	
	int ans = 100;
	int k = 0;
	string s = "dfs";
	//1
	for (int i = 0; i <= 2; i++)
		if (s[i] != a[1][i])k++;
	for (int i = 1; i <= 2; i++)
		if (s[i] != d[i])k++;
	ans = min(ans, k);

	k = 0;
	for (int i = 0; i <= 2; i++)
		if (s[i] != a[3][i])k++;
	for (int i = 0; i <= 1; i++)
		if (s[i] != f[i])k++;
	ans = min(ans, k);

	k = 0;
	for (int i = 0; i <= 2; i++)
		if (s[i] != a[2][i])k++;
	if (s[0] !=e[0])k++;
	if (s[2] != e[2])k++;

	ans = min(ans, k);
	cout << ans;
}
int main()
{
	solve();
	return 0;
}

C

小红的排列生成

#define _CRT_SECURE_NO_WARNINGS 1
 
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 5;
int a[N];
void solve()
{
    int n; cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    sort(a + 1, a + 1 + n);
    int ans = 0;
    for (int i = 1; i <= n; i++)
        ans += abs(a[i] - i);
    cout << ans;
}
signed main()
{
    solve();
    return 0;
}

D

小红的二进制树

#define _CRT_SECURE_NO_WARNINGS 1

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<int>t[N];
int val[N];
int dp[N];

void dfs(int p, int pre)
{
	dp[p] = val[p];
	for (int i = 0; i < t[p].size(); i++)
	{
		if (t[p][i] == pre)continue;
		dfs(t[p][i], p);
		dp[p] = dp[p] + dp[t[p][i]];
	}
}

void solve()
{
	int n; cin >> n;
	string st; cin >> st;
	for (int i = 1; i <= n; i++)
		val[i] = st[i - 1]-'0';
	for (int i = 1; i <= n - 1; i++)
	{
		int u, v; cin >> u >> v;
		t[u].push_back(v);
		t[v].push_back(u);
	}
	dfs(1, 0);

	for (int i = 1; i <= n; i++)
	{
		cout << dp[i] - val[i] << endl;
	}
}

int main()
{
	solve();
	return 0;
}

E

小红的回文数

#define _CRT_SECURE_NO_WARNINGS 1

#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;

map<vector<int>, int>m;
int main()
{
	string s; cin >> s;
	int n = s.length();
	vector<int>temp;
	for (int i = 0; i < 10; i++)temp.push_back(0);
	m[temp]++;
	long long sum = 0;
	for (int i = 0; i < n; i++)
	{
		temp[s[i] - '0'] ^= 1;
		sum += m[temp];
		for (int j = 0; j < 10; j++)
		{
			vector<int>tt = temp;
			tt[j] ^= 1;
			sum += m[tt];
		}
		m[temp]++;
	}
	cout<<sum;
}

 F

小红的矩阵修改

 

#define _CRT_SECURE_NO_WARNINGS 1

#include<bits/stdc++.h>
using namespace std;

int dp[1010][100];
map<char, int>val;
int n, m;
string a[4];
int p[1010];
int prm[5] = { 1,3,9,27,81 };
int t[4];

int check(int x)
{
	for (int i = 0; i < n; i++)
	{
		t[i] = x % 3;
		x /= 3;
	}
	for (int i = 1; i < n; i++)
		if (t[i] == t[i - 1])return 0;
	return 1;
}
int pr[4];
int check(int x,int pre)
{
	for (int i = 0; i < n; i++)
	{
        if(x%3==pre%3)
            return 0;
        pre/=3;x/=3;
    }
    return 1;
}
void init()
{
    
	cin >> n >> m;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	val['r'] = 0;
	val['e'] = 1;
	val['d'] = 2;
	memset(dp, 0x3f, sizeof(dp));
}
void solve()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
	init();
	int cnt=0;
	for (int i = 0; i < m; i++)
	{
		for (int j = 0; j < prm[n]; j++)
		if (i == 0)
		{
			if (check(j))
			{
				cnt = 0;
				for (int k = 0; k < n; k++)
					if (t[k] != val[a[k][i]])cnt++;
				dp[i][j] = min(cnt, dp[i][j]);
			}
		}
		else
			for (int j = 0; j < prm[n]; j++)
				if (check(j))
				{
					cnt = 0;
					for (int k = 0; k < n; k++)
						if (t[k] != val[a[k][i]])cnt++;
					for(int k=0;k<prm[n];k++)
						if(check(j,k))
							dp[i][j] = min(dp[i][j], dp[i - 1][k] + cnt);		
				}
	}
	int ans = 0x3f3f3f3f;
	for (int i = 0; i < prm[n]; i++)
		ans = min(ans, dp[m-1][i]);
	cout << ans;
}
int main()
{	
	solve();
	return 0;
}

 有问题欢迎评论区留言，感谢点赞收藏