oj.uz

Submission #551143

# Submission time Handle Problem Language Result Execution time Memory
551143 2022-04-19T23:00:45 Z DanerZein Let's Win the Election (JOI22_ho_t3) C++14
0 / 100
 2500 ms 2388 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Incorrect 1 ms 2260 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Incorrect 1 ms 2260 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 33.0

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

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2587 ms 2388 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Incorrect 1 ms 2260 KB Output isn't correct
4 Halted 0 ms 0 KB -