CodeForces Gym 101630简要题解

Archery Tournament

经过每条竖线的圆至多$\log C$个，线段树套$\texttt{set}$维护。

#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define mset(x, y) memset(x, y, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;

typedef long long LL;
typedef pair <int, int> pii;

inline int Read()
{
    int x = 0, f = 1, c = getchar();
    for (; !isdigit(c); c = getchar())
        if (c == '-')
            f = -1;
    for (;  isdigit(c); c = getchar())
        x = x * 10 + c - '0';
    return x * f;
}

const int MAXN = 200005;

int n, m, x[MAXN], y[MAXN], opt[MAXN], l[MAXN << 1];
set <int> s[MAXN << 3];

inline void Insert(int x, int l, int r, int ql, int qr, int v)
{
    if (l == ql && r == qr)
        return (void)s[x].insert(v);
    int mid = l + r >> 1;
    if (qr <= mid)
        Insert(x << 1, l, mid, ql, qr, v);
    else if (ql > mid)
        Insert(x << 1 | 1, mid + 1, r, ql, qr, v);
    else
        Insert(x << 1, l, mid, ql, mid, v), Insert(x << 1 | 1, mid + 1, r, mid + 1, qr, v);
}

inline void Erase(int x, int l, int r, int ql, int qr, int v)
{
    if (l == ql && r == qr)
        return (void)s[x].erase(v);
    int mid = l + r >> 1;
    if (qr <= mid)
        Erase(x << 1, l, mid, ql, qr, v);
    else if (ql > mid)
        Erase(x << 1 | 1, mid + 1, r, ql, qr, v);
    else
        Erase(x << 1, l, mid, ql, mid, v), Erase(x << 1 | 1, mid + 1, r, mid + 1, qr, v);
}

inline int Query(int x, int l, int r, int p, int v)
{
    for (auto i : s[x])
        if (1LL * (::x[i] - ::x[v]) * (::x[i] - ::x[v]) + 1LL * (y[i] - y[v]) * (y[i] - y[v]) < 1LL * y[i] * y[i])
            return i;
    if (l == r)
        return 0;
    int mid = l + r >> 1;
    return p <= mid ? Query(x << 1, l, mid, p, v) : Query(x << 1 | 1, mid + 1, r, p, v);
}

int main()
{
#ifdef wxh010910
    freopen("data.in", "r", stdin);
#endif
    n = Read();
    for (int i = 1; i <= n; i ++)
    {
        opt[i] = Read(), x[i] = Read(), y[i] = Read();
        if (opt[i] == 1)
            l[++ m] = x[i] - y[i], l[++ m] = x[i] + y[i];
        else
            l[++ m] = x[i];
    }
    sort(l + 1, l + m + 1), m = unique(l + 1, l + m + 1) - l - 1;
    for (int i = 1, r; i <= n; i ++)
        if (opt[i] == 1)
            Insert(1, 1, m, lower_bound(l + 1, l + m + 1, x[i] - y[i]) - l, lower_bound(l + 1, l + m + 1, x[i] + y[i]) - l, i);
        else if (r = Query(1, 1, m, lower_bound(l + 1, l + m + 1, x[i]) - l, i))
            printf("%d\n", r), Erase(1, 1, m, lower_bound(l + 1, l + m + 1, x[r] - y[r]) - l, lower_bound(l + 1, l + m + 1, x[r] + y[r]) - l, r);
        else
            puts("-1");
    return 0;
}

Box

分类讨论。

#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define mset(x, y) memset(x, y, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;

typedef long long LL;
typedef pair <int, int> pii;

inline int Read()
{
    int x = 0, f = 1, c = getchar();
    for (; !isdigit(c); c = getchar())
        if (c == '-')
            f = -1;
    for (;  isdigit(c); c = getchar())
        x = x * 10 + c - '0';
    return x * f;
}

int a, b, c, w, h, x, y;

inline bool Check(int a, int b, int c)
{
    x = b + c << 1, y = a + (c << 1);
    if ((x <= w && y <= h) || (x <= h && y <= w))
        return true;
    x = a + c, y = a + c + 3 * b;
    if ((x <= w && y <= h) || (x <= h && y <= w))
        return true;
    x = a + b + c, y = a + c + (b << 1);
    if ((x <= w && y <= h) || (x <= h && y <= w))
        return true;
    return false;
}

int main()
{
#ifdef wxh010910
    freopen("data.in", "r", stdin);
#endif
    a = Read(), b = Read(), c = Read(), w = Read(), h = Read();
    return puts(Check(a, b, c) || Check(a, c, b) || Check(b, a, c) || Check(b, c, a) || Check(c, a, b) || Check(c, b, a) ? "Yes" : "No"), 0;
}

Connections

只要让$1$能到所有点并且所有点能到$1$即可。

正反各DFS一遍。

#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define mset(x, y) memset(x, y, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;

typedef long long LL;
typedef pair <int, int> pii;

inline int Read()
{
    int x = 0, f = 1, c = getchar();
    for (; !isdigit(c); c = getchar())
        if (c == '-')
            f = -1;
    for (;  isdigit(c); c = getchar())
        x = x * 10 + c - '0';
    return x * f;
}

const int MAXN = 100005;

vector <pii> adj[MAXN], rev[MAXN];
int n, m, x[MAXN], y[MAXN];
bool vis[MAXN], ans[MAXN];

inline void DFS(int x, vector <pii> *adj)
{
    vis[x] = true;
    for (auto e : adj[x])
        if (!vis[e.xx])
            ans[e.yy] = true, DFS(e.xx, adj);
}

inline void Solve()
{
    n = Read(), m = Read();
    for (int i = 1; i <= n; i ++)
        adj[i].clear(), rev[i].clear();
    for (int i = 1; i <= m; i ++)
        ans[i] = false, x[i] = Read(), y[i] = Read(), adj[x[i]].pb(mp(y[i], i)), rev[y[i]].pb(mp(x[i], i));
    for (int i = 1; i <= n; i ++)
        vis[i] = false;
    DFS(1, adj);
    for (int i = 1; i <= n; i ++)
        vis[i] = false;
    DFS(1, rev);
    for (int i = 1, cnt = m - (n << 1); i <= m && cnt; i ++)
        if (!ans[i])
            printf("%d %d\n", x[i], y[i]), cnt --;
}

int main()
{
#ifdef wxh010910
    freopen("data.in",