Submission #965208

#	Time	Username	Problem	Language	Result	Execution time	Memory
965208		gaga999	Garden (JOI23_garden)	C++17	100 / 100	605 ms	106320 KiB

garden

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define size(x) (int)x.size()
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef __int128_t lll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 5005;
typedef bitset<N> bs;
bs b1, b2, vd[N];
int dp[N][N], top[N], tp2;

signed main()
{
    int n, m, k, x, y, mx = 0;
    rd(n, m, k);
    for (int i = 1; i <= n; i++)
        rd(x, y), b1[x] = 1, b2[y] = 1, tmax(tp2, x);
    for (int i = 1; i <= m; i++)
        rd(x, y), vd[x][y] = 1, tmax(top[y], x);
    if (!b1[0])
        for (int j = 0; j < k; j++)
            if (!b2[j] && !vd[0][j])
                dp[0][j] = k - max(top[j], tp2);
    for (int i = 1; i < k; i++)
    {
        if (b1[i])
            continue;
        for (int j = 0; j < k; j++)
        {
            if (b2[j] || vd[i][j])
                continue;
            dp[i][j] = min(k, dp[i - 1][j] + 1);
        }
    }
    auto cg = [&](int a, int b) -> void
    {
        if (a > 0 && b > 0)
        {
            tmin(a, k - 1), tmin(b, k - 1);
            tmax(mx, k * (a + b) - a * b);
        }
    };
    for (int i = 0; i < k; i++)
    {
        if (b1[i])
            continue;
        vector<pii> sk(1, pii(-1, -1));
        for (int j = 0; j < k << 1; j++)
        {
            int cv = dp[i][j >= k ? j - k : j];
            while (cv <= sk.back().F)
            {
                int tp = sk.back().F;
                sk.pop_back();
                cg(tp, j - sk.back().S - 1);
            }
            sk.pb(cv, j);
        }
        for (pii j : sk)
            cg(j.F, (k << 1) - j.S);
    }
    for (int i = 0, ct; i < k; i++)
    {
        ct = 0;
        while (ct < k - 1 && !b1[(i + ct) % k])
            ct++;
        tmax(mx, k * ct);
        ct = 0;
        while (ct < k - 1 && !b2[(i + ct) % k])
            ct++;
        tmax(mx, k * ct);
    }
    prt(k * k - mx), putchar('\n');
}

• Subtask 1: 15 / 15
• Subtask 2: 6 / 6
• Subtask 3: 8 / 8
• Subtask 4: 16 / 16
• Subtask 5: 30 / 30
• Subtask 6: 25 / 25