답안 #863888

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
863888	2023-10-21T10:38:44 Z	phoenix0423	Let's Win the Election (JOI22_ho_t3)	C++17	66 / 100	2500 ms	3028 KB

Main

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<double, double> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define lowbit(x) x&-x
const int maxn = 2e5 + 5;
const double INF = 1e18;

//enumerate number of b from 0 ... k - 1
//it is optimal to get collaboraters first then give speeches to k - #b people
//for a set of collaboraters, it is optimal to sort them by increasing bs

int main(void){
	fastio;
	int n, k;
	cin>>n>>k;
	vector<pll> a(n);
	for(int i = 0; i < n; i++){
		cin>>a[i].f>>a[i].s;
		if(a[i].s == -1) a[i].s = INF;
	}
	sort(a.begin(), a.end(), [&](pll a, pll b){ return a.s < b.s || (a.s == b.s && a.f < b.f);});
	double best = INF;
	for(int goal = 0; goal < k; goal++){ // enumerate number of collaboraters(can also tenary search)
		vector<vector<double>> dp(n + 1, vector<double>(k + 1, INF));
		dp[0][0] = 0;
		for(int i = 0; i < n; i++){
			for(int j = 0; j < goal; j++){
				dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + a[i].f / (goal + 1));
				dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + a[i].s / (j + 1));
			}
		}
		for(int i = 0; i <= n; i++){
			//choose k - i elements for second set
			vector<double> cand;
			for(int j = i; j < n; j++) cand.pb(a[j].f);
			sort(cand.begin(), cand.end());
			double cur = dp[i][goal];
			for(int j = 0; j < k - i; j++) cur += cand[j] / (goal + 1);
			best = min(best, cur);
		}
	}
	cout<<fixed<<setprecision(5)<<best<<"\n";
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	74 ms	604 KB	Output is correct
6	Correct	193 ms	960 KB	Output is correct
7	Correct	430 ms	1380 KB	Output is correct
8	Correct	828 ms	2484 KB	Output is correct
9	Correct	1267 ms	3012 KB	Output is correct
10	Correct	639 ms	1916 KB	Output is correct

Subtask #2
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	74 ms	604 KB	Output is correct
6	Correct	193 ms	960 KB	Output is correct
7	Correct	430 ms	1380 KB	Output is correct
8	Correct	828 ms	2484 KB	Output is correct
9	Correct	1267 ms	3012 KB	Output is correct
10	Correct	639 ms	1916 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	244 ms	1060 KB	Output is correct
13	Correct	403 ms	1052 KB	Output is correct
14	Correct	349 ms	1052 KB	Output is correct
15	Correct	747 ms	2140 KB	Output is correct
16	Correct	1149 ms	2136 KB	Output is correct
17	Correct	1073 ms	2140 KB	Output is correct
18	Correct	1282 ms	2712 KB	Output is correct
19	Correct	1801 ms	2852 KB	Output is correct
20	Correct	1492 ms	2760 KB	Output is correct

Subtask #3
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct

Subtask #4
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	460 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	0 ms	456 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	344 KB	Output is correct
40	Correct	1 ms	344 KB	Output is correct

Subtask #5
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	460 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	0 ms	456 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	344 KB	Output is correct
40	Correct	1 ms	344 KB	Output is correct
41	Correct	3 ms	344 KB	Output is correct
42	Correct	3 ms	344 KB	Output is correct
43	Correct	4 ms	348 KB	Output is correct
44	Correct	5 ms	488 KB	Output is correct
45	Correct	7 ms	348 KB	Output is correct
46	Correct	8 ms	348 KB	Output is correct
47	Correct	10 ms	348 KB	Output is correct
48	Correct	10 ms	348 KB	Output is correct
49	Correct	13 ms	348 KB	Output is correct
50	Correct	12 ms	344 KB	Output is correct
51	Correct	17 ms	348 KB	Output is correct
52	Correct	17 ms	544 KB	Output is correct
53	Correct	10 ms	348 KB	Output is correct
54	Correct	11 ms	516 KB	Output is correct
55	Correct	12 ms	604 KB	Output is correct
56	Correct	9 ms	344 KB	Output is correct
57	Correct	8 ms	348 KB	Output is correct
58	Correct	8 ms	348 KB	Output is correct
59	Correct	6 ms	344 KB	Output is correct
60	Correct	6 ms	348 KB	Output is correct

Subtask #6
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2545 ms	3028 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	74 ms	604 KB	Output is correct
6	Correct	193 ms	960 KB	Output is correct
7	Correct	430 ms	1380 KB	Output is correct
8	Correct	828 ms	2484 KB	Output is correct
9	Correct	1267 ms	3012 KB	Output is correct
10	Correct	639 ms	1916 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	244 ms	1060 KB	Output is correct
13	Correct	403 ms	1052 KB	Output is correct
14	Correct	349 ms	1052 KB	Output is correct
15	Correct	747 ms	2140 KB	Output is correct
16	Correct	1149 ms	2136 KB	Output is correct
17	Correct	1073 ms	2140 KB	Output is correct
18	Correct	1282 ms	2712 KB	Output is correct
19	Correct	1801 ms	2852 KB	Output is correct
20	Correct	1492 ms	2760 KB	Output is correct
21	Correct	0 ms	344 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	344 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	460 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	1 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	1 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	0 ms	456 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct
55	Correct	0 ms	348 KB	Output is correct
56	Correct	0 ms	348 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	344 KB	Output is correct
60	Correct	1 ms	344 KB	Output is correct
61	Correct	3 ms	344 KB	Output is correct
62	Correct	3 ms	344 KB	Output is correct
63	Correct	4 ms	348 KB	Output is correct
64	Correct	5 ms	488 KB	Output is correct
65	Correct	7 ms	348 KB	Output is correct
66	Correct	8 ms	348 KB	Output is correct
67	Correct	10 ms	348 KB	Output is correct
68	Correct	10 ms	348 KB	Output is correct
69	Correct	13 ms	348 KB	Output is correct
70	Correct	12 ms	344 KB	Output is correct
71	Correct	17 ms	348 KB	Output is correct
72	Correct	17 ms	544 KB	Output is correct
73	Correct	10 ms	348 KB	Output is correct
74	Correct	11 ms	516 KB	Output is correct
75	Correct	12 ms	604 KB	Output is correct
76	Correct	9 ms	344 KB	Output is correct
77	Correct	8 ms	348 KB	Output is correct
78	Correct	8 ms	348 KB	Output is correct
79	Correct	6 ms	344 KB	Output is correct
80	Correct	6 ms	348 KB	Output is correct
81	Execution timed out	2545 ms	3028 KB	Time limit exceeded
82	Halted	0 ms	0 KB	-

답안 #863888

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 5.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
5.0 / 5.0

Subtask #2
5.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