csust-8.6早训CF之700-2000分

 

目录

 

A - Anatoly and Cockroaches

B - Efim and Strange Grade

C - One-dimensional Japanese Crossword

D - Passwords

E - Journey

F - Maxim and Array

---

A - Anatoly and Cockroaches

 CodeForces - 719B 

题目链接https://codeforces.com/problemset/problem/719/B

#include <bits/stdc++.h>
using namespace std;
const int mac = 1e5 + 10;
char s[mac], s1[mac], s2[mac], ss[mac];
char ch[] = { 'r','b' };
int v1[20], v2[20];
int main()
{
	int n;
	scanf("%d", &n);
	scanf("%s", s);
	int len = strlen(s);
	s1[0] = 'r'; s2[0] = 'b';
	for (int i = 1; i < n; i++) {
		s1[i] = (s1[i - 1] == 'b') ? 'r' : 'b';
		s2[i] = (s2[i - 1] == 'b') ? 'r' : 'b';
	}
	for (int i = 0; i < len; i++) {
		if (s[i] != s1[i]) {
			if (s[i] == 'r') v1[0]++;
			else v1[1]++;
		}
		if (s[i] != s2[i]) {
			if (s[i] == 'r') v2[0]++;
			else v2[1]++;
		}
	}
	int sum = 0, ans;
	sum = min(v1[0], v1[1]);
	v1[0] -= sum; v1[1] -= sum;
	sum += v1[0] + v1[1];
	ans = sum;
	sum = min(v2[0], v2[1]);
	v2[0] -= sum; v2[1] -= sum;
	sum += v2[0] + v2[1];
	ans = min(ans, sum);
	printf("%d\n", ans);
	return 0;
}

B - Efim and Strange Grade

 CodeForces - 719C 

题目链接https://codeforces.com/problemset/problem/719/C

#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false)
const int mac = 2e5 + 10;
char s[mac], s1[mac], s2[mac], ss[mac];
char ch[] = { 'r','b' };
int v1[20], v2[20];
int main()
{
	IOS;
	int n, m, ms = 1;
	cin >> n >> m;
	cin >> s + 1;
	s[0] = '0';
	for (int i = 1; i <= n; i++) {
		if (s[i] == '.') { ms = i; break; }
	}
	for (int i = ms; i <= n; i++) {
		if (!m) break;
		if (s[i] != '.' && s[i] >= '5' && m) {
			s[i] = '0'; m--; s[i - 1]++;
			int j=i-1;
			while (m && s[j] >= '5' && j) {
				if (s[j] == '/') {
					s[j] = '.'; s[--j]++; continue;
				}
				if (s[j] > '9') {
					s[j] = 0;
					s[--j]++;
					continue;
				}
				m--, s[j] = '0';
				s[--j]++;
			}
			ms = i; break;
		}
		ms = i;
	}
	int i = ms;
	while (s[i] == '0') i--;
	if (s[i] == '.') i--;
	if (s[i] == '/') {
		s[i] = '.', s[i - 1]++; i--;
		int j = i;
		while (s[j] > '9') s[j] = '0' , s[--j]++;
	}
	int j = 0;
	if (s[0]=='0') j = 1;
	for (; j <= i; j++)
		cout << s[j];
	cout << endl;
	return 0;
}

C - One-dimensional Japanese Crossword

 CodeForces - 721A 

题目链接https://codeforces.com/problemset/problem/721/A

#include <bits/stdc++.h>
using namespace std;
const int mac = 1e5 + 10;
char s[mac], s1[mac], s2[mac], ss[mac];
char ch[] = { 'r','b' };
int bl[mac];
int main()
{
	int n;
	scanf("%d", &n);
	scanf("%s", s);
	int len = strlen(s);
	int nb = 1;
	for (int i = 0; i < len; i++) {
		int mm = 0;
		while (s[i] == 'B') {
			bl[nb]++;
			mm = 1; i++;
		}
		if (mm) nb++;
	}
	printf("%d\n", nb-1);
	for (int i = 1; i < nb-1; i++)
		printf("%d ", bl[i]);
	if (nb-1>=1) printf("%d\n", bl[nb - 1]);
	return 0;
}

D - Passwords

 CodeForces - 721B 

题目链接https://codeforces.com/problemset/problem/721/B

