Educational Codeforces Round 140 (Rated for Div. 2)

C.

题意:s是一个长度n的01串,给定n个数组a[1~n],第i个数组分别是a[i][i~n],a[i,j]=1表示s[i,j]只有0或者只有1;a[i,j]=2表示s[i,j]01都有;a[i,j]=0没有限制.求s的方案数.

考虑dp,正着做难,反过来做.设f[i][j]表示满足第i~n个数组的条件,并且距离满足i~j字符相同的最大的j.(if a[i + 1] == 2) f[i][i]=∑f[i+1][j](j >= i + 1), if (j <= first_two && j >= last_one) f[i][j] = f[i + 1][j];

#include <bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false), cin.tie(0) 
#define ll long long 
// #define double long double
#define ull unsigned long long 
#define PII pair<int, int> 
#define PDI pair<double, int> 
#define PDD pair<double, double> 
#define debug(a) cout << #a << " = " << a << endl 
#define point(n) cout << fixed << setprecision(n)
#define all(x) (x).begin(), (x).end() 
#define mem(x, y) memset((x), (y), sizeof(x)) 
#define lbt(x) (x & (-x)) 
#define SZ(x) ((x).size()) 
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
namespace nqio{const unsigned R = 4e5, W = 4e5; char *a, *b, i[R], o[W], *c = o, *d = o + W, h[40], *p = h, y; bool s; struct q{void r(char &x){x = a == b && (b = (a = i) + fread(i, 1, R, stdin), a == b) ? -1 : *a++;} void f(){fwrite(o, 1, c - o, stdout); c = o;} ~q(){f();}void w(char x){*c = x;if (++c == d) f();} q &operator >>(char &x){do r(x);while (x <= 32); return *this;} q &operator >>(char *x){do r(*x); while (*x <= 32); while (*x > 32) r(*++x); *x = 0; return *this;} template<typename t> q&operator>>(t &x){for (r(y),s = 0; !isdigit(y); r(y)) s |= y == 45;if (s) for (x = 0; isdigit(y); r(y)) x = x * 10 - (y ^ 48); else for (x = 0; isdigit(y); r(y)) x = x * 10 + (y ^ 48); return *this;} q &operator <<(char x){w(x);return *this;}q &operator<< (char *x){while (*x) w(*x++); return *this;}q &operator <<(const char *x){while (*x) w(*x++); return *this;}template<typename t> q &operator<< (t x) {if (!x) w(48); else if (x < 0) for (w(45); x; x /= 10) *p++ = 48 | -(x % 10); else for (; x; x /= 10) *p++ = 48 | x % 10; while (p != h) w(*--p);return *this;}}qio; }using nqio::qio;
using namespace std;
const int N = 110, MOD = 998244353;
int n, a[N][N], first_two[N], last_one[N], f[N][N];
signed main() {
	IOS;
	cin >> n;
	bool ok = 1;
	for (int i = 1; i <= n; ++i) {
		for (int j = i; j <= n; ++j) {
			cin >> a[i][j];
		}
		first_two[i] = n + 1, last_one[i] = i;
		for (int j = i; j <= n; ++j) {
			if (a[i][j] == 1) {
				last_one[i] = j;
			}
		}
		for (int j = n; j >= i; --j) {
			if (a[i][j] == 2) {
				first_two[i] = j;
			}
		}
		if (last_one[i] >= first_two[i] || a[i][i] == 2) {
			ok = 0;
		}
	}
	first_two[0] = n + 1;
	if (!ok || a[n][n] == 2) {
		cout << 0 << "\n";
		return 0;
	}
	f[n][n] = 2;
	for (int i = n - 1; i >= 0; --i) {
		if (last_one[i] == i) {
			for (int j = i + 1; j <= n; ++j) {
				(f[i][i] += f[i + 1][j]) %= MOD;
			}
			++last_one[i];
		}
		for (int j = last_one[i]; j <= first_two[i] - 1; ++j) {
			if (j > i) {
				f[i][j] = f[i + 1][j];
			}
		}
	}
	cout << f[0][0] << "\n";
}

E.

 题意:坐标轴上有n个点,每个点有颜色c[i],共m种颜色,初始时所有颜色没解锁.起点在1,能到达i+1,i+2,只有解锁了该点的颜色才可以到这个点,解锁每个颜色的代价是x[i],求从1到n最小的代价.

