oj.uz

Submission #733442

# Submission time Handle Problem Language Result Execution time Memory
733442 2023-04-30T18:08:43 Z shoryu386 Let's Win the Election (JOI22_ho_t3) C++17
10 / 100
 511 ms 988640 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define db double

#define MAX 502
db dp[MAX][MAX][MAX];
int n, k;

pair<db, db> info[MAX];

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) return 0;
	else if (idx == n) return 1000000000;
	
	if (dp[idx][colabCount][voteCount] != -1) return dp[idx][colabCount][voteCount];
	if (info[idx].second == -1) return dp[idx][colabCount][voteCount] = min(recur(idx+1, colabCount, voteCount), recur(idx+1, colabCount, voteCount+1) + info[idx].first/colabCount);
	return dp[idx][colabCount][voteCount] = min({recur(idx+1, colabCount, voteCount), recur(idx+1, colabCount, voteCount+1) + info[idx].first/colabCount, recur(idx+1, colabCount+1, voteCount+1) + info[idx].second/colabCount});
}

main(){

	cin >> n >> k;
	
	for (int x = 0; x < n; x++) cin >> info[x].first >> info[x].second;
	
	sort(info, info+n);
	
	//for (int x = 0; x < n; x++) cout << info[x].first << ' ' << info[x].second << '\n';

	
	for (int x = 0; x <= n; x++) for (int y = 0; y <= n+1; y++) for (int z = 0; z <= n; z++) dp[x][y][z] = -1;
	
	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(), cmp); //give cheapest
		
		for (int y = 0; y < x; y++){
			colabSect.push_back(voteSect.back()); voteSect.pop_back();
		}
		
		if (colabSect.size() != 0 && colabSect.back().second == -1) break;
		
		sort(voteSect.begin(), voteSect.end()); //return to cheapest votes
		
		int votesNeeded = max(k - (int)colabSect.size(), 0LL);
		int colabCount = 1;
		db curAns = 0;
		for (auto y : colabSect){
			curAns += y.second/colabCount; colabCount++;
		}
		
		for (int y = 0; y < votesNeeded; y++){
			curAns += voteSect[y].first/colabCount;
		}
		
		ans = min(curAns, ans);
	}
	cout << std::setprecision(9) << ans;
}

Compilation message

Main.cpp:30:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   30 | main(){
      | ^~~~

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 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 412 ms 988504 KB Output is correct
6 Correct 430 ms 988640 KB Output is correct
7 Correct 416 ms 988496 KB Output is correct
8 Correct 412 ms 988572 KB Output is correct
9 Correct 439 ms 988560 KB Output is correct
10 Correct 413 ms 988548 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 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 412 ms 988504 KB Output is correct
6 Correct 430 ms 988640 KB Output is correct
7 Correct 416 ms 988496 KB Output is correct
8 Correct 412 ms 988572 KB Output is correct
9 Correct 439 ms 988560 KB Output is correct
10 Correct 413 ms 988548 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 431 ms 988592 KB Output is correct
13 Correct 471 ms 988516 KB Output is correct
14 Correct 458 ms 988528 KB Output is correct
15 Correct 433 ms 988596 KB Output is correct
16 Correct 440 ms 988580 KB Output is correct
17 Correct 423 ms 988596 KB Output is correct
18 Correct 427 ms 988492 KB Output is correct
19 Correct 431 ms 988596 KB Output is correct
20 Correct 417 ms 988540 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Incorrect 1 ms 596 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 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Incorrect 1 ms 596 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 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Incorrect 1 ms 596 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 511 ms 988496 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 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 412 ms 988504 KB Output is correct
6 Correct 430 ms 988640 KB Output is correct
7 Correct 416 ms 988496 KB Output is correct
8 Correct 412 ms 988572 KB Output is correct
9 Correct 439 ms 988560 KB Output is correct
10 Correct 413 ms 988548 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 431 ms 988592 KB Output is correct
13 Correct 471 ms 988516 KB Output is correct
14 Correct 458 ms 988528 KB Output is correct
15 Correct 433 ms 988596 KB Output is correct
16 Correct 440 ms 988580 KB Output is correct
17 Correct 423 ms 988596 KB Output is correct
18 Correct 427 ms 988492 KB Output is correct
19 Correct 431 ms 988596 KB Output is correct
20 Correct 417 ms 988540 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Incorrect 1 ms 596 KB Output isn't correct
30 Halted 0 ms 0 KB -