oj.uz

Submission #965649

# Submission time Handle Problem Language Result Execution time Memory
965649 2024-04-19T03:35:19 Z phoenix0423 Garden (JOI23_garden) C++17
75 / 100
 3000 ms 200564 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#pragma GCC optimize("Ofast,unroll-loops,O3")
#pragma GCC target("avx,avx2")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
// #define int long long
#define lowbit(x) x&-x

namespace{
const int maxn = 5000 + 5;
int a[maxn][maxn], dp[maxn][maxn], h[maxn], c[maxn], mx[maxn * 2], st[maxn * 2];

void main1(void){
    fastio;
    int n, m, d;
    cin>>n>>m>>d;
    for(int i = 0; i < n; i++){
        int x, y;
        cin>>x>>y;
        h[x] |= 1;
        c[y] |= 1;
    }
    for(int i = 0; i < m; i++){
        int x, y;
        cin>>x>>y;
        a[x][y] = 2;
    }
    auto cal = [&](int x, int y) -> int {
        if(x <= 0 || y <= 0) return 0;
        // cout<<"cal : "<<x<<" "<<y<<"\n";
        y = min(y, d - 1);
        x = min(x, d - 1);
        return (x + y) * d - x * y;
    };
    int ans = 0;
    for(int j = 2 * d - 1; j >= 0; j--){
        int tj = j;
        if(j >= d) j -= d;
        if(c[j]){
            j = tj;
            continue;
        }
        for(int i = 0; i < d; i++){
            if(h[i] || a[i][j]) continue;
            int nxt = j == d - 1 ? 0 : j + 1;
            dp[i][j] = dp[i][nxt] + 1;
            // cout<<"ok : "<<i<<" "<<j<<" "<<dp[i][j]<<"\n";
        }
        int top = 0;
        for(int i = 0; i < 2 * d; i++){
            while(top && dp[st[top] - (st[top] >= d ? d : 0)][j] > dp[i - (i >= d ? d : 0)][j]){
                int id = st[top] - (st[top] >= d ? d : 0), org = st[top]; top--;
                ans = max(ans, cal(dp[id][j], mx[org] + (i - org) - 1));
            }
            mx[i] = (top ? i - st[top] : i + 1);
            st[++top] = i;
        }
        while(top){
            // cout<<"put : "<<st.back() - (st.back() >= d) * d<<"\n";
            ans = max(ans, cal(dp[st[top] - (st[top] >= d ? d : 0)][j], mx[st[top]] + 2 * d - st[top] - 1));
            top--;
        }
        j = tj;
    }
    ans = d * d - ans;
    int cur = 0;
    for(int i = 0; i < d; i++){
        if(h[i]) cur = i + 1;
    }
    for(int i = 0; i < d; i++){
        ans = min(ans, d * cur);
        if(!h[i]) cur--;
        else cur = d;
    }
    cur = 0;
    for(int i = 0; i < d; i++){
        if(c[i]) cur = i + 1;
    }
    for(int i = 0; i < d; i++){
        ans = min(ans, d * cur);
        if(!c[i]) cur--;
        else cur = d;
    }
    ans = min(ans, d * cur);
    cout<<ans<<"\n";
}
}
int main(){
    main1();
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 17316 KB Output is correct
2 Correct 90 ms 14904 KB Output is correct
3 Correct 2461 ms 111696 KB Output is correct
4 Correct 2524 ms 105516 KB Output is correct
5 Correct 1959 ms 115692 KB Output is correct
6 Correct 1902 ms 117512 KB Output is correct
7 Correct 1840 ms 115628 KB Output is correct
8 Correct 56 ms 13724 KB Output is correct
9 Correct 52 ms 4884 KB Output is correct
10 Correct 36 ms 3664 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2524 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2536 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 2 ms 2392 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 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2524 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2536 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 2 ms 4696 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 2 ms 4608 KB Output is correct
19 Correct 2 ms 4700 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct

Subtask #4
16.0 / 16.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2524 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2536 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 2 ms 4696 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 2 ms 4608 KB Output is correct
19 Correct 2 ms 4700 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4572 KB Output is correct
24 Correct 3 ms 4824 KB Output is correct
25 Correct 2 ms 5052 KB Output is correct
26 Correct 2 ms 4956 KB Output is correct
27 Correct 2 ms 4956 KB Output is correct
28 Correct 2 ms 4956 KB Output is correct
29 Correct 2 ms 4956 KB Output is correct
30 Correct 2 ms 4956 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 33 ms 29528 KB Output is correct
34 Correct 2 ms 4700 KB Output is correct
35 Correct 2723 ms 195724 KB Output is correct
36 Correct 2713 ms 195748 KB Output is correct
37 Correct 2755 ms 195848 KB Output is correct
38 Correct 2933 ms 195760 KB Output is correct
39 Correct 2625 ms 195972 KB Output is correct
40 Correct 2808 ms 195696 KB Output is correct
41 Correct 2557 ms 195948 KB Output is correct
42 Correct 2485 ms 195876 KB Output is correct
43 Correct 2561 ms 195900 KB Output is correct
44 Correct 2358 ms 195512 KB Output is correct
45 Correct 2320 ms 195632 KB Output is correct
46 Correct 5 ms 13148 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 17316 KB Output is correct
2 Correct 90 ms 14904 KB Output is correct
3 Correct 2461 ms 111696 KB Output is correct
4 Correct 2524 ms 105516 KB Output is correct
5 Correct 1959 ms 115692 KB Output is correct
6 Correct 1902 ms 117512 KB Output is correct
7 Correct 1840 ms 115628 KB Output is correct
8 Correct 56 ms 13724 KB Output is correct
9 Correct 52 ms 4884 KB Output is correct
10 Correct 36 ms 3664 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2524 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2536 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 2 ms 2396 KB Output is correct
20 Correct 2 ms 2392 KB Output is correct
21 Correct 2 ms 2396 KB Output is correct
22 Correct 2 ms 4700 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 2 ms 4696 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 2 ms 4608 KB Output is correct
29 Correct 2 ms 4700 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4572 KB Output is correct
34 Correct 3 ms 4824 KB Output is correct
35 Correct 2 ms 5052 KB Output is correct
36 Correct 2 ms 4956 KB Output is correct
37 Correct 2 ms 4956 KB Output is correct
38 Correct 2 ms 4956 KB Output is correct
39 Correct 2 ms 4956 KB Output is correct
40 Correct 2 ms 4956 KB Output is correct
41 Correct 1 ms 4444 KB Output is correct
42 Correct 1 ms 2396 KB Output is correct
43 Correct 33 ms 29528 KB Output is correct
44 Correct 2 ms 4700 KB Output is correct
45 Correct 2723 ms 195724 KB Output is correct
46 Correct 2713 ms 195748 KB Output is correct
47 Correct 2755 ms 195848 KB Output is correct
48 Correct 2933 ms 195760 KB Output is correct
49 Correct 2625 ms 195972 KB Output is correct
50 Correct 2808 ms 195696 KB Output is correct
51 Correct 2557 ms 195948 KB Output is correct
52 Correct 2485 ms 195876 KB Output is correct
53 Correct 2561 ms 195900 KB Output is correct
54 Correct 2358 ms 195512 KB Output is correct
55 Correct 2320 ms 195632 KB Output is correct
56 Correct 5 ms 13148 KB Output is correct
57 Correct 1 ms 2396 KB Output is correct
58 Correct 1 ms 2908 KB Output is correct
59 Correct 1871 ms 113212 KB Output is correct
60 Correct 537 ms 116816 KB Output is correct
61 Correct 249 ms 73784 KB Output is correct
62 Execution timed out 3071 ms 200564 KB Time limit exceeded
63 Halted 0 ms 0 KB -