Submission #723385

#TimeUsernameProblemLanguageResultExecution timeMemory
723385rnl42Measures (CEOI22_measures)C++14
0 / 100
1558 ms440 KiB
#include <bits/stdc++.h> using namespace std; int N, M, D; vector<int> A; int ans = 0; int main() { ios::sync_with_stdio(false), cout.tie(0), cin.tie(0); cin >> N >> M >> D; A.resize(N); for (int i = 0; i < N; i++) { cin >> A[i]; } int in; for (int i = 0; i < M; i++) { cin >> in; auto it = lower_bound(A.begin(), A.end(), in); A.insert(it, in); int ans = 0; for (int i = 0; i < (int)A.size(); i++) { for (int j = i+1; j < (int)A.size(); j++) { ans = max(ans, (j-i)*D-(A[j]-A[i])); } } cout << (ans>>1); if (ans & 1) cout << ".5"; cout << (i == M-1 ? '\n' : ' '); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...