T1
状压 \(dp\)，两两之间有相同的位，那一位就为 \(1\)，否则就为 \(0\)，考虑哪些选法不合法，要在 \(0\) 的位上为 \(1\)，即只在 \(1\) 上选和不选都是不可以的，于是状压 \(dp\) 即可。
#include<iostream>
#define int long long
using namespace std;
inline int read(){register int x = 0, f = 1;register char c = getchar();while (c < '0' || c > '9'){if (c == '-') f = -1;c = getchar();}while (c >= '0' && c <= '9'){x = (x << 1) + (x << 3) + (c ^ 48);c = getchar();}return x * f;}
const int N = 3e3 + 10, M = 25;
int n, m, ans = 0x7fffffff;
char c[N][M];
bool flag[(1 << M)];
int sum[M];
void solve(){
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++){
int p = 0;
for (int k = 0; k < m; k++)
if (c[i][k] == c[j][k]) p |= (1 << k);
flag[p] = 1;
}
for (int i = (1 << m) - 1; i >= 0; i--){
if (flag[i])
for (int j = 0; j < m; j++)
if (i & (1 << j)) flag[i ^ (1 << j)] = 1;
int res = 0;
if (!flag[i]){
for (int j = 0; j < m; j++)
if (i & (1 << j)) res++;
if (res <= ans) ans = res, sum[ans]++;
}
}
cout << ans << ' ' << sum[ans] << '\n';
}
signed main(){
freopen("guess.in", "r", stdin);
freopen("guess.out", "w", stdout);
n = read(), m = read();
for (int i = 1; i <= n; i++) cin >> c[i];
solve();
return 0;
}
T2
找性质，发现一个连通块，即包括有顺序的 X，Y，D，只会全部是竖的，要么全部是横的。
直接维护连通块的横与竖的权值即可。
#include<iostream>
using namespace std;
inline int read(){register int x = 0, f = 1;register char c = getchar();while (c < '0' || c > '9'){if (c == '-') f = -1;c = getchar();}while (c >= '0' && c <= '9'){x = (x << 1) + (x << 3) + (c ^ 48);c = getchar();}return x * f;}
const int N = 3e3 + 10;
int n, ans;
char a[N][N];
int turn(int x, int y){
return (x - 1) * n + y;
}
int fa[N * N];
int find(int x){
return (x == fa[x] ? fa[x] : fa[x] = find(fa[x]));
}
int x[N * N], y[N * N];
void merge(int a, int b){
int fx = find(a), fy = find(b);
if (fx == fy) return;
fa[fy] = fx;
x[fx] += x[fy];
y[fx] += y[fy];
}
int main(){
freopen("match.in", "r", stdin);
freopen("match.out", "w", stdout);
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) cin >> a[i][j];
for (int i = 1; i <= n * n; i++) fa[i] = i;
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
if (a[i][j] == 'X'){
if (a[i + 1][j] == 'Y' && a[i + 2][j] == 'D'){
merge(turn(i, j), turn(i + 1, j));
merge(turn(i, j), turn(i + 2, j));
y[find(turn(i, j))]++;
}
if (a[i][j + 1] == 'Y' && a[i][j + 2] == 'D'){
merge(turn(i, j), turn(i, j + 1));
merge(turn(i, j), turn(i, j + 2));
x[find(turn(i, j))]++;
}
}
}
}
for (int i = 1; i <= n * n; i++)
if (fa[i] == i) ans += max(x[i], y[i]);
cout << ans;
return 0;
}
T3
发现每个人要从时间最少的饮水机那里接水才最优，每次将一个人加入接水时间的饮水机处，由于一个人加入后，这个饮水机的时间一定会比其它所有饮水机的等待时间长，那么直接从 \(1\) 到 \(n\) 加入人，对于同样时间的人线段树优化贪心即可。
#include<iostream>
#include<algorithm>
#define ls now << 1
#define rs now << 1 | 1
#define int long long
using namespace std;
inline int read(){register int x = 0, f = 1;register char c = getchar();while (c < '0' || c > '9'){if (c == '-') f = -1;c = getchar();}while (c >= '0' && c <= '9'){x = (x << 1) + (x << 3) + (c ^ 48);c = getchar();}return x * f;}
const int N = 3e5 + 10, M = 1e6 + 10, mod = 1e9 + 7;
int n, m, ans;
struct node{
int a, t;
bool operator < (const node &b) const{
return t < b.t;
}
}p[N];
struct tree{
int sum, tag, l, r;
}t[M << 2];
void pushup(int now){
t[now].sum = (t[ls].sum + t[rs].sum) % mod;
}
void pushdown(int now){
int l = t[now].l, r = t[now].r, mid = (l + r) >> 1;
t[ls].sum = (t[ls].sum + t[now].tag * (mid - l + 1) % mod) % mod;
t[rs].sum = (t[rs].sum + t[now].tag * (r - mid) % mod) % mod;
t[ls].tag = (t[ls].tag + t[now].tag) % mod;
t[rs].tag = (t[rs].tag + t[now].tag) % mod;
t[now].tag = 0;
}
void build(int now, int l, int r){
t[now] = (tree){0, 0, l, r};
if (l == r) return;
int mid = (l + r) >> 1;
build(ls, l, mid);
build(rs, mid + 1, r);
pushup(now);
}
void modify(int now, int x, int y, int k){
int l = t[now].l, r = t[now].r;
if (x <= l && r <= y){
t[now].sum = (t[now].sum + (r - l + 1) * k % mod) % mod;
t[now].tag = (t[now].tag + k) % mod;
return;
}
pushdown(now);
int mid = (l + r) >> 1;
if (x <= mid) modify(ls, x, y, k);
if (mid + 1 <= y) modify(rs, x, y, k);
pushup(now);
}
int query(int now, int x, int y){
int l = t[now].l, r = t[now].r;
if (x <= l && r <= y){
return t[now].sum;
}
pushdown(now);
int mid = (l + r) >> 1, res = 0;
if (x <= mid) res = (res + query(ls, x, y)) % mod;
if (mid + 1 <= y) res = (res + query(rs, x, y)) % mod;
return res;
}
int work1(int &pos, int k, int t){
int l = min(m - pos + 1, k);
ans = (ans + query(1, pos, pos + l - 1)) % mod;
modify(1, pos, pos + l - 1, t % mod);
pos = ((pos + l) % m == 0 ? m : (pos + l) % m);
return l;
}
void work2(int turn, int t){
ans = (ans + query(1, 1, m) * turn % mod) % mod;
ans = (ans + ((turn - 1) * turn / 2) % mod * t % mod * m % mod) % mod;
modify(1, 1, m, turn * t % mod);
}
void work3(int &pos, int more, int t){
ans = (ans + query(1, 1, more)) % mod;
modify(1, 1, more, t % mod);
pos = more + 1;
}
signed main(){
freopen("water.in", "r", stdin);
freopen("water.out", "w", stdout);
n = read(), m = read();
for (int i = 1; i <= n; i++) p[i].a = read(), p[i].t = read();
sort(p + 1, p + n + 1);
build(1, 1, m);
int pos = 1;
for (int i = 1; i <= n; i++){
int k = p[i].a, t = p[i].t;
k -= work1(pos, k, t);
if (pos != 1) continue;
int turn = k / m, more = k % m;
if (turn) work2(turn, t);
if (more) work3(pos, more, t);
}
cout << ans;
return 0;
}
T4
不会。
标签：rs,int,tag,共同体,20241028noip,ls,OIFC,now,mod From： https://www.cnblogs.com/bryceyyds/p/18521241