제출 #1324771

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1324771		vladilius	Garden (JOI23_garden)	C++20	0 / 100	548 ms	14744 KiB

garden

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n, m, d; cin>>n>>m>>d;
    vector<pii> M[2 * d];
    vector<int> f(d + 2); f[0] = f[d + 1] = 1;
    for (int i = 1; i <= n; i++){
        int x, y; cin>>x>>y;
        y++;
        f[y]++;
        M[x].pb({y, 1});
        M[x + d].pb({y, 1});
    }
    
    vector<int> D[2 * d];
    vector<pii> all;
    for (int i = 1; i <= m; i++){
        int x, y; cin>>x>>y;
        y++;
        M[x].pb({y, 0});
        M[x + d].pb({y, 0});
        all.pb({x, y});
    }

    ll out = 1e18;
    for (int i = 0; i < d; i++){
        for (auto [x, y]: all){
            f[y]++;
        }

        auto get = [&](){
            int pre = 1e9, mx = 0;
            for (int j = 1; j <= d; j++){
                if (f[j]){
                    mx = max(mx, j - pre);
                    pre = j;
                }
            }
            if (!mx) return d;
            return mx;
        };
        
        int cc = 0;
        for (int j = i; j < i + d; j++){
            for (auto [y, b]: M[j]){
                if (b){
                    cc++;
                }
                else {
                    f[y]--;
                }
            }
            if (cc == n){
                out = min(out, 1LL * (j - i + 1) * ((d + 1) - get()));
            }
        }
    }
    
    cout<<out<<"\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