T1
题目大意:
现在给你 p 个长度小于等于 k 的轮换,他们表示的是长度为 n 的置换,
求他们的乘积的置换
简单分析:
废话不多,直接模拟
标算:
#include<cstdio>
const int N = 1000 + 10;
int n, m, k, x, b[N], p[N][N];
int main() {
scanf("%d%d%d", &n, &m, &k);
for(int i = 1; i <= m; ++i) {
scanf("%d", &x);
for(int j = 1; j <= x; ++j) {
scanf("%d", &b[j]);
}
for(int j = 1; j <= n; ++j) p[i][j] = j;
for(int j = 1; j < x; ++j) p[i][b[j]] = b[j+1];
p[i][b[x]] = b[1];
}
for(int i = 1; i <= n; ++i) {
x = i;
for(int j = m; j >= 1; --j) x = p[j][x];
printf("%d ", x);
}
return 0;
}
T2
题目大意:
给出长度为n的序列S, 以及四个数a, b, c, d, 询问满足a<=(Sl ans Sl+1 and … and Sr) <= b 且 c <= (Sl or Sl+1 or … or Sr) <= d的区间有多少个
简单分析:
容易发现,随着and的数越来越多,最终and的结果一定不上升
同理,or的数越多,最终or的结果一定不下降
具有单调性,不禁让人想到二分答案,可是如何判断?
标算:
可以用ST表查询一个区间内的and值,or值
枚举区间左端点,统计右端点数量
利用ST表跳过连续区间
#include<cstdio>
#include<cmath>
typedef long long ll;
const int N = 1e5 + 10;
const ll mod = 1e9+7;
int n, a, b, c, d, s[N];
int sta[N][20], sto[N][20];
ll cnt;
void st_pre() {
for(int j = 1; j < 20; ++j)
for(int i = 1; i <= n; ++i)
if(i+(1<<j)-1 <= n) {
sta[i][j] = sta[i][j-1] & sta[i+(1<<(j-1))][j-1];
sto[i][j] = sto[i][j-1] | sto[i+(1<<(j-1))][j-1];
}
}
int ask_and(int l, int r) {
int k = log2(r-l+1);
return sta[l][k] & sta[r-(1<<k)+1][k];
}
int ask_or(int l, int r) {
int k = log2(r-l+1);
return sto[l][k] | sto[r-(1<<k)+1][k];
}
int main() {
scanf("%d%d%d%d%d", &n, &a, &b, &c, &d);
for(int i = 1; i <= n; ++i) {
scanf("%d", &s[i]);
sta[i][0] = sto[i][0] = s[i];
}
st_pre();
for(int i = 1; i <= n; ++i) {
int and_sum = s[i], or_sum = s[i];
for(int j = i; j <= n; ++j) { //枚举左端点
int l = j, r = n+1, mid;
and_sum = ask_and(i, j);
or_sum = ask_or(i, j);
while(l+1 < r) { //二分过程
mid = (l+r)>>1;
if(ask_and(i, mid) == and_sum
&& ask_or(i, mid) == or_sum) l = mid;
else r = mid;
}
if(a <= and_sum && and_sum <= b
&& c <= or_sum && or_sum <= d) cnt = (cnt+l-j+1)%mod;
j = l;
}
}
printf("%d\n", cnt%mod);
return 0;
}
//可发现or, and的单调性, 一个单增一个单减
//采用st表来查询一段区间的and, or值
//枚举左端点, 统计右端点
//利用st表跳连续区间
T3
不可做的题目大意:
在一棵树上,捡到k个果子的情况共多少种
用命分析:
树上背包
咋都看不懂的标算:
DFS时将父节点状态传下去,减少一维合并复杂度
#include<cstdio>
typedef long long ll;
const int N = 1000 +10;
const ll mod = 1e9 + 7;
int n, k, a[N], en, x, y;
ll dp[N][N], pw2[N];
struct edge {
int e; edge* nxt;
}*v[N], ed[N*2];
void add_edge(int s, int e) {
ed[++en].nxt = v[s];
v[s] = ed+en; ed[en].e = e;
}
void pre() {
pw2[0] = 1;
for(int i = 1; i <= n; ++i) pw2[i] = (pw2[i-1]<<1)%mod;
}
int dfs(int x, int fa) {
int siz = 1;
for(edge* e = v[x]; e; e = e->nxt) {
if(fa == e->e) continue;
for(int j = 0; j <= (n-a[e->e]); ++j)
dp[e->e][j+a[e->e]] = dp[x][j];
int tmp = dfs(e->e, x);
for(int j = 0; j <= n; ++j)
dp[x][j] = (pw2[tmp-1]*dp[x][j]%mod + dp[e->e][j])%mod;
siz += tmp;
}
return siz;
}
int main() {
scanf("%d%d", &n, &k);
pre();
for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for(int i = 1; i < n; ++i) {
scanf("%d%d", &x, &y);
add_edge(x, y); add_edge(y, x);
}
dp[1][a[1]] = 1;
dfs(1, 0);
printf("%d\n", (int)dp[1][k]);
return 0;
}
//背包?
//f[i][j] 表示i号节点在子树中拿j个果子的方案数。
//O(n^3)?
//DFS 时可以直接把父节点状态传下去,减少一维合并复杂度。
//O(n^2)