oj.uz

Submission #747157

# Submission time Handle Problem Language Result Execution time Memory
747157 2023-05-23T19:00:24 Z tch1cherin Let's Win the Election (JOI22_ho_t3) C++17
10 / 100
 940 ms 4692 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  int n, k;
  cin >> n >> k;
  vector<int> A(n), B(n);
  for (int i = 0; i < n; i++) {
    cin >> A[i] >> B[i];
    B[i] = (B[i] == -1 ? 1000000 : B[i]);
  }
  vector<int> order(n);
  iota(order.begin(), order.end(), 0);
  sort(order.begin(), order.end(), [&](int i, int j) {
    return B[i] < B[j];
  });
  long double ans = 1e9;
  for (int m = 0; m <= k; m++) {
    vector dp(n + 1, vector<long double>(m + 1, 1e9));
    dp[0][0] = 0;   
    for (int i = 0; i < n; i++) {
      for (int j = 0; j <= i && j <= m; j++) {
        if (j + 1 <= m) {
          dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + (long double)B[order[i]] / (j + 1)); 
        }
        dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + (long double)A[order[i]] / (m + 1));
      }
    }
    for (int p = m; p <= n; p++) {
      vector<int> C;
      for (int i = p; i < n; i++) {
        C.push_back(A[order[i]]);
      }
      sort(C.begin(), C.end());
      if ((int)C.size() < k - m) {
        break; 
      }
      long double res = dp[p][m];
      for (int i = 0; i < k - m; i++) {
        res += (long double)C[i] / (m + 1);
      }
      ans = min(ans, res);
    }
  }
  cout << fixed << setprecision(9) << ans << "\n";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 224 ms 840 KB Output is correct
6 Correct 495 ms 1572 KB Output is correct
7 Correct 871 ms 2612 KB Output is correct
8 Correct 912 ms 3492 KB Output is correct
9 Correct 784 ms 4692 KB Output is correct
10 Correct 674 ms 3456 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 224 ms 840 KB Output is correct
6 Correct 495 ms 1572 KB Output is correct
7 Correct 871 ms 2612 KB Output is correct
8 Correct 912 ms 3492 KB Output is correct
9 Correct 784 ms 4692 KB Output is correct
10 Correct 674 ms 3456 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 252 ms 1744 KB Output is correct
13 Correct 510 ms 1728 KB Output is correct
14 Correct 592 ms 1708 KB Output is correct
15 Correct 661 ms 3392 KB Output is correct
16 Correct 855 ms 3320 KB Output is correct
17 Correct 940 ms 3384 KB Output is correct
18 Correct 781 ms 4572 KB Output is correct
19 Correct 796 ms 4548 KB Output is correct
20 Correct 764 ms 4668 KB Output is correct

Subtask #3
0 / 11.0

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

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 794 ms 4676 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 224 ms 840 KB Output is correct
6 Correct 495 ms 1572 KB Output is correct
7 Correct 871 ms 2612 KB Output is correct
8 Correct 912 ms 3492 KB Output is correct
9 Correct 784 ms 4692 KB Output is correct
10 Correct 674 ms 3456 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 252 ms 1744 KB Output is correct
13 Correct 510 ms 1728 KB Output is correct
14 Correct 592 ms 1708 KB Output is correct
15 Correct 661 ms 3392 KB Output is correct
16 Correct 855 ms 3320 KB Output is correct
17 Correct 940 ms 3384 KB Output is correct
18 Correct 781 ms 4572 KB Output is correct
19 Correct 796 ms 4548 KB Output is correct
20 Correct 764 ms 4668 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Incorrect 1 ms 212 KB Output isn't correct
30 Halted 0 ms 0 KB -