Submission #1182894

#	Time	Username	Problem	Language	Result	Execution time	Memory
1182894		dima2101	Let's Win the Election (JOI22_ho_t3)	C++20	56 / 100	1486 ms	16832 KiB

Main

#include <bits/stdc++.h>
#define int long long

const int MAXN = 101;
long double dp[MAXN][MAXN][MAXN];

int32_t main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  int n;

  std::cin >> n;

  int k;
  std::cin >> k;
  std::vector<std::pair<int, int>> b(n);
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    std::cin >> b[i].first;
    std::cin >> b[i].second;
    if (b[i].second == -1) {
      cnt++;
      b[i].second = 1e4;
    }
  }

  std::sort(b.begin(), b.end(),
            [&](std::pair<int, int> a, std::pair<int, int> b) {
              return a.second < b.second;
            });
  // for (auto j : b) {
  //   std::cout << j.first << ' ' << j.second << std::endl;
  //   ;
  // }
  long double ans = 1e18;
  for (int z = 0; z <= k; z++) {
    for (int i = 0; i < MAXN; i++) {
      for (int j = 0; j < MAXN; j++) {
        for (int z1 = 0; z1 < MAXN; z1++) {
          dp[i][j][z1] = 1e18;
        }
      }
    }
    dp[0][0][0] = 0;

    for (int i = 1; i <= n; i++) {
      for (int j = 0; j <= n; j++) {
        for (int k1 = 0; k1 <= n; k1++) {
          dp[i][j][k1] = dp[i - 1][j][k1];
          if (j > 0 && b[i - 1].second != 1e4) {
            // std::cout << i << ' ' << b[i - 1].second << std::endl;
            dp[i][j][k1] =
                std::min(dp[i][j][k1],
                         dp[i - 1][j - 1][k1] +
                             (long double)(b[i - 1].second) / (long double)(j));
          }
          if (k > 0) {
            dp[i][j][k1] =
                std::min(dp[i][j][k1],
                         dp[i - 1][j][k1 - 1] + (long double)(b[i - 1].first) /
                                                    (long double)(z + 1));
          }
        }
      }
    }
    // std::cout << z << ' ' << dp[n][z][k - z] << std::endl;
    ans = std::min(ans, dp[n][z][k - z]);
  }
  std::cout << std::setprecision(20) << std::fixed << ans;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 11 / 11
• Subtask 4: 12 / 12
• Subtask 5: 33 / 33
• Subtask 6: 0 / 11
• Subtask 7: 0 / 23