cf1263(div2)

A

#include <bits/stdc++.h>
using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << endl
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
int nxt()
{
	int ret;
	scanf("%d", &ret);
	return ret;
}
const int maxn = 2e5 + 10;
signed main()
{
	int n = nxt();
	while (n--)
	{
		vector<ll> a(3);
		cin >> a[0] >> a[1] >> a[2];
		sort(all(a));
		int add = a[2] - a[1];
		int ans =0;
		if(a[0] >= add){
			a[0] -= add;
			ans = max(a[1], a[2]) + a[0]/2;
		}else ans = min(a[1], a[2]) + a[0];

		cout << ans << endl;
	}
}

B

(有问题)

#include <bits/stdc++.h>
using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << endl
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
int nxt()
{
	int ret;
	scanf("%d", &ret);
	return ret;
}
const int maxn = 2e5 + 10;
signed main()
{
	int t = nxt();
	while (t--)
	{
		int n = nxt();
		map<string, int> mat;
		vector<string> a(n), list;
		queue<string> q;
		int ans = 0;
		_for(i, 0, n)
		{
			cin >> a[i];
			if (!mat[a[i]])
			{
				mat[a[i]]++, list.push_back(a[i]);
			}
			else {
				string cur = a[i];
				_for(pos, 0, 4)
				{
					for (char ch = '0'; ch <= '9'; ch++)
					{
						if (cur[pos] != ch)
						{
							string tmp = cur;
							tmp[pos] = ch;
							if (!mat[tmp]) {
								mat[tmp]++;
								list.push_back(tmp);
								ans++;
								goto gate1;
							}
						}
					}
				}
			gate1:
				continue;
			}
		}
		cout << ans << endl;
		for (auto i : list) {
			cout << i << endl;
		}

	}






}

C

#include <bits/stdc++.h>
using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << endl
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
int nxt()
{
	int ret;
	scanf("%d", &ret);
	return ret;
}
const int maxn = 2e5 + 10;
signed main()
{
	int t = nxt();
	while (t--)
	{
		ll n = nxt();
		stack<int> q;
		for (int l = 1, r; l <= n; l = r + 1) {
			if(n/l!=0)r = min(n, n / (n / l));
			q.push(n / l);
		}
		cout << q.size() +1 << endl;
		cout << 0 << " ";
		while (!q.empty()) {
			cout << q.top() << " ";
			q.pop();
		}
		cout << endl;
		

	}






}

D

#include <bits/stdc++.h>

using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << endl
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
int nxt()
{
	int ret;
	scanf("%d", &ret);
	return ret;
}
const int maxn = 2e5 + 10;
int parent[maxn];
int find(int a) {
	return a == parent[a] ? a : parent[a] = find(parent[a]);
}
void merge(int a, int b) {
	parent[find(a)] = find(b);
}
int num[27];
signed main()
{
	int n = nxt();
	_rep(i, 1, n)parent[i] = i;
	_rep(i, 1, n) {
		string tmp;
		cin >> tmp;
		for (auto it : tmp) {
			if (num[it - 'a']) {
				merge(num[it - 'a'], i);
			}
			num[it - 'a'] = i;
		}
	}
	int ans = 0;
	_rep(i, 1, n) {
		if (i == parent[i])ans++;
	}
	cout << ans << endl;
}

E

F