# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
969454 | efedmrlr | Measures (CEOI22_measures) | C++17 | 1566 ms | 5468 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 int
#define ld long double
#define pb push_back
#define MP make_pair
#define all(x) x.begin(), x.end()
#define rall(x) x.begin(), x.end()
#define REP(i, n) for(int i = 0; (i) < (n); (i)++)
using namespace std;
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const int N = 2e5 + 5;
const int INF = 1e17;
int D;
void solve() {
int n, m;
cin >> n >> m >> D;
vector<int> a(n);
REP(i, n) cin >> a[i];
for(int z = 0; z < m; z++) {
int b;
cin >> b;
a.pb(b);
sort(all(a));
int v = 0;
for(int i = 0; i < a.size(); i++) {
for(int j = i + 1; j < a.size(); j++) {
v = max(v, (a[i] - i * D) - (a[j] - j * D));
}
}
if(v & 1) {
cout << v / 2 << ".5 ";
}
else {
cout << v / 2 << " ";
}
}
cout << "\n";
}
signed main() {
fastio();
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |