Submission #1005134

# Submission time Handle Problem Language Result Execution time Memory
1005134 2024-06-22T07:43:08 Z PurpleCrayon Growing Vegetables is Fun 5 (JOI24_vegetables5) C++17
30 / 100
5000 ms 19396 KB
#include <bits/stdc++.h>
using namespace std;

#define sz(v) int(v.size())
#define ar array
typedef long long ll;
const int N = 3e5+10, MOD = 1e9+7;
const ll INF = 1e18+10;

void solve() {
    int n; cin >> n;
    vector<ll> a(2 * n); for (auto& x : a) cin >> x;
    vector<ll> b(n); for (auto& x : b) cin >> x;
    vector<ll> c(n); for (auto& x : c) cin >> x;

    sort(b.begin(), b.end());
    sort(c.begin(), c.end());
    ll ans = INF;
    for (int tt = 0; tt < 2; tt++) {
        for (int i = 0; i <= n; i++) {
            vector<ll> one, two;
            for (int rep = 0; rep < n; rep++) {
                one.push_back(a[(i + rep) % (2 * n)]);
            }

            for (int rep = 1; rep <= n; rep++) {
                two.push_back(a[(i - rep + 2 * n) % (2 * n)]);
            }

            sort(one.begin(), one.end());
            sort(two.begin(), two.end());
            ll cur = 0;
            for (int j = 0; j < n; j++) {
                cur = max(cur, abs(one[j] - b[j]));
                cur = max(cur, abs(two[j] - c[j]));
            }
            ans = min(ans, cur);
        }
        swap(b, c);
    }

    cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int T = 1;
    // cin >> T;
    while (T--) solve();
}

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 424 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 424 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 504 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 424 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 504 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 360 ms 620 KB Output is correct
27 Correct 348 ms 604 KB Output is correct
28 Correct 191 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 348 ms 620 KB Output is correct
31 Correct 375 ms 600 KB Output is correct
32 Correct 76 ms 344 KB Output is correct
33 Correct 18 ms 348 KB Output is correct
34 Correct 352 ms 604 KB Output is correct
35 Correct 327 ms 856 KB Output is correct
36 Correct 383 ms 620 KB Output is correct
37 Correct 173 ms 604 KB Output is correct
38 Correct 195 ms 604 KB Output is correct
39 Correct 235 ms 604 KB Output is correct
40 Correct 350 ms 604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 5043 ms 19396 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 424 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 504 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 360 ms 620 KB Output is correct
27 Correct 348 ms 604 KB Output is correct
28 Correct 191 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 348 ms 620 KB Output is correct
31 Correct 375 ms 600 KB Output is correct
32 Correct 76 ms 344 KB Output is correct
33 Correct 18 ms 348 KB Output is correct
34 Correct 352 ms 604 KB Output is correct
35 Correct 327 ms 856 KB Output is correct
36 Correct 383 ms 620 KB Output is correct
37 Correct 173 ms 604 KB Output is correct
38 Correct 195 ms 604 KB Output is correct
39 Correct 235 ms 604 KB Output is correct
40 Correct 350 ms 604 KB Output is correct
41 Execution timed out 5043 ms 19396 KB Time limit exceeded
42 Halted 0 ms 0 KB -