oj.uz

Submission #919806

# Submission time Handle Problem Language Result Execution time Memory
919806 2024-02-01T16:38:06 Z tvladm2009 Let's Win the Election (JOI22_ho_t3) C++17
100 / 100
 55 ms 4620 KB 
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <iomanip>
 
using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double; 
const string FILENAME = "input";
const int MAXN = 500 + 7;

int n, k;
pair<ld, ld> a[MAXN];
ld dp[MAXN][MAXN];

ld f(ld kek) {
	for (int i = 0; i <= n; i++) {
		for (int j = 0; j <= n; j++) {
			dp[i][j] = 1e9;
		}
	}
	dp[0][0] = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j <= i; j++) {
			ld c = i - j;
			if (i - j <= kek && i - j != 0) {
				chkmin(dp[i][j], dp[i - 1][j] + a[i].first / c);
			} else if (i - j > kek) {
				chkmin(dp[i][j], dp[i - 1][j]);
			}
			if (j >= 1) {
				chkmin(dp[i][j], dp[i - 1][j - 1] + a[i].second / (kek + 1));
			}
		}
	}	
	return dp[n][(int)(k - kek)];
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
	cout << setprecision(10) << fixed;
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].second >> a[i].first;
	}
	for (int i = 1; i <= n; i++) {
		if (a[i].first == -1) {
			a[i].first = 1e9;
		}
	}
	sort(a + 1, a + n + 1);
	int l = 1, r = k, sol = 0;
	while (l <= r) {
		int m = (l + r) >> 1;
		if (f(m) < f(m - 1)) {
			l = m + 1;
			sol = m;
		} else {
			r = m - 1;
		}
	}
	ld res = min(f(sol), f(0));
	res = (ld) ((ld) res * (ld) 1e6) / (ld) 1e6; 
	cout << res << '\n';
	return 0;				
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 24 ms 4440 KB Output is correct
6 Correct 27 ms 4444 KB Output is correct
7 Correct 37 ms 4620 KB Output is correct
8 Correct 35 ms 4440 KB Output is correct
9 Correct 35 ms 4440 KB Output is correct
10 Correct 34 ms 4440 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 24 ms 4440 KB Output is correct
6 Correct 27 ms 4444 KB Output is correct
7 Correct 37 ms 4620 KB Output is correct
8 Correct 35 ms 4440 KB Output is correct
9 Correct 35 ms 4440 KB Output is correct
10 Correct 34 ms 4440 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 40 ms 4440 KB Output is correct
13 Correct 35 ms 4440 KB Output is correct
14 Correct 38 ms 4440 KB Output is correct
15 Correct 45 ms 4440 KB Output is correct
16 Correct 41 ms 4440 KB Output is correct
17 Correct 55 ms 4444 KB Output is correct
18 Correct 49 ms 4444 KB Output is correct
19 Correct 54 ms 4440 KB Output is correct
20 Correct 42 ms 4440 KB Output is correct

Subtask #3
11.0 / 11.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 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct

Subtask #4
12.0 / 12.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 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 508 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct

Subtask #5
33.0 / 33.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 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 508 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 2 ms 2396 KB Output is correct
42 Correct 2 ms 2396 KB Output is correct
43 Correct 2 ms 2396 KB Output is correct
44 Correct 3 ms 2392 KB Output is correct
45 Correct 2 ms 2648 KB Output is correct
46 Correct 2 ms 2396 KB Output is correct
47 Correct 2 ms 2392 KB Output is correct
48 Correct 3 ms 2396 KB Output is correct
49 Correct 3 ms 2392 KB Output is correct
50 Correct 3 ms 2392 KB Output is correct
51 Correct 2 ms 2392 KB Output is correct
52 Correct 3 ms 2392 KB Output is correct
53 Correct 2 ms 2396 KB Output is correct
54 Correct 2 ms 2392 KB Output is correct
55 Correct 2 ms 2396 KB Output is correct
56 Correct 2 ms 2392 KB Output is correct
57 Correct 3 ms 2392 KB Output is correct
58 Correct 2 ms 2396 KB Output is correct
59 Correct 3 ms 2392 KB Output is correct
60 Correct 2 ms 2516 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 4440 KB Output is correct
2 Correct 47 ms 4444 KB Output is correct
3 Correct 53 ms 4440 KB Output is correct
4 Correct 53 ms 4440 KB Output is correct
5 Correct 50 ms 4440 KB Output is correct
6 Correct 51 ms 4440 KB Output is correct
7 Correct 46 ms 4440 KB Output is correct

