Submission #715764

#	Time	Username	Problem	Language	Result	Execution time	Memory
715764		epicci23	Let's Win the Election (JOI22_ho_t3)	C++17	16 / 100	1047 ms	8280 KiB

Main

#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr double INF=(double)1e14;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}


void solve()
{
  int n=in(),k=in();
  vector<array<double,2>> v(n);
  for(int i=0;i<n;i++)
  {
    v[i][1]=in(),v[i][0]=in();
    if(v[i][0]==-1) v[i][0]=INF;
  }
  sort(all(v));

  double suf[n+2][n+1];
  
  double ans=INF;
  multiset<double> cur;

  for(int i=n-1;i>=0;i--)
  {
    double pre=0;
    cur.insert(v[i][1]);
    int p=0;
    suf[i][0]=pre;
    for(int j:cur)
    {
      pre+=j;
      suf[i][++p]=pre;
    }
    for(int j=p+1;j<=n;j++) suf[i][j]=INF;
  }

  for(int i=0;i<=n;i++) suf[n+1][i]=0.0;
  
  ans=min(ans,(double)suf[0][k]); 
  for(int goal=1;goal<=k;goal++)
  {
    double dp[n+2][goal+2];

    for(int j=0;j<=n;j++)
      for(int i=0;i<=goal;i++)
       dp[j][i]=INF;

    dp[0][0]=0.0;
    double bol=goal;
    for(int i=1;i<=n;i++)
    {
      for(int j=0;j<=goal;j++)
      {
        dp[i][j]=min(dp[i-1][j]+v[i-1][1]/(bol+1.0),dp[i][j]);
        if(j>0) dp[i][j]=min(dp[i][j],dp[i-1][j-1]+v[i-1][0]/(j*1.0));
      }
    }
    for(int i=1;i<=k;i++) ans=min(ans,dp[i][goal]+suf[i+1][k-i]/(bol+1.0));
  }

  cout << ans << endl;
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message (stderr)

Main.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

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