답안 #863836

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
863836	2023-10-21T08:42:52 Z	phoenix0423	Let's Win the Election (JOI22_ho_t3)	C++17	10 / 100	572 ms	2460 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;

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;});
	vector<vector<double>> dp(n + 5, vector<double>(n + 5, INF));
	dp[0][1] = 0;
	for(int i = 0; i < n; i++){
		auto [v0, v1] = a[i];
		for(int j = k - 1; j >= 0; j--){
			for(int cnt = 1; cnt <= k; cnt++){
				dp[j + 1][cnt] = min(dp[j + 1][cnt], dp[j][cnt] + v0 / cnt);
				dp[j + 1][cnt + 1] = min(dp[j + 1][cnt + 1], dp[j][cnt] + v1 / cnt);
			}
		}
	}
	double ans = INF;
	for(int cnt = 1; cnt <= k; cnt++){
		ans = min(ans, dp[k][cnt]);
	}
	cout<<fixed<<setprecision(5)<<ans<<"\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	7 ms	2396 KB	Output is correct
6	Correct	36 ms	2396 KB	Output is correct
7	Correct	142 ms	2456 KB	Output is correct
8	Correct	313 ms	2460 KB	Output is correct
9	Correct	559 ms	2456 KB	Output is correct
10	Correct	289 ms	2456 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	7 ms	2396 KB	Output is correct
6	Correct	36 ms	2396 KB	Output is correct
7	Correct	142 ms	2456 KB	Output is correct
8	Correct	313 ms	2460 KB	Output is correct
9	Correct	559 ms	2456 KB	Output is correct
10	Correct	289 ms	2456 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	52 ms	2396 KB	Output is correct
13	Correct	55 ms	2396 KB	Output is correct
14	Correct	51 ms	2396 KB	Output is correct
15	Correct	273 ms	2396 KB	Output is correct
16	Correct	274 ms	2452 KB	Output is correct
17	Correct	277 ms	2460 KB	Output is correct
18	Correct	571 ms	2396 KB	Output is correct
19	Correct	554 ms	2396 KB	Output is correct
20	Correct	559 ms	2452 KB	Output is correct

Subtask #3

0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Incorrect	1 ms	348 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #4

0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Incorrect	1 ms	348 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #5

0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Incorrect	1 ms	348 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #6

0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	572 ms	2392 KB	Output isn't correct
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	7 ms	2396 KB	Output is correct
6	Correct	36 ms	2396 KB	Output is correct
7	Correct	142 ms	2456 KB	Output is correct
8	Correct	313 ms	2460 KB	Output is correct
9	Correct	559 ms	2456 KB	Output is correct
10	Correct	289 ms	2456 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	52 ms	2396 KB	Output is correct
13	Correct	55 ms	2396 KB	Output is correct
14	Correct	51 ms	2396 KB	Output is correct
15	Correct	273 ms	2396 KB	Output is correct
16	Correct	274 ms	2452 KB	Output is correct
17	Correct	277 ms	2460 KB	Output is correct
18	Correct	571 ms	2396 KB	Output is correct
19	Correct	554 ms	2396 KB	Output is correct
20	Correct	559 ms	2452 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Incorrect	1 ms	348 KB	Output isn't correct
30	Halted	0 ms	0 KB	-