oj.uz

Submission #965631

# Submission time Handle Problem Language Result Execution time Memory
965631 2024-04-19T03:21:26 Z gaga999 Garden (JOI23_garden) C++17
100 / 100
 731 ms 106452 KB 
// #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)
{
   cin>>x,rd(y...);
}
 
template <typename T>
void prt(T x)
{
    cout<<x;
}
 
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.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 17828 KB Output is correct
2 Correct 141 ms 14928 KB Output is correct
3 Correct 500 ms 101028 KB Output is correct
4 Correct 428 ms 100440 KB Output is correct
5 Correct 416 ms 101156 KB Output is correct
6 Correct 384 ms 101020 KB Output is correct
7 Correct 390 ms 101304 KB Output is correct
8 Correct 163 ms 4516 KB Output is correct
9 Correct 166 ms 348 KB Output is correct
10 Correct 100 ms 2480 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 5 ms 4444 KB Output is correct
13 Correct 3 ms 4444 KB Output is correct
14 Correct 2 ms 2392 KB Output is correct
15 Correct 3 ms 4444 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 2 ms 4444 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 2 ms 2396 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 5 ms 4444 KB Output is correct
13 Correct 3 ms 4444 KB Output is correct
14 Correct 2 ms 2392 KB Output is correct
15 Correct 3 ms 4444 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 2 ms 4444 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 2 ms 2396 KB Output is correct
22 Correct 2 ms 2392 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 4444 KB Output is correct
25 Correct 2 ms 4692 KB Output is correct
26 Correct 2 ms 4696 KB Output is correct
27 Correct 2 ms 4444 KB Output is correct
28 Correct 2 ms 4444 KB Output is correct
29 Correct 2 ms 4444 KB Output is correct
30 Correct 2 ms 4440 KB Output is correct
31 Correct 2 ms 2396 KB Output is correct
32 Correct 2 ms 2396 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 5 ms 4444 KB Output is correct
13 Correct 3 ms 4444 KB Output is correct
14 Correct 2 ms 2392 KB Output is correct
15 Correct 3 ms 4444 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 2 ms 4444 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 2 ms 2396 KB Output is correct
22 Correct 2 ms 2392 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 4444 KB Output is correct
25 Correct 2 ms 4692 KB Output is correct
26 Correct 2 ms 4696 KB Output is correct
27 Correct 2 ms 4444 KB Output is correct
28 Correct 2 ms 4444 KB Output is correct
29 Correct 2 ms 4444 KB Output is correct
30 Correct 2 ms 4440 KB Output is correct
31 Correct 2 ms 2396 KB Output is correct
32 Correct 2 ms 2396 KB Output is correct
33 Correct 9 ms 20828 KB Output is correct
34 Correct 2 ms 4444 KB Output is correct
35 Correct 364 ms 101460 KB Output is correct
36 Correct 367 ms 101564 KB Output is correct
37 Correct 363 ms 101460 KB Output is correct
38 Correct 385 ms 101536 KB Output is correct
39 Correct 305 ms 101412 KB Output is correct
40 Correct 303 ms 102224 KB Output is correct
41 Correct 261 ms 101572 KB Output is correct
42 Correct 271 ms 101568 KB Output is correct
43 Correct 263 ms 101576 KB Output is correct
44 Correct 226 ms 101460 KB Output is correct
45 Correct 229 ms 101460 KB Output is correct
46 Correct 3 ms 4700 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 17828 KB Output is correct
2 Correct 141 ms 14928 KB Output is correct
3 Correct 500 ms 101028 KB Output is correct
4 Correct 428 ms 100440 KB Output is correct
5 Correct 416 ms 101156 KB Output is correct
6 Correct 384 ms 101020 KB Output is correct
7 Correct 390 ms 101304 KB Output is correct
8 Correct 163 ms 4516 KB Output is correct
9 Correct 166 ms 348 KB Output is correct
10 Correct 100 ms 2480 KB Output is correct
11 Correct 2 ms 2392 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 2 ms 4444 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 2 ms 2396 KB Output is correct
22 Correct 5 ms 4444 KB Output is correct
23 Correct 3 ms 4444 KB Output is correct
24 Correct 2 ms 2392 KB Output is correct
25 Correct 3 ms 4444 KB Output is correct
26 Correct 2 ms 4444 KB Output is correct
27 Correct 2 ms 2396 KB Output is correct
28 Correct 2 ms 4444 KB Output is correct
29 Correct 2 ms 4444 KB Output is correct
30 Correct 2 ms 2396 KB Output is correct
31 Correct 2 ms 2396 KB Output is correct
32 Correct 2 ms 2392 KB Output is correct
33 Correct 2 ms 2652 KB Output is correct
34 Correct 2 ms 4444 KB Output is correct
35 Correct 2 ms 4692 KB Output is correct
36 Correct 2 ms 4696 KB Output is correct
37 Correct 2 ms 4444 KB Output is correct
38 Correct 2 ms 4444 KB Output is correct
39 Correct 2 ms 4444 KB Output is correct
40 Correct 2 ms 4440 KB Output is correct
41 Correct 2 ms 2396 KB Output is correct
42 Correct 2 ms 2396 KB Output is correct
43 Correct 9 ms 20828 KB Output is correct
44 Correct 2 ms 4444 KB Output is correct
45 Correct 364 ms 101460 KB Output is correct
46 Correct 367 ms 101564 KB Output is correct
47 Correct 363 ms 101460 KB Output is correct
48 Correct 385 ms 101536 KB Output is correct
49 Correct 305 ms 101412 KB Output is correct
50 Correct 303 ms 102224 KB Output is correct
51 Correct 261 ms 101572 KB Output is correct
52 Correct 271 ms 101568 KB Output is correct
53 Correct 263 ms 101576 KB Output is correct
54 Correct 226 ms 101460 KB Output is correct
55 Correct 229 ms 101460 KB Output is correct
56 Correct 3 ms 4700 KB Output is correct
57 Correct 1 ms 2396 KB Output is correct
58 Correct 1 ms 4440 KB Output is correct
59 Correct 252 ms 100436 KB Output is correct
60 Correct 231 ms 63624 KB Output is correct
61 Correct 228 ms 40788 KB Output is correct
62 Correct 731 ms 101576 KB Output is correct
63 Correct 726 ms 106240 KB Output is correct
64 Correct 598 ms 106320 KB Output is correct
65 Correct 532 ms 106072 KB Output is correct
66 Correct 705 ms 106240 KB Output is correct
67 Correct 499 ms 106180 KB Output is correct
68 Correct 660 ms 106236 KB Output is correct
69 Correct 478 ms 106068 KB Output is correct
70 Correct 433 ms 106236 KB Output is correct
71 Correct 630 ms 106320 KB Output is correct
72 Correct 576 ms 106452 KB Output is correct
73 Correct 166 ms 8876 KB Output is correct
74 Correct 159 ms 6740 KB Output is correct