Submission #923781

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
923781	2024-02-07T18:31:44 Z	OAleksa	Let's Win the Election (JOI22_ho_t3)	C++14	0 / 100	1 ms	2532 KB

Main

#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
const int N = 110;
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;
  	});
  	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;
  	//prvih i, dobio sam j glasova, k ljudi je samnom
  	for (int i = 1;i <= n;i++) {
  		for (int j = 1;j <= n;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 / k);
  				
  				dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j - 1][k - 1] + (double)a[i].s / (k - 1));
  			}
  		}
  	}
  	double ans = 1e9;
  	for (int i = 1;i <= n;i++)
  		ans = min(ans, dp[n][x][i]);
  	cout << fixed << setprecision(15) << ans;
  }
  return 0;
}

Subtask #1

0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Runtime error	1 ms	604 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	0 ms	348 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Runtime error	1 ms	604 KB	Execution killed with signal 11
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 11.0

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

Subtask #6

0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	600 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	0 ms	348 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Runtime error	1 ms	604 KB	Execution killed with signal 11
6	Halted	0 ms	0 KB	-