Submission #1299117

#	Time	Username	Problem	Language	Result	Execution time	Memory
1299117		retarde	Growing Vegetables is Fun 5 (JOI24_vegetables5)	C++20	0 / 100	131 ms	16040 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()

typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;

const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;

int n;
vi a, b, c;

int blue(int s) {
    int cur = 0; vi blu;
    for (int j = 0; j < 2 * n; j++) {
        if (j >= s && j <= s + n - 1) {
            blu.pb(a[j]);
        }
    }
    sort(all(blu));
    for (int i = 0; i < n; i++) cur = max(cur, abs(blu[i] - b[i]));
    return cur;
}

int redd(int s) {
    int cur = 0; vi red;
    for (int j = 0; j < 2 * n; j++) {
        if (j >= s && j <= s + n - 1) {
            continue;
        } else {
            red.pb(a[j]);
        }
    }
    sort(all(red));
    for (int i = 0; i < n; i++) cur = max(cur, abs(red[i] - c[i]));
    return cur;
}

int answer() {
    int lo = 0;
    int hi = n;
    // blue increasing red decreasing
    assert(blue(0) <= blue(n));
    assert(redd(0) >= redd(n));
    while (hi > lo + 1) {
        int mid = (lo + hi) / 2;
        if (blue(mid) - redd(mid) <= 0) {
            lo = mid;
        } else {
            hi = mid;
        }
    }
    int ans = 1e18;
    ans = min(ans, max(blue(hi), redd(hi)));
    if (hi != n) ans = min(ans, max(blue(hi + 1), redd(hi + 1)));
    if (hi != 0) ans = min(ans, max(blue(hi - 1), redd(hi - 1)));
    return ans;
}

inline void solve() {
    cin >> n;
    a.resize(2 * n);
    b.resize(n);
    c.resize(n);
    for (int i = 0; i < 2 * n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) cin >> b[i];
    for (int i = 0; i < n; i++) cin >> c[i];
    sort(all(b)); sort(all(c));
    
    int ans = answer();
    for (int i = 0; i < n; i++) swap(b[i], c[i]);
    ans = min(ans, answer());
    cout << ans << '\n';
}

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

signed main() {
    ios::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);
    //setIO();

    int t = 1;
    if (tc) {
        cin >> t;
    }

    while (t--) {
        solve();
    }
}

Compilation message (stderr)

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:100:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  100 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:101:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 4
• Subtask 2: 0 / 5
• Subtask 3: 0 / 21
• Subtask 4: 0 / 37
• Subtask 5: 0 / 33