#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false)
const int mac = 1e5 + 10;
const int inf = 1e9 + 10;
string s[200], rt;
bool cmp(string t,string r)
{
	int len = t.size(), len2 = r.size();
	return len < len2;
}
int main()
{
	IOS;
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> s[i];
	}
	cin >> rt;
	sort(s + 1, s + 1 + n,cmp);
	int len = rt.size();
	int mi = 0, mark = 0;
	for (int i = 1; i <= n; i++) {
		mi++;
		int lln = s[i].size();
		if (lln == len && !mark) {
			printf("%d ", mi);// break;
			mark = 1;
		}
		int lt = s[i + 1].size();
		if (lt > len) break;
		if (i % m == 0 && i!=n) mi += 5;
	}
	printf("%d\n", mi);
	return 0;
}

E - Journey

 CodeForces - 721C 

题目链接https://codeforces.com/problemset/problem/721/C

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define IOS ios::sync_with_stdio(false)
const int mac = 5e3 + 10;
const ll inf = 1e18 + 10;
struct node
{
	int id, w;
	node(){}
	node(int x,int y):id(x),w(y){}
};
vector<node>g[mac];
int in[mac], per[mac][mac], vis[mac];
int dp[mac][mac], ans[mac];
int main()
{
	IOS;
	int n, m, tot;
	int u, v, w;
	memset(dp, 0x3f, sizeof(dp));
	cin >> n >> m >> tot;
	for (int i = 1; i <= m; i++) {
		cin >> u >> v >> w;
		in[v]++; 
		g[u].push_back(node(v,w));
	}
	for (int i = 1; i <= n; i++)
		if (in[i] == 0 && i != 1) {
			for (int j = 0; j < g[i].size(); j++) {
				int v = g[i][j].id;
				in[v]--;
			}
		}
	dp[1][1] = 0;
	queue<int>q;
	q.push(1);
	while (!q.empty()) {
		int s = q.front();
		q.pop();
		for (int i = 0; i < g[s].size(); i++) {
			int v = g[s][i].id, w = g[s][i].w;
			in[v]--;
			if (in[v] == 0) q.push(v);
			for (int j = 2; j <= n; j++) {
				if (dp[s][j - 1] + w < dp[v][j]) {
					dp[v][j] = dp[s][j - 1] + w;
					per[v][j] = s;
				}
			}
		}
	}
	int nb = 0;
	for (int i = n; i >= 1; i--) {
		if (dp[n][i] <= tot) {
			nb = i; break;
		}
	}
	cout << nb << endl;
	ans[nb] = n;
	for (int i = n, j = nb; j > 1; i = per[i][j], j--) {
		ans[j - 1] = per[i][j];
	}
	for (int i = 1; i <= nb; i++)
		cout << ans[i] << " ";
	return 0;
}

F - Maxim and Array

 CodeForces - 721D 

题目链接https://codeforces.com/problemset/problem/721/D

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define IOS ios::sync_with_stdio(false)
const int mac = 2e5 + 10;
const ll inf = 1e18 + 10;
struct node
{
	ll w;
	int x;
	bool operator <(const node& a)const {
		return abs(w) > abs(a.w);
	}
};
bool cmp(node a, node b)
{
	return abs(a.w) < abs(b.w);
}
node a[mac];
ll ans[mac];
priority_queue<node>q;
int main()
{
	IOS;
	int n, k, x;
	cin >> n >> k >> x;
	int f = 0;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].w;
		a[i].x = i;
		if (a[i].w < 0) f ^= 1;
	}
	if (!f) {
		sort(a + 1, a + 1 + n, cmp);
		node& p = a[1];
		if (!p.w) --k, p.w -= x;
		else {
			int mark = (p.w < 0) ? -1 : 1;
			while (k) {
				p.w -= (p.w < 0) ? -x : x; k--;
				int f = (p.w < 0) ? -1 : 1;
				if (mark!=f) break;
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		q.push(a[i]);
	}
	while (k) {
		node p = q.top();
		q.pop();
		p.w += (p.w < 0) ? -x : x;
		q.push(p); k--;
	}
	while (!q.empty()) ans[q.top().x] = q.top().w, q.pop();
	for (int i = 1; i <= n; i++) cout << ans[i] << " ";
	return 0;
}