oj.uz

Submission #924313

# Submission time Handle Problem Language Result Execution time Memory
924313 2024-02-08T20:28:57 Z OAleksa Let's Win the Election (JOI22_ho_t3) C++14
56 / 100
 2500 ms 1007696 KB 
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
const int N = 510;
int n, x;
pair<int, int> a[N];
double dp[N][N][N];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
  	cin >> n >> x;
  	for (int i = 1;i <= n;i++) {
  		cin >> a[i].f >> a[i].s;
  		if (a[i].s == -1)
  			a[i].s = 1e9;
  	}
  	sort(a + 1, a + n + 1, [&](pair<int, int> x, pair<int, int> y) {
  		return x.s < y.s;
  	});
  	//prvih i, dobio sam j glasova, k ljudi ucestvuje
  	double ans = 1e9;
  	for (int s = 1;s <= n;s++) {
  		for (int i = 0;i <= n;i++) {
  			for (int j = 0;j <= n;j++) {
  				for (int k = 0;k <= n;k++)
  					dp[i][j][k] = 1e9;
  			}
  		}
  		for (int i = 0;i <= n;i++) 
  			dp[i][0][1] = 0;
	  	for (int i = 1;i <= n;i++) {
	  		for (int j = 1;j <= n;j++) {
	  			if (i == j) {
		  			for (int k = 1;k <= n;k++) {
		  				dp[i][j][k] = dp[i - 1][j][k];
		  				dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j - 1][k] + (double)a[i].f / s);
		  				if (k > 1)
		  					dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j - 1][k - 1] + (double)a[i].s / (k - 1));
		  			}
	  			}
	  			else {
	  				dp[i][j][s] = min(dp[i][j][s], dp[i - 1][j][s]);
	  				dp[i][j][s] = min(dp[i][j][s], dp[i - 1][j - 1][s] + (double)a[i].f / s);
	  			}
	  		}
	  	}
	  	ans = min(ans, dp[n][x][s]);
  	}
  	cout << fixed << setprecision(15) << ans;
  }
  return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Execution timed out 2560 ms 1006820 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Execution timed out 2560 ms 1006820 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14856 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14680 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14848 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14856 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14680 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14848 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 5 ms 41564 KB Output is correct
17 Correct 5 ms 41532 KB Output is correct
18 Correct 5 ms 41564 KB Output is correct
19 Correct 5 ms 41560 KB Output is correct
20 Correct 5 ms 41816 KB Output is correct
21 Correct 5 ms 41564 KB Output is correct
22 Correct 5 ms 41556 KB Output is correct
23 Correct 5 ms 41564 KB Output is correct
24 Correct 5 ms 41564 KB Output is correct
25 Correct 5 ms 41564 KB Output is correct
26 Correct 5 ms 41564 KB Output is correct
27 Correct 5 ms 41352 KB Output is correct
28 Correct 5 ms 41560 KB Output is correct
29 Correct 5 ms 41560 KB Output is correct
30 Correct 4 ms 41564 KB Output is correct
31 Correct 5 ms 41560 KB Output is correct
32 Correct 5 ms 41564 KB Output is correct
33 Correct 5 ms 41564 KB Output is correct
34 Correct 5 ms 41564 KB Output is correct
35 Correct 5 ms 41564 KB Output is correct
36 Correct 6 ms 41564 KB Output is correct
37 Correct 5 ms 41564 KB Output is correct
38 Correct 5 ms 41568 KB Output is correct
39 Correct 4 ms 41564 KB Output is correct
40 Correct 4 ms 41564 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 2 ms 14856 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14680 KB Output is correct
8 Correct 2 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14848 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 5 ms 41564 KB Output is correct
17 Correct 5 ms 41532 KB Output is correct
18 Correct 5 ms 41564 KB Output is correct
19 Correct 5 ms 41560 KB Output is correct
20 Correct 5 ms 41816 KB Output is correct
21 Correct 5 ms 41564 KB Output is correct
22 Correct 5 ms 41556 KB Output is correct
23 Correct 5 ms 41564 KB Output is correct
24 Correct 5 ms 41564 KB Output is correct
25 Correct 5 ms 41564 KB Output is correct
26 Correct 5 ms 41564 KB Output is correct
27 Correct 5 ms 41352 KB Output is correct
28 Correct 5 ms 41560 KB Output is correct
29 Correct 5 ms 41560 KB Output is correct
30 Correct 4 ms 41564 KB Output is correct
31 Correct 5 ms 41560 KB Output is correct
32 Correct 5 ms 41564 KB Output is correct
33 Correct 5 ms 41564 KB Output is correct
34 Correct 5 ms 41564 KB Output is correct
35 Correct 5 ms 41564 KB Output is correct
36 Correct 6 ms 41564 KB Output is correct
37 Correct 5 ms 41564 KB Output is correct
38 Correct 5 ms 41568 KB Output is correct
39 Correct 4 ms 41564 KB Output is correct
40 Correct 4 ms 41564 KB Output is correct
41 Correct 198 ms 179456 KB Output is correct
42 Correct 186 ms 181104 KB Output is correct
43 Correct 190 ms 181084 KB Output is correct
44 Correct 186 ms 181116 KB Output is correct
45 Correct 209 ms 181328 KB Output is correct
46 Correct 185 ms 181084 KB Output is correct
47 Correct 181 ms 181080 KB Output is correct
48 Correct 183 ms 181104 KB Output is correct
49 Correct 197 ms 181084 KB Output is correct
50 Correct 191 ms 181104 KB Output is correct
51 Correct 186 ms 180976 KB Output is correct
52 Correct 186 ms 181084 KB Output is correct
53 Correct 188 ms 182616 KB Output is correct
54 Correct 191 ms 181104 KB Output is correct
55 Correct 188 ms 181084 KB Output is correct
56 Correct 194 ms 181104 KB Output is correct
57 Correct 181 ms 181080 KB Output is correct
58 Correct 191 ms 180924 KB Output is correct
59 Correct 186 ms 181104 KB Output is correct
60 Correct 210 ms 181100 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2572 ms 1007696 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Execution timed out 2560 ms 1006820 KB Time limit exceeded
6 Halted 0 ms 0 KB -