2021牛客多校6

H
把所有点都平移到0 ~ d-1 的矩形内，然后用扫描线去看矩形内有没有点没被占。

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 100010;
int n, d, l1, r1, xx;
bool flag = 0;
struct tree
{
    int len, cnt;
} a[N * 4];

struct xian
{
    int tl, tr; //左右边坐标
    int x;
};
vector<xian> x[N];

void pushup(int l, int r, int rt)
{
    if (a[rt].cnt)
        a[rt].len = r - l + 1;
    else if (l == r)
        a[rt].len = 0;
    else
        a[rt].len = a[rt * 2].len + a[rt * 2 + 1].len;
}

void change(int l, int r, int rt)
{ //离散化
    if (l1 <= l && r <= r1)
    {
        a[rt].cnt += xx;
        pushup(l, r, rt);
        return;
    }
    int mid = (l + r) / 2;
    if (l1 <= mid)
        change(l, mid, 2 * rt);
    if (mid < r1)
        change(mid + 1, r, 2 * rt + 1);
    pushup(l, r, rt);
}

void add(int x1, int y1, int x2, int y2)
{ //将扫描线加入动态数组中
    x[x1].push_back((xian){y1, y2, 1});
    x[x2 + 1].push_back((xian){y1, y2, -1});
}
void md(int &x)
{
    x %= d;
    if (x < 0)
        x += d;
}
void get(int l, int r, int rt)
{
    if (a[rt].len == 0)
    {
        printf("%d\n", l);
        return;
    }
    int mid = (l + r) / 2;
    if (a[2 * rt].len < mid - l + 1)
        get(l, mid, 2 * rt);
    else
        get(mid + 1, r, 2 * rt + 1);
}

int main()
{
    scanf("%d%d", &n, &d);
    int m = 0;
    for (int i = 1; i <= n; i++)
    {
        int x1, y1, x2, y2;
        scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
        x2--;
        y2--;
        if (x2 - x1 + 1 >= d)
            x1 = 0, x2 = d - 1;
        if (y2 - y1 + 1 >= d)
            y1 = 0, y2 = d - 1;
        md(x1), md(x2), md(y1), md(y2);
        if (x1 <= x2)
        {
            if (y1 <= y2)
                add(x1, y1, x2, y2);
            else
                add(x1, 0, x2, y2), add(x1, y1, x2, d - 1);
        }
        else
        {
            if (y1 <= y2)
                add(0, y1, x2, y2), add(x1, y1, d - 1, y2);
            else
                add(0, 0, x2, y2), add(x1, y1, d - 1, d - 1), add(0, y1, x2, d - 1), add(x1, 0, d - 1, y2);
        }
    }
    for (int i = 0; i < d; i++)
    {
        for (int j = 0; j < x[i].size(); j++)
        {
            l1 = x[i][j].tl;
            r1 = x[i][j].tr;
            xx = x[i][j].x;
            change(0, d - 1, 1);
        }
        if (a[1].len < d)
        {
            printf("YES\n%d ", i);
            get(0, d - 1, 1);
            return 0;
        }
    }
    printf("NO\n");
}

C
看懂题意后找出所有三元组相加等于n或者2*n的，输出即可。
因为确定了两个点后，那么第三个点也确定了，所以不会有重复删除。

#include <bits/stdc++.h>
#define endl "\n"
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const int N = 2e7 + 10;
const int mod = 1e9;
inline ll rd()
{
    ll x=0,f=1; char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48); ch=getchar();}
    return x*f;
}
struct Tri
{
    int A, B, C;
} Ans[N];
int Cnt;

int main()
{
    int n = rd();
    for (int i = 1; i <= n; i++)
        for (int j = i + 1; j <= n; j++)
        {
            if (n - i - j > j)
                Ans[++Cnt] = (Tri){i, j, n - i - j};
            if (2 * n - i - j > j && 2 * n - i - j <= n)
                Ans[++Cnt] = (Tri){i, j, 2 * n - i - j};
        }
    printf("%d\n", Cnt);
    for (int i = 1; i <= Cnt; i++)
        printf("%d %d %d\n", Ans[i].A, Ans[i].B, Ans[i].C) ;
    return 0;
}