제출 #723340

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
723340		mimmocostes	Measures (CEOI22_measures)	C++14	0 / 100	1532 ms	2280 KiB

Main

#include <bits/stdc++.h>

using namespace std;

int N, M, D;
vector<long long> initial;
vector<long long> added;

string half (long long 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());

		long long 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
• Subtask 2: 0 / 14
• Subtask 3: 0 / 35
• Subtask 4: 0 / 41