oj.uz

Submission #843972

# Submission time Handle Problem Language Result Execution time Memory
843972 2023-09-04T18:40:13 Z jmyszka2007 Let's Win the Election (JOI22_ho_t3) C++17
11 / 100
 324 ms 448 KB 
#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()
vector<pair<ld, ld> >prz;
int n, k;
ld cntdp(int x) {
	vector<ld>dp(k - x + 1, 1e9);
	dp[0] = 0;
	for(int i = 0; i < sz(prz); i++) {
		for(int j = min(i + 1, k - x); j >= 0; j--) {
			ld popdp = dp[j];
			if(j > 0) {
				dp[j] = dp[j - 1] + prz[i].nd / (ld)(x + 1);
			}
			else {
				dp[j] = 1e9;
			}
			if(0 < (i + 1) - j && (i + 1) - j <= x) {
				dp[j] = min(dp[j], popdp + prz[i].st / (ld)((i + 1) - j));
			}
		}
	}
	return dp[k - x];
}
void solve() {
	//ifstream cin("nazwa.in");
	//ofstream cout("nazwa.out");
	cin >> n >> k;
	for(int i = 1; i <= n; i++) {
		int a, b;
		cin >> a >> b;
		if(b == -1) {
			b = 1e9;
		}
		prz.eb(b, a);
	}
	sort(all(prz));
	ld ans = 1e9;
	for(int i = 0; i <= k; i++) {
		ans = min(ans, cntdp(i));
	}
	cout.precision(9);
	cout << fixed << ans << '\n';
}
int main() {
	fastio();
	int t;
	//cin >> t;
	t = 1;	
	while(t--) {
		solve();
	}
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 317 ms 448 KB Output is correct
2 Correct 324 ms 448 KB Output is correct
3 Correct 321 ms 440 KB Output is correct
4 Correct 322 ms 444 KB Output is correct
5 Correct 313 ms 344 KB Output is correct
6 Correct 318 ms 436 KB Output is correct
7 Correct 323 ms 436 KB Output is correct

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -