| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1299109 | retarde | Growing Vegetables is Fun 5 (JOI24_vegetables5) | C++20 | 164 ms | 18532 KiB |
#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 calc(int s) {
int cur = 0;
// [s, s + n - 1]
vi blu, red;
for (int j = 0; j < 2 * n; j++) {
if (j >= s && j <= s + n - 1) {
blu.pb(a[j]);
} else {
red.pb(a[j]);
}
}
sort(all(blu)); sort(all(red));
int curblu = 0, curred = 0;
for (int i = 0; i < n; i++) {
cur = max(cur, abs(blu[i] - b[i]));
curblu = max(curblu, abs(blu[i] - b[i]));
cur = max(cur, abs(red[i] - c[i]));
curred = max(curred, abs(red[i] - c[i]));
}
return cur;
cout << curblu << " " << curred << '\n';
}
int answer() {
// int ans = 1e18;
// for (int s = 0; s <= n; s++) {
// }
// cout << '\n';
return min(calc(0), calc(n));
}
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();
}
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
