Busiest Computing Nodes

Busiest Computing Nodes

题意：

给k台洗衣机(洗衣机为[0, k - 1])，给n个按起始时间非递减的任务，每个任务有一个起始时间s和工作时间d，每个任务从s%k这个这个洗衣机开始往后找循环一下圈，找到第一个未工作的洗衣机，如果都不行就丢掉这个任务。问你哪个洗衣机处理的任务最多，有多个的话按字典序从小到大输出。

题解：

$O(n^2)$的暴力一定会T，这里考虑用线段树加二分来维护，从当位置开始到结尾每次check一下，如果区间最小成立的话，r = mid，这样就可以二分出答案了。

Code

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <set>
#include <queue>
#include <vector>
#include <map>
#include <unordered_map>
#include <cmath> 
#include <stack>
#include <iomanip>
#include <deque> 
#include <sstream>
#define x first
#define y second
using namespace std;
typedef long double ld;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef unsigned long long ULL;
const int N = 2e5 + 100, M = 2 * N, INF = 0x3f3f3f3f, mod = 1e9 + 7;
const double eps = 1e-8;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
int h[N], e[M], ne[M], w[M], idx;
void add(int a, int b, int v = 0) {
    e[idx] = b, w[idx] = v, ne[idx] = h[a], h[a] = idx ++;
}
int n, m, k;
int mxx = -1;
PII a[N];
int b[N];
int res[N];
int ans[N];
int cnt = 1;
struct Node {
    int l, r;
    LL mn;
}tr[N << 2];
void push(int u) {
    tr[u].mn = min(tr[u << 1].mn, tr[u << 1 | 1].mn);
}
void build(int u, int l, int r) {
    tr[u] = {l, r};
    if (l == r) {
        tr[u].mn = 0;
        return ;
    }
    int mid = l + r >> 1;
    build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
    push(u);
}
void update(int u, int pos, int p) {
    if (tr[u].l == tr[u].r) {
        tr[u].mn = a[p].x + a[p].y;
        b[pos] = a[p].x + a[p].y;
        res[pos] ++, mxx = max(mxx, res[pos]);
        return ;
    }
    int mid = tr[u].l + tr[u].r >> 1;
    if (pos <= mid) update(u << 1, pos, p);
    else            update(u << 1 | 1, pos, p);
    push(u);
}
int query(int u, int l, int r) {
    if (l <= tr[u].l && tr[u].r <= r) return tr[u].mn;
    int mid = tr[u].l + tr[u].r >> 1;
    int mx = INF;
    if (l <= mid)  mx = query(u << 1, l, r);
    if (r > mid)   mx = min(mx, query(u << 1 | 1, l, r));
    return mx;
}
int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    cin >> k >> n;
    for (int i = 0; i < n; i ++ ) {
        int s, d;
        cin >> s >> d;
        if (a[cnt - 1].x == s) a[cnt - 1].y = min(a[cnt - 1].y, d);
        else a[cnt] = {s, d}, cnt ++;
    }
    cnt --;
    build(1, 1, k);
    for (int i = 1; i <= cnt; i ++ ) {
        int pos = (i - 1) % k + 1;
        int l = pos, r = k;
        while (l < r) {
            int mid = l + r >> 1;
            if (query(1, pos, mid) <= a[i].x)  r = mid;
            else                               l = mid + 1;
        }
        if (b[l] <= a[i].x) update(1, l, i);
        else {
            l = 1, r = pos;
            while (l < r) {
                int mid = l + r>> 1;
                if (query(1, 1, mid) <= a[i].x) r = mid;
                else l = mid + 1;
            }
            if (b[l] <= a[i].x) update(1, l, i);
        }
    }
    int t = 0;
    for (int i = 1; i <= k; i ++ ) if (res[i] == mxx) ans[t ++] = i - 1;
    for (int i = 0; i < t - 1; i ++ ) cout << ans[i] << ' ';
    cout << ans[t - 1];
    return 0;
}
// 小于等于的第一个