2021牛客暑期多校训练营6
F、Hamburger Steak
贪心,队友出的。
最短总时间 T = m a x { m a x { t i } , ⌈ Σ t i m ⌉ } T=max\left\{max\left\{t_i\right\}, \lceil \frac{\Sigma t_i}{m}\rceil\right\} T=max{max{ti},⌈mΣti⌉}。然后一个一个放就可以了。
为什么是对的其实还不是很懂。
#include <bits/stdc++.h>
typedef long long ll;
const int MAXN = 1e5 + 10;
int t[MAXN];
int main()
{
int n, m; scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i)
scanf("%d", &t[i]);
int maxi = 0; ll sum = 0;
for (int i = 1; i <= n; ++i)
{
maxi = std::max(maxi, t[i]);
sum += t[i];
}
ll ans = std::max(1ll * maxi, sum / m + (sum % m != 0));
int id = 1; ll l = 0;
for (int i = 1; i <= n; ++i)
{
if (l + t[i] <= ans)
{
printf("%d %d %lld %lld\n", 1, id, l, l + t[i]);
l += t[i];
}
else
{
printf("%d %d %d %lld %d %lld %lld\n", 2, id + 1, 0, l - ans + t[i], id, l, ans);
l = l - ans + t[i]; ++id;
}
if (l == ans) ++id, l = 0;
}
return 0;
}
H、Hopping Rabbit
一个点可以看成所有满足 x ≡ x 0 ( m o d d ) , y ≡ y 0 ( m o d d ) x\equiv x_0(\mod d),y\equiv y_0(\mod d) x≡x0(modd),y≡y0(modd)的点就不能取了。
所以可以把所有矩形都映射到 [ 0 , d ) × [ 0 , d ) [0,d)\times[0,d) [0,d)×[0,d)里面,然后扫描线找个没有覆盖到的点即可。
思路很好想,扫描线和映射很难写,de了两个多小时bug,比赛结束前终于过了。
#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;
}
I、Intervals on the Ring
找规律。先把所有连续的段存起来,然后输出 n n n条线段,每次从第 i m o d p i\mod p imodp个线段的左端点到 ( i + p − 1 ) m o d p (i+p-1)\mod p (i+p−1)modp个线段的右端点。
#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;
}