Submission #940681

#	Time	Username	Problem	Language	Result	Execution time	Memory
940681		TAhmed33	Let's Win the Election (JOI22_ho_t3)	C++98	56 / 100	2556 ms	952 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
const ld inf = 1e16;
int n, k; 
const int MAXN = 501;
pair <int, int> a[MAXN];
int main () {
	cin >> n >> k;
	for (int i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;
	cout << fixed << setprecision(9);
	sort(a + 1, a + n + 1, [&] (pair <int, int> &x, pair <int, int> &y) {
		return x.second < y.second;
	});
	ld mn = 1e18;
	for (int sze = 0; sze <= k; sze++) {
		ld dp[2][sze + 1][k - sze + 1];
		for (int j = 0; j <= sze; j++) {
			for (int z = 0; z <= k - sze; z++) {
				dp[0][j][z] = inf;
			}
		}
		dp[0][0][0] = 0;
		for (int i = 1, c = 1; i <= n; i++, c ^= 1) {
			for (int j = 0; j <= sze; j++) {
				for (int l = 0; l <= k - sze; l++) {
					dp[c][j][l] = dp[c ^ 1][j][l];
					if (j && a[i].second != -1) {
						dp[c][j][l] = min(dp[c][j][l], dp[c ^ 1][j - 1][l] + 1.0 * a[i].second / j);
					}
					if (l) {
						dp[c][j][l] = min(dp[c][j][l], dp[c ^ 1][j][l - 1] + 1.0 * a[i].first / (sze + 1));
					}
				}
			}
		}
		mn = min(mn, dp[n & 1][sze][k - sze]);
	}
	cout << mn << '\n';
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 11 / 11
• Subtask 4: 12 / 12
• Subtask 5: 33 / 33
• Subtask 6: 0 / 11
• Subtask 7: 0 / 23