oj.uz

Submission #594662

# Submission time Handle Problem Language Result Execution time Memory
594662 2022-07-12T19:26:16 Z 1ne Let's Win the Election (JOI22_ho_t3) C++14
10 / 100
 1460 ms 8476 KB 
#include<bits/stdc++.h>
using namespace std;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	double long n,k;cin>>n>>k;
	vector<pair<double long,double long>>arr,temp;
	for (int i = 0;i<n;++i){
		double long x,y;cin>>x>>y;
		if (y == -1){
			y = 1e7;
		}
		arr.push_back({x,y});
	}
	sort(arr.begin(),arr.end(),[&](auto x,auto y){
		if (x.second == y.second)return x.first < y.first;
		return x.second < y.second;
	});
	for (auto x:temp)arr.push_back(x);
	double long mxn = 1e15;
	vector<vector<double long>>dp(n + 1,vector<double long>(n + 2,mxn));
	dp[0][0] = 0.0;
	for (int i = 0;i<n;++i){
		vector<vector<double long>>cur_dp(n + 1,vector<double long>(n + 2,mxn));
		for (int j = 0;j<=i;++j){
			for (int p = 0;p <= j + 1;++p){
				cur_dp[j][p] = min(cur_dp[j][p],dp[j][p]);
				cur_dp[j + 1][p + 1] = min(cur_dp[j + 1][p + 1],dp[j + 1][p + 1]);
				cur_dp[j + 1][p] = min(cur_dp[j + 1][p],dp[j + 1][p]);
				if (arr[i].second!=-1){
					cur_dp[j + 1][p + 1] = min(dp[j][p] + (double long)(arr[i].second / (p + 1)),cur_dp[j + 1][p + 1]);
				}
				cur_dp[j + 1][p] =  min(cur_dp[j + 1][p],dp[j][p] + (double long)(arr[i].first / (p + 1)));
			}
		}
		swap(cur_dp,dp);
	}
	double long ans = mxn;
	for (int i = 0;i<=n;++i){
		ans = min(ans,dp[k][i]);
	}
	cout<<fixed<<setprecision(15)<<ans<<'\n';
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1016 ms 8432 KB Output is correct
6 Correct 1022 ms 8384 KB Output is correct
7 Correct 1059 ms 8416 KB Output is correct
8 Correct 1016 ms 8460 KB Output is correct
9 Correct 1030 ms 8464 KB Output is correct
10 Correct 1032 ms 8388 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1016 ms 8432 KB Output is correct
6 Correct 1022 ms 8384 KB Output is correct
7 Correct 1059 ms 8416 KB Output is correct
8 Correct 1016 ms 8460 KB Output is correct
9 Correct 1030 ms 8464 KB Output is correct
10 Correct 1032 ms 8388 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1022 ms 8476 KB Output is correct
13 Correct 1018 ms 8452 KB Output is correct
14 Correct 991 ms 8388 KB Output is correct
15 Correct 1034 ms 8468 KB Output is correct
16 Correct 1134 ms 8376 KB Output is correct
17 Correct 1202 ms 8448 KB Output is correct
18 Correct 1194 ms 8392 KB Output is correct
19 Correct 1140 ms 8388 KB Output is correct
20 Correct 1223 ms 8356 KB Output is correct

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 33.0

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

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1460 ms 8420 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1016 ms 8432 KB Output is correct
6 Correct 1022 ms 8384 KB Output is correct
7 Correct 1059 ms 8416 KB Output is correct
8 Correct 1016 ms 8460 KB Output is correct
9 Correct 1030 ms 8464 KB Output is correct
10 Correct 1032 ms 8388 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1022 ms 8476 KB Output is correct
13 Correct 1018 ms 8452 KB Output is correct
14 Correct 991 ms 8388 KB Output is correct
15 Correct 1034 ms 8468 KB Output is correct
16 Correct 1134 ms 8376 KB Output is correct
17 Correct 1202 ms 8448 KB Output is correct
18 Correct 1194 ms 8392 KB Output is correct
19 Correct 1140 ms 8388 KB Output is correct
20 Correct 1223 ms 8356 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Incorrect 1 ms 212 KB Output isn't correct
30 Halted 0 ms 0 KB -