Subtask #7
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 24 ms 4440 KB Output is correct
6 Correct 27 ms 4444 KB Output is correct
7 Correct 37 ms 4620 KB Output is correct
8 Correct 35 ms 4440 KB Output is correct
9 Correct 35 ms 4440 KB Output is correct
10 Correct 34 ms 4440 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 40 ms 4440 KB Output is correct
13 Correct 35 ms 4440 KB Output is correct
14 Correct 38 ms 4440 KB Output is correct
15 Correct 45 ms 4440 KB Output is correct
16 Correct 41 ms 4440 KB Output is correct
17 Correct 55 ms 4444 KB Output is correct
18 Correct 49 ms 4444 KB Output is correct
19 Correct 54 ms 4440 KB Output is correct
20 Correct 42 ms 4440 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 600 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 1 ms 460 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 1 ms 508 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 344 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 2 ms 2396 KB Output is correct
62 Correct 2 ms 2396 KB Output is correct
63 Correct 2 ms 2396 KB Output is correct
64 Correct 3 ms 2392 KB Output is correct
65 Correct 2 ms 2648 KB Output is correct
66 Correct 2 ms 2396 KB Output is correct
67 Correct 2 ms 2392 KB Output is correct
68 Correct 3 ms 2396 KB Output is correct
69 Correct 3 ms 2392 KB Output is correct
70 Correct 3 ms 2392 KB Output is correct
71 Correct 2 ms 2392 KB Output is correct
72 Correct 3 ms 2392 KB Output is correct
73 Correct 2 ms 2396 KB Output is correct
74 Correct 2 ms 2392 KB Output is correct
75 Correct 2 ms 2396 KB Output is correct
76 Correct 2 ms 2392 KB Output is correct
77 Correct 3 ms 2392 KB Output is correct
78 Correct 2 ms 2396 KB Output is correct
79 Correct 3 ms 2392 KB Output is correct
80 Correct 2 ms 2516 KB Output is correct
81 Correct 46 ms 4440 KB Output is correct
82 Correct 47 ms 4444 KB Output is correct
83 Correct 53 ms 4440 KB Output is correct
84 Correct 53 ms 4440 KB Output is correct
85 Correct 50 ms 4440 KB Output is correct
86 Correct 51 ms 4440 KB Output is correct
87 Correct 46 ms 4440 KB Output is correct
88 Correct 30 ms 4464 KB Output is correct
89 Correct 34 ms 4440 KB Output is correct
90 Correct 35 ms 4440 KB Output is correct
91 Correct 35 ms 4444 KB Output is correct
92 Correct 45 ms 4440 KB Output is correct
93 Correct 40 ms 4444 KB Output is correct
94 Correct 44 ms 4440 KB Output is correct
95 Correct 46 ms 4440 KB Output is correct
96 Correct 46 ms 4440 KB Output is correct
97 Correct 46 ms 4440 KB Output is correct
98 Correct 48 ms 4444 KB Output is correct
99 Correct 50 ms 4444 KB Output is correct
100 Correct 55 ms 4444 KB Output is correct
101 Correct 46 ms 4440 KB Output is correct
102 Correct 41 ms 4440 KB Output is correct
103 Correct 49 ms 4440 KB Output is correct
104 Correct 43 ms 4440 KB Output is correct
105 Correct 44 ms 4440 KB Output is correct