oj.uz

Submission #715754

# Submission time Handle Problem Language Result Execution time Memory
715754 2023-03-27T19:17:57 Z epicci23 Let's Win the Election (JOI22_ho_t3) C++17
28 / 100
 1197 ms 8400 KB 
#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 int INF=(int)1e18;
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*1.0;
  }
  sort(all(v));

  double suf[n+1][n+1];
  
  double ans=INF*1.0;
  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*1.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*1.0;

    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));
        if(j==goal && i+1<=n && i<=k) ans=min(ans, dp[i][j]+ suf[i+1][k-i]/(bol+1.0) );
        //if(j==goal && i==n) ans=min(ans,dp[i][j]);
        if(j==goal && i>=k) ans=min(ans,dp[i][j]);
      }
    }
  }

  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

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 18 ms 4676 KB Output is correct
6 Correct 75 ms 5312 KB Output is correct
7 Correct 386 ms 6252 KB Output is correct
8 Correct 681 ms 7176 KB Output is correct
9 Correct 1114 ms 8168 KB Output is correct
10 Correct 570 ms 7012 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 18 ms 4676 KB Output is correct
6 Correct 75 ms 5312 KB Output is correct
7 Correct 386 ms 6252 KB Output is correct
8 Correct 681 ms 7176 KB Output is correct
9 Correct 1114 ms 8168 KB Output is correct
10 Correct 570 ms 7012 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 106 ms 5376 KB Output is correct
13 Correct 107 ms 5468 KB Output is correct
14 Correct 102 ms 5444 KB Output is correct
15 Correct 584 ms 7016 KB Output is correct
16 Correct 559 ms 7064 KB Output is correct
17 Correct 526 ms 7212 KB Output is correct
18 Incorrect 1197 ms 8400 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 320 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 320 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 448 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 3 ms 468 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 3 ms 444 KB Output is correct
46 Correct 4 ms 468 KB Output is correct
47 Correct 5 ms 576 KB Output is correct
48 Correct 5 ms 468 KB Output is correct
49 Correct 7 ms 596 KB Output is correct
50 Correct 6 ms 592 KB Output is correct
51 Incorrect 10 ms 648 KB Output isn't correct
52 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 18 ms 4676 KB Output is correct
6 Correct 75 ms 5312 KB Output is correct
7 Correct 386 ms 6252 KB Output is correct
8 Correct 681 ms 7176 KB Output is correct
9 Correct 1114 ms 8168 KB Output is correct
10 Correct 570 ms 7012 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 106 ms 5376 KB Output is correct
13 Correct 107 ms 5468 KB Output is correct
14 Correct 102 ms 5444 KB Output is correct
15 Correct 584 ms 7016 KB Output is correct
16 Correct 559 ms 7064 KB Output is correct
17 Correct 526 ms 7212 KB Output is correct
18 Incorrect 1197 ms 8400 KB Output isn't correct
19 Halted 0 ms 0 KB -