Submission #723334

#TimeUsernameProblemLanguageResultExecution timeMemory
723334mimmocostesMeasures (CEOI22_measures)C++14
0 / 100
1543 ms1104 KiB
#include <bits/stdc++.h> using namespace std; int N, M, D; vector<int> initial; vector<int> added; string half (int N) { if (N%2 == 0) { return to_string(N/2); } else { return to_string(N/2)+".5"; } } int main () { cin >> N >> M >> D; initial.resize(N); added.resize(M); for (int i=0; i<N; i++) cin >> initial[i]; for (int i=0; i<M; i++) cin >> added[i]; //sort(added.begin(), added.end()); for (int k=0; k<M; k++) { initial.push_back(added[k]); sort(initial.begin(), initial.end()); int M = 0; for (int i=0; i<N+k+1; i++) { for (int j=i+1; j<N+k+1; j++) { M = max(M, D*(j-i) - (initial[j]-initial[i])); } } cout << half(M) << endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...