Submission #733452

#	Time	Username	Problem	Language	Result	Execution time	Memory
733452		shoryu386	Let's Win the Election (JOI22_ho_t3)	C++17	0 / 100	337 ms	36492 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define db long double

#define MAX 102
db dp[MAX][MAX][MAX];
int n, k;
 
pair<db, db> info[MAX];

vector<pair<db, db>> cringe;
 
bool cmp(pair<db, db> a, pair<db, db> b){
	if (a.second == -1) a.second = 1000000000;
	if (b.second == -1) b.second = 1000000000;
	
	return a.second < b.second;
	
}
 
db recur(int idx, int colabCount, int voteCount){
	if (idx == n && voteCount >= k) return 0;
	else if (idx == n) return 1000000000;
	
	if (dp[idx][colabCount][voteCount] != -1) return dp[idx][colabCount][voteCount];
	if (cringe[idx].second == -1) return dp[idx][colabCount][voteCount] = min(recur(idx+1, colabCount, voteCount), recur(idx+1, colabCount, voteCount+1) + cringe[idx].first/colabCount);
	return dp[idx][colabCount][voteCount] = min({recur(idx+1, colabCount, voteCount), recur(idx+1, colabCount, voteCount+1) + cringe[idx].first/colabCount, recur(idx+1, colabCount+1, voteCount+1) + cringe[idx].second/colabCount});
}

bool anticmp(pair<db, db> a, pair<db, db> b){
	if (a.second == -1) a.second = -1000000000;
	if (b.second == -1) b.second = -1000000000;
	
	return a.second - a.first > b.second - a.first;
	
}

signed main(){

	cin >> n >> k;
	
	for (int x = 0; x < n; x++) cin >> info[x].first >> info[x].second;
	
	db ans = 1000000000000000LL;
	for (int x = 0; x <= n; x++){
		
		//make use of x colabs
		//initial sort is optimal for 0 colabs
		
		vector<pair<db, db>> colabSect;
		vector<pair<db, db>> voteSect;
		
		//wait is dp even needed
		
		for (int y = 0; y < n; y++) voteSect.push_back(info[y]);
		
		sort(voteSect.begin(), voteSect.end(), anticmp); //give cheapest
		
		//find which to use as colab
		
		
		for (int y = 0; y < x; y++){
			colabSect.push_back(voteSect.back()); 
			
			//cout << voteSect.back().first << ' ' << voteSect.back().second << '\n';
			
			voteSect.pop_back();
			
		}
		//cout << '\n' << '\n';
		
		sort(voteSect.begin(), voteSect.end()); //return to cheapest votes
		
		cringe.clear();
		for (auto x : colabSect) cringe.push_back(x);
		for (auto x : voteSect) cringe.push_back(x);
		for (int x = 0; x <= n; x++) for (int y = 0; y <= n+1; y++) for (int z = 0; z <= n; z++) dp[x][y][z] = -1;
		
		ans = min(ans, recur(0, 1, 0));
	}
	cout << std::setprecision(9) << ans;
}

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