# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1023651 | vjudge1 | Just Long Neckties (JOI20_ho_t1) | C++17 | 0 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define f first
#define s second
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
using namespace std;
const int mod = 998244353;
void solve() {
int n;
cin >> n;
vector <int> v(n + 1);
for (int i = 0; i <= n; i++) {
cin >> v[i];
}
vector <int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector <int> v1 = v, a1 = a, ans;
sort(v1.begin(), v1.end());
sort(a1.begin(), a1.end());
for (int i = 0; i < n + 1; i++) {
int k = 0, mx = 0, flag = 0;
for (int j = 0; j < n + 1; j++) {
if (v1[j] == v[i] && flag == 0) {
flag++;
continue;
}
mx = max(mx, abs(v1[j] - a1[k]));
k++;
}
ans.pb(mx);
}
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
}
signed main() {
int t = 1;
//cin >> t;
while (t--) {
solve();
}
}
Compilation message (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... |