oj.uz

Submission #733717

# Submission time Handle Problem Language Result Execution time Memory
733717 2023-05-01T08:26:38 Z shoryu386 Let's Win the Election (JOI22_ho_t3) C++17
56 / 100
 496 ms 1048576 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define db long double

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

int maxcolab;
 
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){
	#define cringe info
	if (idx == n && voteCount >= k && maxcolab == colabCount) 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/maxcolab);
	return dp[idx][colabCount][voteCount] = min({recur(idx+1, colabCount, voteCount), recur(idx+1, colabCount, voteCount+1) + cringe[idx].first/maxcolab, recur(idx+1, colabCount+1, voteCount+1) + cringe[idx].second/colabCount});
}

db query(int x){
	for (int a = 0; a <= n; a++) for (int y = 0; y <= n+1; y++) for (int z = 0; z <= n; z++) dp[a][y][z] = -1;
	maxcolab = x;
	return recur(0, 1, 0);
}

signed main(){

	cin >> n >> k;
	
	for (int x = 0; x < n; x++) cin >> info[x].first >> info[x].second;
	
	sort(info, info+n, cmp);
	db ans = 1000000000000000LL;
	int l = 1, r = n+1;
	while (r - l >= 3){
		int m1 = l + (r-l)/3;
		int m2 = r - (r-l)/3;
		
		if (query(m1) > query(m2)){
			l = m1;
		}
		else{
			r = m2;
		}
	}
	for (int i = l; i <= r; i++){
		ans = min(ans, query(i));
	}

	cout << std::setprecision(9) << ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Runtime error 441 ms 1048576 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Runtime error 441 ms 1048576 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 564 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 572 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 596 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 564 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 572 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 3 ms 2360 KB Output is correct
17 Correct 2 ms 2388 KB Output is correct
18 Correct 3 ms 2360 KB Output is correct
19 Correct 3 ms 2388 KB Output is correct
20 Correct 3 ms 2388 KB Output is correct
21 Correct 2 ms 2388 KB Output is correct
22 Correct 3 ms 2388 KB Output is correct
23 Correct 3 ms 2388 KB Output is correct
24 Correct 2 ms 2388 KB Output is correct
25 Correct 2 ms 2388 KB Output is correct
26 Correct 2 ms 2388 KB Output is correct
27 Correct 2 ms 2388 KB Output is correct
28 Correct 2 ms 2360 KB Output is correct
29 Correct 2 ms 2388 KB Output is correct
30 Correct 3 ms 2388 KB Output is correct
31 Correct 3 ms 2388 KB Output is correct
32 Correct 2 ms 2388 KB Output is correct
33 Correct 2 ms 2360 KB Output is correct
34 Correct 2 ms 2388 KB Output is correct
35 Correct 2 ms 2388 KB Output is correct
36 Correct 2 ms 2388 KB Output is correct
37 Correct 2 ms 2388 KB Output is correct
38 Correct 2 ms 2388 KB Output is correct
39 Correct 2 ms 2388 KB Output is correct
40 Correct 2 ms 2388 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 564 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 572 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 3 ms 2360 KB Output is correct
17 Correct 2 ms 2388 KB Output is correct
18 Correct 3 ms 2360 KB Output is correct
19 Correct 3 ms 2388 KB Output is correct
20 Correct 3 ms 2388 KB Output is correct
21 Correct 2 ms 2388 KB Output is correct
22 Correct 3 ms 2388 KB Output is correct
23 Correct 3 ms 2388 KB Output is correct
24 Correct 2 ms 2388 KB Output is correct
25 Correct 2 ms 2388 KB Output is correct
26 Correct 2 ms 2388 KB Output is correct
27 Correct 2 ms 2388 KB Output is correct
28 Correct 2 ms 2360 KB Output is correct
29 Correct 2 ms 2388 KB Output is correct
30 Correct 3 ms 2388 KB Output is correct
31 Correct 3 ms 2388 KB Output is correct
32 Correct 2 ms 2388 KB Output is correct
33 Correct 2 ms 2360 KB Output is correct
34 Correct 2 ms 2388 KB Output is correct
35 Correct 2 ms 2388 KB Output is correct
36 Correct 2 ms 2388 KB Output is correct
37 Correct 2 ms 2388 KB Output is correct
38 Correct 2 ms 2388 KB Output is correct
39 Correct 2 ms 2388 KB Output is correct
40 Correct 2 ms 2388 KB Output is correct
41 Correct 288 ms 58168 KB Output is correct
42 Correct 267 ms 58188 KB Output is correct
43 Correct 289 ms 58276 KB Output is correct
44 Correct 257 ms 58172 KB Output is correct
45 Correct 318 ms 58168 KB Output is correct
46 Correct 292 ms 58168 KB Output is correct
47 Correct 276 ms 58204 KB Output is correct
48 Correct 254 ms 58168 KB Output is correct
49 Correct 279 ms 58172 KB Output is correct
50 Correct 254 ms 58208 KB Output is correct
51 Correct 281 ms 58164 KB Output is correct
52 Correct 263 ms 58172 KB Output is correct
53 Correct 278 ms 58168 KB Output is correct
54 Correct 296 ms 58168 KB Output is correct
55 Correct 302 ms 58168 KB Output is correct
56 Correct 284 ms 58172 KB Output is correct
57 Correct 286 ms 58168 KB Output is correct
58 Correct 305 ms 58168 KB Output is correct
59 Correct 301 ms 58204 KB Output is correct
60 Correct 287 ms 58172 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 496 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Runtime error 441 ms 1048576 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -