Codeforces Round #843 (Div. 2) A-E

题目链接：Dashboard - Codeforces Round #843 (Div. 2) - Codeforces

A2 - Gardener and the Capybaras (hard version)

解题思路：有a弄a，没a就随便弄。

#include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define lson l,mid,rt<<1
#define rson mid+1,r,(rt<<1)|1
typedef long long ll;
const int mx = 2e5 + 10;

int n;
char a[mx];
vector <int> vec;

void solve()
{
	if (vec.size() > 2) {
		printf("%.*s %.*s %.*s\n", vec[1], a, 1, a + vec[1], n - vec[1] - 1, a + vec[1] + 1);
		return ;
	}
	if (vec.size() == 0) {
		printf("%.*s %.*s %.*s\n", 1, a, n-2, a + 1, 1, a + n - 1);
		return ;
	}
	if (vec.size() == 1) {
		if (vec[0] == 0 || vec[0] == n - 1)
			printf("%.*s %.*s %.*s\n", 1, a, n-2, a + 1, 1, a + n - 1);
		else
			printf("%.*s %.*s %.*s\n", vec[0], a, 1, a + vec[0], n - vec[0] - 1, a + vec[0] + 1);
		return;
	}
	if (vec.size() == 2) {
		if (0 < vec[0] && vec[0] < n-1)
			printf("%.*s %.*s %.*s\n", vec[0], a, 1, a + vec[0], n - vec[0] - 1, a + vec[0] + 1);
		else if (0 < vec[1] && vec[1] < n-1)
			printf("%.*s %.*s %.*s\n", vec[1], a, 1, a + vec[1], n - vec[1] - 1, a + vec[1] + 1);
		else
			printf("%.*s %.*s %.*s\n", 1, a, n-2, a + 1, 1, a + n - 1);
	}
}

int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		scanf("%s", a);
		n = strlen(a);
		vec.clear();
		for (int i=0;i<n;i++) {
			if (a[i] == 'a')
				vec.push_back(i);
		}
		solve();
	}
	
	return 0;
}

B - Gardener and the Array

解题思路：枚举每个值然后删掉之后看是否会影响。

#include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define lson l,mid,rt<<1
#define rson mid+1,r,(rt<<1)|1
typedef long long ll;
const int mx = 2e5 + 10;

int n;
vector <int> vec[mx];
int vis[mx];

bool check(int id)
{
	bool flag = 1;
	for (int u: vec[id]) {
		vis[u]--;
		if (vis[u] == 0) {
			flag = 0;
		}
	}
	for (int u: vec[id])
		vis[u]++;
	return flag;
}

void solve()
{
	for (int i=1;i<=n;i++) {
		if (check(i)) {
			puts("YES");
			return ;
		}
	}
	puts("NO");
}

int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		scanf("%d", &n);
		int k, u;
		for (int i=1;i<=n;i++) {
			scanf("%d", &k);
			for (int j=1;j<=k;j++) {
				scanf("%d", &u);
				vec[i].push_back(u);
				vis[u]++;
			}
		}
		solve();
		for (int i=1;i<=n;i++) {
			for (int u: vec[i]) {
				vis[u]--;
			}
			vec[i].clear();
		}
	}
	
	return 0;
}

C - Interesting Sequence

解题思路：枚举每个比特位的情况，n和x的四种情况。从高位往低位枚举，高位的比特位不受低位的影响。

#include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define lson l,mid,rt<<1
#define rson mid+1,r,(rt<<1)|1
typedef long long ll;
const int mx = 2e5 + 10;

ll n, x;
vector <int> vec[mx];
int vis[mx];

ll solve()
{
	ll ma = 1ll << 62, mi = n;
	ll sum = 0;
	for (ll i=62; i>=0; i--) {
		ll id1 = n & (1ll << i);
		ll id2 = x & (1ll << i);
		if (!id1 && !id2)
			continue;
		if (!id1 && id2)
			return -1;
		
		ll temp = sum + (1ll << (i + 1));
		if (id1 && !id2) {
			mi = max(mi, temp);
		}
		if (id1 && id2) {
			ma = min(ma, temp - 1);
		}
		sum += id1;
	}
	if (ma < mi)
		return -1;
	return mi;
}

int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		scanf("%lld%lld", &n, &x);
		printf("%lld\n", solve());
	}
	return 0;
}

D - Friendly Spiders

解题思路：gcd非1的可以建一条边，因为权重都是0，所以直接搞个最小生成树就行。计算边先处理一下素数然后再用素数关联边即可。

#include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define lson l,mid,rt<<1
#define rson mid+1,r,(rt<<1)|1
typedef long long ll;
const int mx = 3e5 + 10;

int n, m, s, t;
bool vis[mx], vis2[mx], vis3[mx];
int a[mx], pre[mx], dis[mx];
vector <int> pri, vec[mx], vec2[mx];

void init()
{
	for (int i=2; i<mx; i++) {
		if (!vis[i]) {
			pri.push_back(i);
		}
		for (int v: pri) {
			if (i * v >= mx)
				break;
			vis[i * v] = 1;
			if (i % v == 0)
				break;
		}
	}
}

void output(int x)
{
	if (x == -1)
		return;
	output(pre[x]);
	printf("%d ", x);
}

int main() {
	init();
	scanf("%d", &n);
	for (int i=1; i<=n; i++) {
		scanf("%d", a+i);
		for (int v: pri) {
			if (v * v > a[i])
				break;
			if (a[i] % v == 0) {
				vec[i].push_back(v);
				vec2[v].push_back(i);
			}
			while (a[i] % v == 0) a[i] /= v;
		}
		if (a[i] != 1) {
			vec[i].push_back(a[i]);
			vec2[a[i]].push_back(i);
		}
		dis[i] = mx;
	}
	scanf("%d%d", &s, &t);
	pre[s] = -1;
	dis[s] = 1;
	queue <int> que;
	que.push(s);
	while (!que.empty()) {
		int x = que.front();
		que.pop();
		if (vis3[x])
			continue;
		vis3[x] = 1;
		for (int v: vec[x]) {
			if (vis2[v])
				continue;
			vis2[v] = 1;
			for (int u: vec2[v]) {
				if (dis[u] > dis[x] + 1) {
					dis[u] = dis[x] + 1;
					pre[u] = x;
					que.push(u);
				}
			}
		}
	}
	if (dis[t] == mx)
		puts("-1");
	else {
		printf("%d\n", dis[t]);
		output(t);
		puts("");
	}
	
	return 0;
}

E - The Human Equation

解题思路：

 

#include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define lson l,mid,rt<<1
#define rson mid+1,r,(rt<<1)|1
typedef long long ll;
const int mx = 3e5 + 10;

ll a[mx];

int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		int n;
		scanf("%d", &n);
		ll mi = 0, ma = 0;
		for (int i=1;i<=n;i++) {
			scanf("%lld", a+i);
			a[i] += a[i-1];
			mi = min(mi, a[i]);
			ma = max(ma, a[i]);
		}
		printf("%lld\n", ma - mi);
	}
	return 0;
}