oj.uz

Submission #723334

# Submission time Handle Problem Language Result Execution time Memory
723334 2023-04-13T15:45:27 Z mimmocostes Measures (CEOI22_measures) C++14
0 / 100
 1500 ms 1104 KB 
#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;
	}
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 212 KB Output is correct
2 Correct 22 ms 212 KB Output is correct
3 Correct 23 ms 212 KB Output is correct
4 Correct 25 ms 212 KB Output is correct
5 Correct 23 ms 212 KB Output is correct
6 Correct 23 ms 212 KB Output is correct
7 Correct 22 ms 212 KB Output is correct
8 Incorrect 23 ms 316 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 212 KB Output is correct
2 Correct 22 ms 212 KB Output is correct
3 Correct 23 ms 212 KB Output is correct
4 Correct 25 ms 212 KB Output is correct
5 Correct 23 ms 212 KB Output is correct
6 Correct 23 ms 212 KB Output is correct
7 Correct 22 ms 212 KB Output is correct
8 Incorrect 23 ms 316 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1543 ms 1104 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1543 ms 1104 KB Time limit exceeded
2 Halted 0 ms 0 KB -