제출 #551143

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
551143		DanerZein	Let's Win the Election (JOI22_ho_t3)	C++14	0 / 100	2587 ms	2388 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<double,double> dd;
const int MAX=1e9;
bool orden(dd a,dd b){
  if(a.second==b.second) return a.first<b.first;
  return a.second<b.second;
}
int n;
vector<dd> st;
double ka;
double dp[510][510];
double knap(int id,int k){
  if(id==n) {
    if(k!=ka) return MAX;
    return 0;
  }
  double ans=knap(id+1,k)+st[id].first/(ka+1);
  if(k!=ka){
    ans=min(ans,knap(id+1,k+1)+st[id].second/(double)(k+1));
  }
  return dp[id][k]=ans;
}
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int k; cin>>n>>k;
  for(int i=0;i<n;i++){
    int a,b; cin>>a>>b;
    if(b==-1) b=MAX;
    st.push_back(dd(a,b));
  }
  sort(st.begin(),st.end(),orden);
  double res=MAX;
  for(int i=0;i<=k;i++){
    ka=i;
    memset(dp,-1,sizeof dp);
    double rp=knap(0,0);
    //cout<<i<<": "<<rp<<endl;
    res=min(res,rp);
  }
  printf("%.15f\n",res);
}

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