Submission #733701

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
733701	2023-05-01T08:16:42 Z	shoryu386	Let's Win the Election (JOI22_ho_t3)	C++17	56 / 100	768 ms	16844 KB

Main

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define db long double

#define MAX 102
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});
}


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;
	for (int x = 1; x <= n+1; 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;
		ans = min(ans, recur(0, 1, 0));
	}
	cout << std::setprecision(9) << ans;
}

Subtask #1
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Incorrect	4 ms	724 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #2
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Incorrect	4 ms	724 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #3
11.0 / 11.0

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

Subtask #4
12.0 / 12.0

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

Subtask #5
33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	2 ms	1108 KB	Output is correct
17	Correct	2 ms	1108 KB	Output is correct
18	Correct	2 ms	1108 KB	Output is correct
19	Correct	2 ms	1108 KB	Output is correct
20	Correct	2 ms	1108 KB	Output is correct
21	Correct	2 ms	1108 KB	Output is correct
22	Correct	2 ms	1108 KB	Output is correct
23	Correct	2 ms	1108 KB	Output is correct
24	Correct	1 ms	1108 KB	Output is correct
25	Correct	2 ms	1108 KB	Output is correct
26	Correct	2 ms	1108 KB	Output is correct
27	Correct	2 ms	1108 KB	Output is correct
28	Correct	2 ms	1108 KB	Output is correct
29	Correct	2 ms	1108 KB	Output is correct
30	Correct	3 ms	1108 KB	Output is correct
31	Correct	2 ms	1108 KB	Output is correct
32	Correct	2 ms	1108 KB	Output is correct
33	Correct	2 ms	1108 KB	Output is correct
34	Correct	2 ms	1108 KB	Output is correct
35	Correct	2 ms	1108 KB	Output is correct
36	Correct	2 ms	1108 KB	Output is correct
37	Correct	2 ms	1108 KB	Output is correct
38	Correct	2 ms	1108 KB	Output is correct
39	Correct	2 ms	1108 KB	Output is correct
40	Correct	2 ms	1108 KB	Output is correct
41	Correct	756 ms	16748 KB	Output is correct
42	Correct	705 ms	16844 KB	Output is correct
43	Correct	739 ms	16844 KB	Output is correct
44	Correct	675 ms	16740 KB	Output is correct
45	Correct	739 ms	16744 KB	Output is correct
46	Correct	710 ms	16748 KB	Output is correct
47	Correct	744 ms	16724 KB	Output is correct
48	Correct	687 ms	16748 KB	Output is correct
49	Correct	768 ms	16748 KB	Output is correct
50	Correct	681 ms	16724 KB	Output is correct
51	Correct	751 ms	16748 KB	Output is correct
52	Correct	697 ms	16756 KB	Output is correct
53	Correct	752 ms	16744 KB	Output is correct
54	Correct	755 ms	16844 KB	Output is correct
55	Correct	746 ms	16752 KB	Output is correct
56	Correct	756 ms	16760 KB	Output is correct
57	Correct	740 ms	16744 KB	Output is correct
58	Correct	755 ms	16744 KB	Output is correct
59	Correct	746 ms	16744 KB	Output is correct
60	Correct	751 ms	16756 KB	Output is correct

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Incorrect	4 ms	724 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Submission #733701

Compilation message

Subtask #1 0 / 5.0

Subtask #2 0 / 5.0

Subtask #3 11.0 / 11.0

Subtask #4 12.0 / 12.0

Subtask #5 33.0 / 33.0

Subtask #6 0 / 11.0

Subtask #7 0 / 23.0

Subtask #1
0 / 5.0

Subtask #2
0 / 5.0

Subtask #3
11.0 / 11.0

Subtask #4
12.0 / 12.0

Subtask #5
33.0 / 33.0

Subtask #6
0 / 11.0

Subtask #7
0 / 23.0