Submission #965178

#	Time	Username	Problem	Language	Result	Execution time	Memory
965178		gaga999	Garden (JOI23_garden)	C++17	0 / 100	3097 ms	13172 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);
    for (int i = 0; i < k; i++)
    {
        if (b1[i])
            continue;
        for (int j = 0; j < k; j++)
        {
            if (b2[j] || vd[i][j])
                continue;
            while (dp[i][j] < k)
            {
                dp[i][j]++;
                if (vd[(i + dp[i][j]) % k][j] || b1[(i + dp[i][j]) % k])
                    break;
            }
        }
    }
    auto cg = [&](int a, int b) -> void
    {
        if (a > 0 && b > 0)
        {
            // tmin(a, k), tmin(b, k);
            assert(a <= k && b <= k);
            tmax(mx, k * (a + b) - a * b);
        }
    };
    for (int i = 0; i < k; i++)
    {
        if (b1[i])
            continue;
        for (int a = 0; a < k; a++)
        {
            int cv = INF;
            for (int b = 0; b < k; b++)
            {
                tmin(cv, dp[i][(a + b) % k]);
                cg(cv, b + 1);
            }
        }
    }
    prt(k * k - mx), putchar('\n');
}

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