oj.uz

답안 #937946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937946 2024-03-04T17:02:29 Z vjudge1 Let's Win the Election (JOI22_ho_t3) C++17
11 / 100
 2500 ms 1048576 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
const int INF = 1e18;
mt19937 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
 
bool cmp(pair<int,int> a, pair<int,int> b){
	if(a.second == b.second) return a.first < b.first;
	return a.second < b.second;
}
 
void shuffle(vector<pair<int,int>>& v){
	int n = v.size();
	for(int i = 0; i<3*n; i++){
		int a = rng()%n; int b = rng()%n;
		swap(v[a],v[b]);
	}
 
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n,k1; cin>>n>>k1;
	vector<pair<int,int>> v(n);
	for(int i = 0; i<n; i++){
		cin>>v[i].first>>v[i].second;
		if(v[i].second == -1) v[i].second = INF;
	}
	sort(v.begin(),v.end());
	long double ans = INF;
	do{
		long double dp[n+1][k1+1][k1+1];
		for(int i = 0; i<=n; i++){
			for(int j = 0; j<=k1; j++){
				for(int k = 0; k<=k1; k++) dp[i][j][k] = INF;
			}
		}
		dp[0][0][0] = 0; // first i, j votes, k representants
		for(int i = 1; i<=n; i++){
			for(int j = 0; j<=k1; j++){
				for(int k = 0; k<=k1; k++){
					dp[i][j][k] = dp[i-1][j][k];
					if(!j) continue;
					long double act = dp[i-1][j-1][k]; // just speech for vote
					act+= 1.0*v[i-1].first/(k+1);
					dp[i][j][k] = min(dp[i][j][k],act);
					if(!k || v[i-1].second == INF) continue;
					act = dp[i-1][j-1][k-1];
					act+= 1.0*v[i-1].second / k;
					dp[i][j][k] = min(dp[i][j][k],act);
				}
			}
		}
		for(int k = 0; k<=k1; k++){
			ans = min(ans, dp[n][k1][k]);
		}
	}while(next_permutation(v.begin(),v.end()));
	cout<<setprecision(10)<<fixed<<ans<<endl;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Execution timed out 2510 ms 20824 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Execution timed out 2510 ms 20824 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 9 ms 348 KB Output is correct
4 Correct 13 ms 348 KB Output is correct
5 Correct 21 ms 452 KB Output is correct
6 Correct 26 ms 344 KB Output is correct
7 Correct 36 ms 344 KB Output is correct
8 Correct 22 ms 456 KB Output is correct
9 Correct 21 ms 452 KB Output is correct
10 Correct 22 ms 348 KB Output is correct
11 Correct 22 ms 456 KB Output is correct
12 Correct 20 ms 348 KB Output is correct
13 Correct 21 ms 452 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 35 ms 348 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 9 ms 348 KB Output is correct
4 Correct 13 ms 348 KB Output is correct
5 Correct 21 ms 452 KB Output is correct
6 Correct 26 ms 344 KB Output is correct
7 Correct 36 ms 344 KB Output is correct
8 Correct 22 ms 456 KB Output is correct
9 Correct 21 ms 452 KB Output is correct
10 Correct 22 ms 348 KB Output is correct
11 Correct 22 ms 456 KB Output is correct
12 Correct 20 ms 348 KB Output is correct
13 Correct 21 ms 452 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 35 ms 348 KB Output is correct
16 Execution timed out 2577 ms 348 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 9 ms 348 KB Output is correct
4 Correct 13 ms 348 KB Output is correct
5 Correct 21 ms 452 KB Output is correct
6 Correct 26 ms 344 KB Output is correct
7 Correct 36 ms 344 KB Output is correct
8 Correct 22 ms 456 KB Output is correct
9 Correct 21 ms 452 KB Output is correct
10 Correct 22 ms 348 KB Output is correct
11 Correct 22 ms 456 KB Output is correct
12 Correct 20 ms 348 KB Output is correct
13 Correct 21 ms 452 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 35 ms 348 KB Output is correct
16 Execution timed out 2577 ms 348 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 524 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Execution timed out 2510 ms 20824 KB Time limit exceeded
6 Halted 0 ms 0 KB -