P14192 [ICPC 2024 Hangzhou R] Fuzzy Ranking
个人记录第二十六篇。
正解调了 inf 年终于调出来了。我该练练码力了。
Solution
注意到“优越于”这个条件是有传递性的,于是容易想到图论建模。具体的,对于这 \(k\) 个排列,我们让前一个数连一条有向边到后一个数,来表示优越关系。这样建完图,两所大学 \(x\) 和 \(y\) 组成模糊对当且仅当 \(x\) 能够走到 \(y\) 并且 \(y\) 能够走到 \(x\),也就是 \(x\) 和 \(y\) 处在同一个强连通分量里。
那么实际上我们就可以对整张图进行缩点,在同一个强连通分量内部的点看作颜色相同。那么同一颜色的点都可以两两配成模糊对,最终答案就是区间内每种颜色个数 \(c\) 里选 \(2\) 个的方案数之和,即 \(\sum\frac{c(c-1)}{2}\)。这是经典问题,可以莫队或分块做。因为本题强制在线,所以用分块,维护每一块内每种颜色出现次数并进行前缀和,然后预处理出两块之间的答案即可。
然后因为数据范围是 \(n\times k\le2\times10^5\),所以用 vector 存所有数据即可,不然就爆了。
时间复杂度 \(O(nk\sqrt n)\)。可能需要注意常数问题。
Code
int n, k, Q, t;
vector <int> g[N];
int dfn[N], low[N], tmp, stk[N], top;
bool in_stk[N];
int scc, id[N];
int l[B], r[B], pos[N];
map <pair <int, int>, int> mp;
void Tarjan (int u) {
dfn[u] = low[u] = ++ tmp;
stk[++ top] = u;
in_stk[u] = true;
for (int v : g[u]) {
if (!dfn[v]) {
Tarjan (v);
low[u] = min (low[u], low[v]);
} else if(in_stk[v]) low[u] = min (low[u], dfn[v]);
}
if (dfn[u] == low[u]) {
++ scc;
int cur;
do {
cur = stk[top --];
in_stk[cur] = false;
id[cur] = scc;
}while (cur != u);
}
}
struct Block {
vector <vector <i64>> res;
vector <vector <int>> cnt;
vector <int> a;
vector <int> tmp;
inline void init (const vector <int>& _a) {
a = _a;
res.resize(t + 1);
cnt.resize(t + 1);
cnt[0].resize(scc + 1);
for (int i = 1; i <= t; ++ i) {
res[i].resize(t + 1);
cnt[i].resize(scc + 1);
cnt[i] = cnt[i - 1];
for (int j = l[i]; j <= r[i]; ++ j) {
++ cnt[i][id[a[j]]];
}
}
tmp.resize(scc + 1, 0);
for (int i = 1; i <= t; ++ i) {
i64 ans = 0;
for (int j = i; j <= t; ++ j) {
for (int p = l[j]; p <= r[j]; ++ p) {
ans += tmp[id[a[p]]];
++ tmp[id[a[p]]];
}
res[i][j] = ans;
}
for (int p = l[i]; p <= n; ++ p) -- tmp[id[a[p]]];
}
}
inline i64 query (int ll, int rr) {
int p = pos[ll], q = pos[rr];
i64 ans = 0;
tmp.resize(scc + 1, 0);
if (p == q) {
for (int i = ll; i <= rr; ++ i) {
ans += tmp[id[a[i]]];
++ tmp[id[a[i]]];
}
for (int i = ll; i <= rr; ++ i) -- tmp[id[a[i]]];
return ans;
}
ans = res[p + 1][q - 1];
for (int i = ll; i <= r[p]; ++ i) {
ans += tmp[id[a[i]]] + cnt[q - 1][id[a[i]]] - cnt[p][id[a[i]]];
++ tmp[id[a[i]]];
}
for (int i = l[q]; i <= rr; ++ i) {
ans += tmp[id[a[i]]] + cnt[q - 1][id[a[i]]] - cnt[p][id[a[i]]];
++ tmp[id[a[i]]];
}
for (int i = ll; i <= r[p]; ++ i) -- tmp[id[a[i]]];
for (int i = l[q]; i <= rr; ++ i) -- tmp[id[a[i]]];
return ans;
}
};
vector <Block> b;
inline void solve () {
mp.clear();
tmp = scc = 0;
top = 0;
cin >> n >> k >> Q;
for (int i = 0; i <= n + 10; ++ i) {
dfn[i] = low[i] = stk[i] = id[i] = 0;
g[i].clear ();
in_stk[i] = false;
}
t = sqrt (n);
for (int i = 1; i <= t; ++ i) {
l[i] = r[i - 1] + 1;
r[i] = i * t;
}
r[t] = n;
for (int i = 1; i <= t; ++ i) {
for (int j = l[i]; j <= r[i]; ++ j) {
pos[j] = i;
}
}
b.resize(k + 1);
vector <vector <int>> a(k + 10, vector<int>(n + 10, 0));
for (int i = 1; i <= k; ++ i) {
for (int j = 1; j <= n; ++ j) {
cin >> a[i][j];
if (j > 1) {
if (mp.count({a[i][j - 1], a[i][j]})) continue;
else g[a[i][j - 1]].eb(a[i][j]), mp[{a[i][j - 1], a[i][j]}] = 1;
}
}
}
for (int i = 1; i <= n; ++ i) if (!dfn[i]) Tarjan (i);
for (int i = 1; i <= k; ++ i) b[i].init(a[i]);
i64 lst = 0;
while (Q --) {
int id, l, r;
cin >> id >> l >> r;
id = (id + lst) % k + 1;
l = (l + lst) % n + 1;
r = (r + lst) % n + 1;
if(l > r) swap (l, r);
lst = b[id].query(l, r);
cout << lst << endl;
}
}
int main () {
int T_T;
cin >> T_T;
while (T_T --) solve ();
return 0;
}

浙公网安备 33010602011771号