//#pragma optimize("Ofast")
//#pragma optimize("unroll-loops")
//#pragma traget("avx,avx2")
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define el '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define point pair <ll, ll>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
#include <random>
mt19937 rnd(time(0));
const ll INF = 1e18 + 10;
const ll inf = 1e9 + 10;
const ll N = 1e6 + 10;
const ll mod = 1e9 + 7;
const ll LOG = 20;
const ll K = 1e3 + 20;
ld dp[510][510][510];
void solve() {
ll n, k;
cin >> n >> k;
vector <ll> a(n), b(n);
for (ll i = 0; i < n; i++) {
cin >> a[i] >> b[i];
if (b[i] == -1) b[i] = inf;
}
vector <ll> order;
for (ll i = 0; i < n; i++)
order.pb(i);
sort(all(order), [&](const ll &i, const ll &j) -> bool {
if (b[i] == b[j])
return a[i] < a[j];
return b[i] < b[j];
});
for (ll i = 0; i <= n; i++)
for (ll j = 0; j <= n; j++)
for (ll x = 0; x <= n; x++)
dp[i][j][x] = inf;
dp[0][0][1] = 0;
for (ll i = 1; i <= n; i++) {
for (ll j = 0; j <= k; j++) {
for (ll cnt = 1; cnt <= j + 1; cnt++) {
dp[i][j][cnt] = dp[i - 1][j][cnt];
if (j == 0)
continue;
dp[i][j][cnt] = min(dp[i][j][cnt], dp[i - 1][j - 1][cnt] + (ld)a[order[i - 1]] / (ld)cnt);
if (b[order[i - 1]] != inf)
dp[i][j][cnt] = min(dp[i][j][cnt], dp[i - 1][j - 1][cnt - 1] + (ld)b[order[i - 1]] / (ld)(cnt - 1));
}
}
}
ld ans = inf;
for (ll i = 0; i <= n; i++)
ans = min(ans, dp[n][k][i]);
cout << fixed << setprecision(5) << ans << el;
return;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int tests = 1;
//cin >> tests;
while (tests--)
solve();
return 0;
}
/*
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4576 KB |
Output is correct |
| 3 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 4 |
Correct |
1 ms |
8540 KB |
Output is correct |
| 5 |
Runtime error |
566 ms |
1048580 KB |
Execution killed with signal 9 |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4576 KB |
Output is correct |
| 3 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 4 |
Correct |
1 ms |
8540 KB |
Output is correct |
| 5 |
Runtime error |
566 ms |
1048580 KB |
Execution killed with signal 9 |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
14684 KB |
Output is correct |
| 2 |
Correct |
2 ms |
14852 KB |
Output is correct |
| 3 |
Correct |
2 ms |
14684 KB |
Output is correct |
| 4 |
Correct |
1 ms |
14684 KB |
Output is correct |
| 5 |
Correct |
1 ms |
14684 KB |
Output is correct |
| 6 |
Correct |
2 ms |
14684 KB |
Output is correct |
| 7 |
Correct |
1 ms |
14684 KB |
Output is correct |
| 8 |
Correct |
1 ms |
14684 KB |
Output is correct |
| 9 |
Incorrect |
2 ms |
14808 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
14684 KB |
Output is correct |
| 2 |
Correct |
2 ms |
14852 KB |
Output is correct |
| 3 |
Correct |
2 ms |
14684 KB |
Output is correct |
| 4 |
Correct |
1 ms |
14684 KB |
Output is correct |
| 5 |
Correct |
1 ms |
14684 KB |
Output is correct |
| 6 |
Correct |
2 ms |
14684 KB |
Output is correct |
| 7 |
Correct |
1 ms |
14684 KB |
Output is correct |
| 8 |
Correct |
1 ms |
14684 KB |
Output is correct |
| 9 |
Incorrect |
2 ms |
14808 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
14684 KB |
Output is correct |
| 2 |
Correct |
2 ms |
14852 KB |
Output is correct |
| 3 |
Correct |
2 ms |
14684 KB |
Output is correct |
| 4 |
Correct |
1 ms |
14684 KB |
Output is correct |
| 5 |
Correct |
1 ms |
14684 KB |
Output is correct |
| 6 |
Correct |
2 ms |
14684 KB |
Output is correct |
| 7 |
Correct |
1 ms |
14684 KB |
Output is correct |
| 8 |
Correct |
1 ms |
14684 KB |
Output is correct |
| 9 |
Incorrect |
2 ms |
14808 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
533 ms |
1048576 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4576 KB |
Output is correct |
| 3 |
Correct |
1 ms |
6492 KB |
Output is correct |
| 4 |
Correct |
1 ms |
8540 KB |
Output is correct |
| 5 |
Runtime error |
566 ms |
1048580 KB |
Execution killed with signal 9 |
| 6 |
Halted |
0 ms |
0 KB |
- |
