oj.uz

Submission #733688

# Submission time Handle Problem Language Result Execution time Memory
733688 2023-05-01T08:06:32 Z shoryu386 Let's Win the Election (JOI22_ho_t3) C++17
11 / 100
 353 ms 36580 KB 
#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];

vector<pair<db, db>> cringe;

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){
	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});
}

bool anticmp(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 - a.first > b.second - a.first;
	
}

signed main(){

	cin >> n >> k;
	
	for (int x = 0; x < n; x++) cin >> info[x].first >> info[x].second;
	
	db ans = 1000000000000000LL;
	for (int x = 0; x <= n; x++){
		
		//make use of x colabs
		//initial sort is optimal for 0 colabs
		
		vector<pair<db, db>> colabSect;
		vector<pair<db, db>> voteSect;
		
		//wait is dp even needed
		
		for (int y = 0; y < n; y++) voteSect.push_back(info[y]);
		
		sort(voteSect.begin(), voteSect.end(), anticmp); //give cheapest
		
		//find which to use as colab
		
		
		for (int y = 0; y < x; y++){
			colabSect.push_back(voteSect.back()); 
			
			//cout << voteSect.back().first << ' ' << voteSect.back().second << '\n';
			
			voteSect.pop_back();
			
		}
		//cout << '\n' << '\n';
		
		sort(voteSect.begin(), voteSect.end()); //return to cheapest votes
		
		cringe.clear();
		for (auto y : colabSect) cringe.push_back(y);
		for (auto y : voteSect) cringe.push_back(y);
		
		
		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 1 ms 304 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 312 ms 36472 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 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 312 ms 36472 KB Execution killed with signal 11
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 1 ms 340 KB Output is correct
3 Correct 1 ms 432 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 432 KB Output is correct
7 Correct 1 ms 432 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 432 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 432 KB Output is correct
7 Correct 1 ms 432 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 1108 KB Output is correct
17 Correct 2 ms 1076 KB Output is correct
18 Correct 3 ms 1124 KB Output is correct
19 Correct 4 ms 1108 KB Output is correct
20 Incorrect 2 ms 1108 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 432 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 432 KB Output is correct
7 Correct 1 ms 432 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 440 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 1108 KB Output is correct
17 Correct 2 ms 1076 KB Output is correct
18 Correct 3 ms 1124 KB Output is correct
19 Correct 4 ms 1108 KB Output is correct
20 Incorrect 2 ms 1108 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 353 ms 36580 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 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 312 ms 36472 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -