Submission #1084190

#	Time	Username	Problem	Language	Result	Execution time	Memory
1084190		RiverFlow	Garden (JOI23_garden)	C++14	30 / 100	3044 ms	24968 KiB

garden

#include <bits/stdc++.h>

#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maxi(U &a, V b) {
    if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
    if (a > b) { a = b; return 1; } return 0;
}

const int N = (int)5e5 + 9;
const int mod = (int)1e9 + 7;

void prepare(); void main_code();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0; prepare();
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); }
}

void prepare() {};

int n, m, d;
int p[N], q[N], r[N], s[N], see[2 * N];

bool in(int l, int r, int x) {
    return l <= x and x <= r;
}
const int MAX = 5007;
bool ex[2 * MAX];

void main_code() {
    cin >> n >> m >> d;
    map<ii, int> mp;
    for(int i = 1; i <= n; ++i) {
        cin >> p[i] >> q[i];
        FOR(l, -1, 1) {
            ex[q[i] + l * d + MAX] = 1;
        }
    }
    for(int i = 1; i <= m; ++i) {
        cin >> r[i] >> s[i];
        FOR(l, -1, 1) {
            ex[s[i] + l * d + MAX] = 1;
        }
    }
    int ans = INT_MAX;
    FOR(y, -d, d) if (ex[y + MAX])
    FOR(v, y, min(y + d - 1, d)) if ( (v - y + 1) < ans and ex[v + MAX] ) {
        vector<ii> col;
        for(int i = 1; i <= m; ++i) {
            bool ok = 0;
            FOR(l, -1, 1) ok |= in(y, v, s[i] + l * d);
            if (ok) {
                continue ;
            } else {
                FOR(l, 0, 1) col.emplace_back(r[i] + l * d, i);
            }
        }
        bool check = 1;
        for(int i = 1; i <= n; ++i) {
            bool ok = 0;
            FOR(l, -1, 1) ok |= in(y, v, q[i] + l * d);
            check &= ok;
            FOR(l, 0, 1) col.emplace_back(p[i] + l * d, i + m);
        }
        if (check == 0) continue ;
        sort(col.begin(), col.end());
        int cnt = 0;
        FOR(i, 1, n + m) see[i] = 0;
        int j = 0;
        FOR(i, 0, sz(col) - 1) {
            ++see[col[i].se];
            cnt += see[col[i].se] == 1;
            while (j < i and see[col[j].se] - 1 > 0) {
                --see[col[j].se];
                ++j;
            }
            if (cnt == sz(col) / 2) {
                ans = min(ans, (v - y + 1) * (col[i].fi - col[j].fi + 1));
            }
        }
    }
    cout << ans;
}


/*     Let the river flows naturally     */

Compilation message (stderr)

garden.cpp: In function 'int main()':
garden.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
garden.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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