显然,相邻两个点必须至少解锁一个,起点和终点必须解锁.起点终点颜色连自环,相邻两格颜色连边,问题转化为求一般图的最小权覆盖.

这是个np-hard问题,只能用搜索,大体思路就是枚举每个点选或者不选,看一下是否存在一条边两个点都不选.但是40个点搜起来时间会爆,采用双向搜索.先预处理出前20个点所有合法方案的最小代价,再枚举另一半的点即可.

#include <bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false), cin.tie(0) 
#define ll long long 
// #define double long double
#define ull unsigned long long 
#define PII pair<int, int> 
#define PDI pair<double, int> 
#define PDD pair<double, double> 
#define debug(a) cout << #a << " = " << a << endl 
#define point(n) cout << fixed << setprecision(n)
#define all(x) (x).begin(), (x).end() 
#define mem(x, y) memset((x), (y), sizeof(x)) 
#define lbt(x) (x & (-x)) 
#define SZ(x) ((x).size()) 
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
namespace nqio{const unsigned R = 4e5, W = 4e5; char *a, *b, i[R], o[W], *c = o, *d = o + W, h[40], *p = h, y; bool s; struct q{void r(char &x){x = a == b && (b = (a = i) + fread(i, 1, R, stdin), a == b) ? -1 : *a++;} void f(){fwrite(o, 1, c - o, stdout); c = o;} ~q(){f();}void w(char x){*c = x;if (++c == d) f();} q &operator >>(char &x){do r(x);while (x <= 32); return *this;} q &operator >>(char *x){do r(*x); while (*x <= 32); while (*x > 32) r(*++x); *x = 0; return *this;} template<typename t> q&operator>>(t &x){for (r(y),s = 0; !isdigit(y); r(y)) s |= y == 45;if (s) for (x = 0; isdigit(y); r(y)) x = x * 10 - (y ^ 48); else for (x = 0; isdigit(y); r(y)) x = x * 10 + (y ^ 48); return *this;} q &operator <<(char x){w(x);return *this;}q &operator<< (char *x){while (*x) w(*x++); return *this;}q &operator <<(const char *x){while (*x) w(*x++); return *this;}template<typename t> q &operator<< (t x) {if (!x) w(48); else if (x < 0) for (w(45); x; x /= 10) *p++ = 48 | -(x % 10); else for (; x; x /= 10) *p++ = 48 | x % 10; while (p != h) w(*--p);return *this;}}qio; }using nqio::qio;
using namespace std;
const int N = 1e6 + 10, M = (1ll << 21) + 1;
int n, m, c[N], cost[N], to[N], val[M], m1, ans = INF;
void dfs1(int now, int unselected, int s) {
	if (now == m1) {
		val[((1ll << m1) - 1) ^ unselected] = s;
		return;
	}
	if (!(to[now] & (unselected | (1ll << now)))) {
		dfs1(now + 1, unselected | (1ll << now), s);
	}
	dfs1(now + 1, unselected, s + cost[now]);
}
void dfs2(int now, int unselected, int s, int need) {
	if (now == m) {
		ans = min(ans, s + val[need]);
		return;
	}
  	if (!((to[now] >> m1) & (unselected | (1ll << (now - m1))))) {
  		dfs2(now + 1, unselected | (1ll << (now - m1)), s, need | to[now] & ((1ll << m1) - 1));
  	}
  	dfs2(now + 1, unselected, s + cost[now], need);
}
signed main() {
	IOS;
	cin >> n >> m;
	for (int i = 0; i < n; ++i) {
		cin >> c[i];
		--c[i];
	}
	for (int i = 0; i < m; ++i) {
		cin >> cost[i];
	}
	to[c[0]] |= (1ll << c[0]);
	to[c[n - 1]] |= (1ll << c[n - 1]);
	for (int i = 0; i < n - 1; ++i) {
		to[c[i]] |= (1ll << c[i + 1]);
		to[c[i + 1]] |= (1ll << c[i]);
	}
	m1 = m / 2;
	for (int i = 0; i < (1ll << m1); ++i) {
		val[i] = INF;
	}
	dfs1(0, 0, 0);
	for (int j = 0; j < m1; ++j) {
		for (int i = 0; i < (1ll << m1); ++i) {
			if (!(i >> j & 1)) {
				val[i] = min(val[i], val[i ^ (1ll << j)]);
			}
		}
	}
	dfs2(m1, 0, 0, 0);
	cout << ans << "\n";
}