Submission #624255

#	Time	Username	Problem	Language	Result	Execution time	Memory
624255		slime	Let's Win the Election (JOI22_ho_t3)	C++14	61 / 100	2599 ms	247388 KiB

Main

#include "bits/stdc++.h"
using namespace std;
//#define int long long
const int MAXN = 3e5 + 10;
const int MOD = 998244353;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
bool cmp(pair<int, int> x, pair<int, int> y) {
  return x.second < y.second;
}
int n, k, a[MAXN], b[MAXN];
double fun(int bcnt) {
  double dp[k - bcnt + 1][bcnt + 1][n + 1]; // type A, type B, prefix
  for(int i=0; i<=k-bcnt; i++) {
    for(int j=0; j<=bcnt; j++) {
      for(int l=0; l<=n; l++) {
        dp[i][j][l] = 1e9;
      }
    }
  }
  for(int i=0; i<=n; i++) dp[0][0][i] = 0;
  for(int i=0; i<=k-bcnt; i++) {
    for(int j=0; j<=bcnt; j++) {
      if(i == 0 && j == 0) continue;
      for(int l=1; l<=n; l++) {
        // register as type A
        if(i > 0) dp[i][j][l] = dp[i-1][j][l-1] + a[l] * 1.0 / (bcnt + 1);
        // register as type B
        if(j > 0 && b[l] != 1226) dp[i][j][l] = min(dp[i][j][l], dp[i][j-1][l-1] + b[l] * 1.0 / j);
        // register as neither
        dp[i][j][l] = min(dp[i][j][l], dp[i][j][l-1]);
      }
    }
  }
  return dp[k-bcnt][bcnt][n];
}
void solve(int tc) {
  cin >> n >> k;
  pair<int, int> p[n+1];
  for(int i=1; i<=n; i++) {
    cin >> p[i].first >> p[i].second;
    if(p[i].second == -1) p[i].second = 1226;
  }
  sort(p+1, p+n+1, cmp);
  for(int i=1; i<=n; i++) {
    a[i] = p[i].first, b[i] = p[i].second;
  }
  int lb = 0, rb = k;
  while(lb < rb) {
    int mid = (lb + rb) >> 1;
    if(fun(mid) > fun(mid+1)) lb = mid+1;
    else rb = mid;
  }
  cout << fixed << setprecision(10) << fun(lb) << "\n";
 
} 
int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
// I don't know geometry.
// Teaming is unfair.
 
/*
8
7
3 15
19 40
11 62
7 72
16 27
33 53
14 50
17 24
*/

• Subtask 1: 5 / 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