# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
954718 | LucaIlie | Measures (CEOI22_measures) | C++17 | 1551 ms | 3268 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>
using namespace std;
vector<int> v;
int main() {
int n, q, d;
cin >> n >> q >> d;
for ( int i = 0; i < n; i++ ) {
int p;
cin >> p;
v.push_back( p );
}
for ( int i = 0; i < q; i++ ) {
int p;
cin >> p;
v.push_back( p );
sort( v.begin(), v.end() );
long long ans = 0;
for ( int l = 0; l < v.size(); l++ ) {
for ( int r = l + 1; r < v.size(); r++ )
ans = max( ans, (long long)d * (r - l) - (v[r] - v[l]) );
}
cout << ans / 2;
if ( ans % 2 == 1 )
cout << ".5";
cout << " ";
}
return 0;
}
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... |