2021牛客暑期多校训练营6

出题：3
排名：178

I.Intervals on the Ring

CY
题解：构造k个区间使k个区间所有区间交集是m区间的并集，只需要遍历环形的a[i].l和a[i-1].r就可以把中间的无关数字剔除。

#include <bits/stdc++.h>
typedef long long ll;
typedef std::pair < int, int > pii;
const int MAXN = 2e3 + 10;
int vis[MAXN];
int main()
{
    int t; scanf("%d", &t);
    while (t--)
    {
        memset(vis, 0, sizeof vis);
        int n, m; scanf("%d%d", &n, &m);
        while (m--)
        {
            int u, v; scanf("%d%d", &u, &v);
            if (u <= v)
                for (int i = u; i <= v; ++i)
                    vis[i] = vis[i + n] = 1;
            else
            {
                for (int i = u; i <= n; ++i)
                    vis[i] = vis[i + n] = 1;
                for (int i = 1; i <= v; ++i)
                    vis[i] = vis[i + n] = 1;
            }
        }
        for (int i = 1; i <= n; ++i)
        {
            std::vector < pii > intvals;
            for (int j = i; j - i + 1 <= n; )
            {
                int l, r;
                if (vis[j])
                {
                    l = r = j;
                    while (r + 1 < i + n && vis[r + 1])
                        ++r;
                    intvals.push_back({l, r});
                    j = r + 1;
                }
                else ++j;
            }
            int p = intvals.size();
            printf("%d\n", p);
            for (int i = 0; i < p; ++i)
                printf("%d %d\n", intvals[i].first > n? intvals[i].first - n: intvals[i].first, 
                        intvals[(i + p - 1) % p].second > n? intvals[(i + p - 1) % p].second - n: intvals[(i + p - 1) % p].second);
            break;
        }
    }
    return 0;
}

F.Hamburger Steak

WXL
烤肉。
$n$个汉堡，$m$个锅，汉堡制作耗时$t_i$，允许拆分时间，由$a_I+b_i=t_i$制作得到。
想了好久的贪心，关键在于什么时候换锅，以及找到:
$mx=max(Max,ceil(Sum/m))$
思维误区：$Max$足够大时，需要$Max/2$时间
hack:

1 2
100
ans: 100
//虽然有两个锅，但是不能拆成[0, 50] 和 [0, 50]，因为一个汉堡不能同时在两个锅上制作 

构造方案！！！
按时间排序，从大往小构造，对于当前段，能塞进去就塞进去，不能塞进去的话就把后半部分塞进去，最后记得排序即可。
正确性证明
假设现在有两端长度分别为$t_i,t_j$，满足$t_i>=t_j$，如果$t_i$能够放到$mx$里面，且放$t_j$时会超出$mx$，可以将$t_j$分离成两段，如下图:

由$t_i>=t_j$得出必然会满足条件$y<=x$，所以我们构造的时间戳是合法的(不会出现[1, 3] [2, 5] 的不合法情况)，所以这样构造可以得到正确的结果。

const int N = 1e5+5;
int a[N];
signed main()
{
   IOS;
   int n, m;
   cin >> n >> m;
   int sum = 0;
   int mx = -1;
   rep(i,1,n)
   {
      cin >> a[i];
      sum += a[i];
      mx = max(mx, a[i]);
   }
   int tmp = ceil(sum / (double)m);
   mx = max(mx, tmp);
   int id = 1, l = 0, r = mx;
   rep(i,1,n)
   {
      if(a[i] + l <= mx)
      {
         r = l + a[i];
         cout << 1 << ' ' << id << ' ' << l << ' ' << r << endl;
      }
      else
      {
         r = l + a[i] - mx;
         ++id;
         cout << 2 << ' ' << id << ' ' << 0 << ' ' << l + a[i] - mx << ' ' << id - 1 << ' ' << l << ' ' << mx << endl;
      }
      l = r;
      if(l == mx)
      {
         ++id;
         l = 0;
         r = mx;
      }
   }
}

H.Hopping Rabbit

CY
CY写的线段树加扫描线，过程非常折磨。

#include <bits/stdc++.h>
#define lson (u << 1)
#define rson (u << 1 | 1)
typedef long long ll;
const int MAXN = 1e5 + 10;
int idx, tag[MAXN << 3];
struct segment
{
    int l, r, y, val;
    bool operator <(segment &others)
    {
        if (y != others.y) return y < others.y;
        else return val > others.val;
    }
}seg[MAXN << 3];
struct node
{
    int l, r, val;
}tr[MAXN << 3];
void pushup(int u)
{
    if (tag[u]) tr[u].val = tr[u].r - tr[u].l + 1;
    else if (tr[u].l == tr[u].r) tr[u].val = 0;
    else tr[u].val = tr[lson].val + tr[rson].val;
}
void build(int l, int r, int u)
{
    tr[u] = {l, r, 0};
    if (l == r) return;
    int mid = l + r >> 1;
    build(l, mid, u << 1); build(mid + 1, r, u << 1 | 1);
}
void modify(int l, int r, int u, int v)
{
    if (l <= tr[u].l && tr[u].r <= r)
    {
        tag[u] += v;
        pushup(u);
        return;
    }
    int mid = tr[u].l + tr[u].r >> 1;
    if (l <= mid) modify(l, r, u << 1, v);
    if (r > mid) modify(l, r, u << 1 | 1, v);
    pushup(u);
}
void print(int u)
{
    if (tr[u].l == tr[u].r)
    {
        printf("%d", tr[u].l);
        return;
    }
    int mid = tr[u].l + tr[u].r >> 1;
    if (tr[lson].val != tr[lson].r - tr[lson].l + 1) print(lson);
    else print(rson);
}
int main()
{
    int n, d; scanf("%d%d", &n, &d);
    build(0, d - 1, 1);
    bool f = 0;
    for (int i = 1; i <= n; ++i)
    {
        int x1, x2, y1, y2; scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
        x2--, y2--;
        if (x2 - x1 + 1 >= d)
        {
            if (y2 - y1 + 1 >= d) f = 1;
            else
            {
                y1 = (y1 % d + d) % d, y2 = (y2 % d + d) % d;
                if (y1 <= y2) seg[++idx] = {0, d - 1, y1, 1}, seg[++idx] = {0, d - 1, y2, -1};
                else
                {
                    seg[++idx] = {0, d - 1, y1, 1}, seg[++idx] = {0, d - 1, d - 1, -1};
                    seg[++idx] = {0, d - 1, 0, 1}, seg[++idx] = {0, d - 1, y2, -1};
                }
            }
        }
        else
        {
            x1 = (x1 % d + d) % d, x2 = (x2 % d + d) % d;
            if (x1 <= x2)
            {
                if (y2 - y1 + 1 >= d) seg[++idx] = {x1, x2, 0, 1}, seg[++idx] = {x1, x2, d - 1, -1};
                else
                {
                    y1 = (y1 % d + d) % d, y2 = (y2 % d + d) % d;
                    if (y1 <= y2) seg[++idx] = {x1, x2, y1, 1}, seg[++idx] = {x1, x2, y2, -1};
                    else
                    {
                        seg[++idx] = {x1, x2, y1, 1}, seg[++idx] = {x1, x2, d - 1, -1};
                        seg[++idx] = {x1, x2, 0, 1}, seg[++idx] = {x1, x2, y2, -1};
                    }
                }
            }
            else
            {
                if (y2 - y1 + 1 >= d)
                {
                    seg[++idx] = {x1, d - 1, 0, 1}, seg[++idx] = {x1, d - 1, d - 1, -1};
                    seg[++idx] = {0, x2, 0, 1}, seg[++idx] = {0, x2, d - 1, -1};
                }
                else
                {
                    y1 = (y1 % d + d) % d, y2 = (y2 % d + d) % d;
                    if (y1 <= y2)
                    {
                        seg[++idx] = {x1, d - 1, y1, 1}, seg[++idx] = {x1, d - 1, y2, -1};
                        seg[++idx] = {0, x2, y1, 1}, seg[++idx] = {0, x2, y2, -1};
                    }
                    else
                    {
                        seg[++idx] = {x1, d - 1, y1, 1}, seg[++idx] = {x1, d - 1, d - 1, -1};
                        seg[++idx] = {0, x2, y1, 1}, seg[++idx] = {0, x2, d - 1, -1};
                        seg[++idx] = {x1, d - 1, 0, 1}, seg[++idx] = {x1, d - 1, y2, -1};
                        seg[++idx] = {0, x2, 0, 1}, seg[++idx] = {0, x2, y2, -1};
                    }
                }
            }
        }
    }
    if (f)
    {
        printf("NO\n");
        return 0;
    }
    std::sort(seg + 1, seg + 1 + idx);
    // for (int i = 1; i <= idx; ++i)
    //     printf("%d %d %d %d\n", seg[i].l ,seg[i].r, seg[i].y, seg[i].val);
    if (seg[1].y != 0)
    {
        printf("YES\n0 0\n");
        return 0;
    }
    for (int i = 1; i <= idx; )
    {
        int y = seg[i].y;
        while (i <= idx && seg[i].y == y && seg[i].val == 1)
        {
            modify(seg[i].l, seg[i].r, 1, seg[i].val);
            ++i;
        }
        if (tr[1].val != tr[1].r - tr[1].l + 1)
        {
            printf("YES\n");
            print(1);
            printf(" %d\n", y);
            f = 1;
            break;
        }
        while (i <= idx && seg[i].y == y)
        {
            modify(seg[i].l, seg[i].r, 1, seg[i].val);
            ++i;
        }
        if (i <= idx && seg[i].y - seg[i - 1].y > 1)
        {
            if (tr[1].val != tr[1].r - tr[1].l + 1)
            {
                printf("YES\n");
                print(1);
                printf(" %d\n", y + 1);
                f = 1;
                break;
            }
        }
        if (i > idx && d - 1 > seg[i - 1].y)
        {
            if (tr[1].val != tr[1].r - tr[1].l + 1)
            {
                printf("YES\n");
                print(1);
                printf(" %d\n", y + 1);
                f = 1;
                break;
            }
        }
    }

    if (!f) printf("NO\n");
    return 0;
}