Submission #527703

#	Time	Username	Problem	Language	Result	Execution time	Memory
527703		8e7	Let's Win the Election (JOI22_ho_t3)	C++17	21 / 100	351 ms	2372 KiB

Main

//Challenge: Accepted
#include <bits/stdc++.h>
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 505
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
pii a[maxn];
const double inf = 1e9;
double dp[maxn][maxn];
int main() {
	io
	int n, k;
	cin >> n >> k;

	for (int i = 0;i < n;i++) {
		cin >> a[i].ff >> a[i].ss; 	
		if (a[i].ss == -1) a[i].ss = 1<<30;
	}
	sort(a, a + n, [&] (pii x, pii y){return (x.ss == y.ss ? x.ff > y.ff : x.ss < y.ss);});
	double ans = 1e9;
	for (int i = 0;i <= k;i++) {
		vector<pii> b;
		for (int j = n-1;j >= i;j--) {
			b.push_back(a[j]);
		}
		sort(b.begin(), b.end());
		vector<pii> v;
		for (int j = 0;j < i;j++) v.push_back(a[j]);
		for (int j = 0;j < k - i;j++) v.push_back(b[j]);
		sort(v.begin(), v.end(), [&](pii x, pii y){return x.ss < y.ss;});

		double tmp = 0;
		for (int j = 0;j < k;j++) tmp += double(v[j].ff) / (i + 1);
		for (int x = 0;x <= k;x++) {
			for (int y = 0;y <= k;y++) dp[x][y] = inf;
		}
		dp[0][0] = 0;
		for (int x = 1;x <= k;x++) {
			for (int y = 0;y <= k;y++) {
				dp[x][y] = dp[x-1][y];
				if (y) {
					dp[x][y] = min(dp[x][y], dp[x-1][y-1] - (double(v[x-1].ff)/(i+1)) + (double)v[x-1].ss/y);
				}
			}
		}
		//debug(i, cur, tmp);
		debug(dp[k][i], tmp);
		ans = min(ans, dp[k][i] + tmp);
	}
	cout << fixed << setprecision(10) << ans << "\n";
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:12:20: warning: statement has no effect [-Wunused-value]
   12 | #define debug(...) 0
      |                    ^
Main.cpp:61:3: note: in expansion of macro 'debug'
   61 |   debug(dp[k][i], tmp);
      |   ^~~~~

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