Submission #831966

#	Time	Username	Problem	Language	Result	Execution time	Memory
831966		jmyszka2007	Let's Win the Election (JOI22_ho_t3)	C++17	0 / 100	389 ms	1048576 KiB

Main

#include <bits/stdc++.h>
#include <fstream>
using namespace std;
template<class A, class B>
ostream& operator<<(ostream& o, const pair<A, B>& p) {return o << '(' << p.first << ", " << p.second << ')';}
template<size_t Index = 0, typename... Types>
ostream& printTupleElements(ostream& o, const tuple<Types...>& t) {if constexpr (Index < sizeof...(Types)){if(Index > 0){o << ", ";}o << get<Index>(t);printTupleElements<Index + 1>(o, t);}return o;}
template<typename... Types>
ostream& operator<<(ostream& o, const tuple<Types...>& t){o << "(";printTupleElements(o, t);return o << ")";}
template<class T>
auto operator<<(ostream& o, const T& x) -> decltype(x.end(), o){o << '{';bool first = true;for (const auto& e : x){if (!first){o << ", ";}o << e;first = false;} return o << '}';}
#define DEBUG
#ifdef DEBUG
#define fastio()
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
#define check(x) if (!(x)) { cerr << "Check failed: " << #x << " in line " << __LINE__ << endl; exit(1); }
#else
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0);
#define debug(...)
#define check(x) 
#endif
typedef long long ll;
typedef long double ld;
#define pi pair<int, int>
#define pl pair<ll, ll>
#define st first
#define nd second
#define vi vector<int>
#define vll vector<ll>
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
void solve() {
	//ifstream cin("nazwa.in");
	//ofstream cout("nazwa.out");
	int n, k;
	cin >> n >> k;
	vector<pi>sor;
	int sum = 0;
	for(int i = 1; i <= n; i++) {
		int a, b;
		cin >> a >> b;
		sor.eb(b, a);
		sum += a;
	}
	sort(all(sor));
	vector<vector<ld> >dp(n + 1, vector<ld>(sum + 1, 1e9));
	dp[0][0] = 0;
	int ile = 0;
	for(auto [b, a] : sor) {
		ile++;
		for(int i = ile; i >= 1; i--) {
			for(int j = sum; j >= a; j--) {
				dp[i][j] = min(dp[i][j], dp[i - 1][j - a] + (ld)b / (ld)i);
			}
		}
	}
	ld ans = 1e9;
	for(int i = 0; i <= n; i++) {
		for(int j = 0; j <= sum; j++) {
			ans = min(ans, dp[i][j] + (ld)(sum - j) / (ld)(i + 1));
		}
	}
	cout.precision(9);
	cout << fixed << ans << '\n';
}
int main() {
	fastio();
	int t;
	//cin >> t;
	t = 1;	
	while(t--) {
		solve();
	}
}

• 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