Submission #965584

#	Time	Username	Problem	Language	Result	Execution time	Memory
965584		phoenix0423	Garden (JOI23_garden)	C++17	0 / 100	250 ms	168788 KiB

garden

#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")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define int long long
#define lowbit(x) x&-x
const int maxn = 5000 + 5;
const int INF = 1e18;
int a[maxn][maxn], dp[maxn * 2][maxn], h[maxn], c[maxn];

signed main(void){
    fastio;
    int n, m, d;
    cin>>n>>m>>d;
    set<int> cx, cy;
    for(int i = 0; i < n; i++){
        int x, y;
        cin>>x>>y;
        cx.insert(x), cy.insert(y);
        a[x][y] |= 1;
        h[x] |= 1;
        c[y] |= 1;
    }
    for(int i = 0; i < m; i++){
        int x, y;
        cin>>x>>y;
        a[x][y] |= 2;
        // h[x] |= 2, c[y] |= 2;
    }
    auto cal = [&](int x, int y) -> int {
        if(!x || !y) return 0;
        // cout<<"cal : "<<x<<" "<<y<<"\n";
        y = min(y, d);
        return (x + y) * d - x * y;
    };
    int ans = 0;
    for(int j = d - 1; j >= 0; j--){
        if(c[j] & 1) continue;
        for(int i = 0; i < d; i++){
            if(h[i] || (a[i][j] & 2)) continue;
            dp[i][j] = dp[i][j + 1] + 1;
            // cout<<"ok : "<<i<<" "<<j<<" "<<dp[i][j]<<"\n";
        }
        for(int i = d; i < 2 * d; i++) dp[i][j] = dp[i - d][j];
        vector<int> st;
        for(int i = 0; i < 2 * d; i++){
            // cout<<"cur : "<<i<<" "<<j<<"\n";
            while(st.size() && dp[st.back()][j] > dp[i][j]){
                int id = st.back(); st.pop_back();
                // cout<<"ok : "<<i<<" "<<j<<": "<<dp[i][id]<<" "<<i - id<<"\n";
                ans = max(ans, cal(dp[id][j], (i - id)));
            }
            // cout<<"dp : "<<i<<" "<<j<<" "<<dp[i][j]<<"\n";
            ans = max(ans, cal(dp[i][j], (i - (st.size() ? st.back() : -1))));
            st.pb(i);
        }
        while(!st.empty()){
            ans = max(ans, cal(dp[st.back()][j], 2 * d - st.back()));
            st.pop_back();
        }
    }
    ans = d * d - ans;
    int cur = *(cx.rbegin()) + 1;
    int id = 0;
    for(int i = 0; i < d; i++){
        ans = min(ans, d * cur);
        if(!cx.count(i)) cur--;
        else cur = d;
    }
    cur = *(cy.rbegin()) + 1;
    for(int i = 0; i < d; i++){
        ans = min(ans, d * cur);
        if(!cy.count(i)) cur--;
        else cur = d;
    }
    cout<<ans<<"\n";
}

Compilation message (stderr)

garden.cpp: In function 'int main()':
garden.cpp:70:9: warning: unused variable 'id' [-Wunused-variable]
   70 |     int id = 0;
      |         ^~

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