牛客练习赛80 D.分组 tarjan+倍增+二分

原题链接：https://ac.nowcoder.com/acm/contest/11170/D

题意

有n个点，m条边，你可以对边进行分组，每组内边的编号一定是连续的。设每个图的权值是这个图的强连通分量大小的平方和，且每组的权值不得超过k，问最少可以分成多少组。

分析

因为每组的边编号是连续的，满足单调性所以考虑二分。但如果每次都用二分去确定右边界，时间复杂度是$n^{2}logn$，显然不符合要求。

然后去优化，这里用到倍增的思想，枚举$2^k$条边，如果在$2^{k+1}$条边时不满足，说明可行区间是$[2^k-1,2^{k+1}-1]$,这时对这段区间二分就可以，时间复杂度应该是$mlogm$。

这题细节很多，而且还有些卡常，尽量少用stl容器…

Code

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
//#include <unordered_map>
using namespace std;
#define fi first
#define se second
#define re register
typedef long long ll;
typedef pair<ll, ll> PII;
typedef unsigned long long ull;
const int N = 1e5 + 10, M = 1e6 + 5, INF = 0x3f3f3f3f;
const int MOD = 1e9+7;
vector<int> g[N];
int low[N], dfn[N], idx, vis[N], tp, scc, in_stk[N], vist[N], pw[N];
ll k, sum;
int n, m;
set<int> sc[N];
queue<int> que;
void tarjan(int x) {
    que.push(x);
    low[x] = dfn[x] = ++idx;
    vis[x] = 1;
    in_stk[++tp] = x;
    for (auto v : g[x]) {
        if (!dfn[v]) {
            tarjan(v);
            low[x] = min(low[x], low[v]);
        }
        else if (vis[v]) {
            low[x] = min(low[x], dfn[v]);
        }
    }
    int num = 0;
    if (low[x] == dfn[x]) {
        int y;
        while(y = in_stk[tp--]) {
            vis[y] = 0;
            num++;
            if (x == y) break;
        }
        sum += 1ll*num*num;
    }
}
void init() {
    while (que.size()) {
        int x = que.front();
        que.pop();
        low[x] = dfn[x] = vis[x] = 0;
        g[x].clear();
    }
    scc = sum = tp = idx = 0;
}
struct Edge {
    int u, v;
}e[M];
bool check(int l, int r) {
    init();
    for (int i = l; i <= r; i++) {
        int u = e[i].u, v = e[i].v;
        vist[u] = 1, vist[v] = 1;
        g[u].push_back(v);
    }
    int num = 0;
    for (int i = l; i <= r; i++) {
        int u = e[i].u, v = e[i].v;
        if (!dfn[u]) tarjan(u);
        if (!dfn[v]) tarjan(v);
        if (vist[u]) num++, vist[u] = 0;
        if (vist[v]) num++, vist[v] = 0;
    }
    if (sum + n - num > k) return false;
    else return true;
}
void solve() {
    scanf("%d%d%lld", &n, &m, &k);
    for (int i = 1; i <= m; i++) scanf("%d%d", &e[i].u, &e[i].v);
    for (int i = 0; i <= 30; i++) pw[i] = 1 << i;
    int ans = 0;
    for (int st = 1; st <= m;) {
        int ed, mi;
        for (int i = 0; i < 25; i++) {
            ed = min(m, st + pw[i] - 1);
            mi = i;
            if (!check(st, ed)) break;
            if (ed == m) break;
        }
        int l = st + pw[max(0, mi-1)] - 1, r = min(m, st + pw[mi] - 1);
        while (l <= r) {
            int mid = (l + r) >> 1;
            if (check(st, mid)) l = mid + 1;
            else r = mid - 1;
        }
        st = r + 1;
        ans ++;
    }
    printf("%d\n", ans);
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
#endif
    solve();
    return 0;
}