oj.uz

Submission #715766

# Submission time Handle Problem Language Result Execution time Memory
715766 2023-03-27T19:54:43 Z epicci23 Let's Win the Election (JOI22_ho_t3) C++17
100 / 100
 1029 ms 8484 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 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+1][0]=pre;
    for(int j:cur)
    {
      pre+=j;
      suf[i+1][++p]=pre;
    }
    for(int j=p+1;j<=n;j++) suf[i+1][j]=INF;
  }

  for(int i=0;i<=n;i++) suf[n+1][i]=0.0;
  
  ans=min(ans,(double)suf[1][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

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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 15 ms 4692 KB Output is correct
6 Correct 68 ms 5324 KB Output is correct
7 Correct 261 ms 6172 KB Output is correct
8 Correct 551 ms 7196 KB Output is correct
9 Correct 976 ms 8180 KB Output is correct
10 Correct 467 ms 7024 KB Output is correct

Subtask #2
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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 15 ms 4692 KB Output is correct
6 Correct 68 ms 5324 KB Output is correct
7 Correct 261 ms 6172 KB Output is correct
8 Correct 551 ms 7196 KB Output is correct
9 Correct 976 ms 8180 KB Output is correct
10 Correct 467 ms 7024 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 98 ms 5468 KB Output is correct
13 Correct 94 ms 5456 KB Output is correct
14 Correct 95 ms 5464 KB Output is correct
15 Correct 484 ms 6980 KB Output is correct
16 Correct 471 ms 7136 KB Output is correct
17 Correct 474 ms 7232 KB Output is correct
18 Correct 959 ms 8240 KB Output is correct
19 Correct 1029 ms 8316 KB Output is correct
20 Correct 960 ms 8484 KB Output is correct

Subtask #3
11.0 / 11.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 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 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 216 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 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 0 ms 212 KB Output is correct

Subtask #5
33.0 / 33.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 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 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 216 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 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 0 ms 212 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 596 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 3 ms 468 KB Output is correct
46 Correct 3 ms 468 KB Output is correct
47 Correct 4 ms 468 KB Output is correct
48 Correct 4 ms 468 KB Output is correct
49 Correct 8 ms 612 KB Output is correct
50 Correct 6 ms 596 KB Output is correct
51 Correct 9 ms 596 KB Output is correct
52 Correct 9 ms 592 KB Output is correct
53 Correct 4 ms 468 KB Output is correct
54 Correct 4 ms 468 KB Output is correct
55 Correct 5 ms 596 KB Output is correct
56 Correct 5 ms 572 KB Output is correct
57 Correct 4 ms 596 KB Output is correct
58 Correct 4 ms 468 KB Output is correct
59 Correct 4 ms 468 KB Output is correct
60 Correct 5 ms 468 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 974 ms 8184 KB Output is correct
2 Correct 984 ms 8192 KB Output is correct
3 Correct 999 ms 8252 KB Output is correct
4 Correct 968 ms 8224 KB Output is correct
5 Correct 963 ms 8212 KB Output is correct
6 Correct 994 ms 8356 KB Output is correct
7 Correct 978 ms 8140 KB Output is correct

Subtask #7
23.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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 15 ms 4692 KB Output is correct
6 Correct 68 ms 5324 KB Output is correct
7 Correct 261 ms 6172 KB Output is correct
8 Correct 551 ms 7196 KB Output is correct
9 Correct 976 ms 8180 KB Output is correct
10 Correct 467 ms 7024 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 98 ms 5468 KB Output is correct
13 Correct 94 ms 5456 KB Output is correct
14 Correct 95 ms 5464 KB Output is correct
15 Correct 484 ms 6980 KB Output is correct
16 Correct 471 ms 7136 KB Output is correct
17 Correct 474 ms 7232 KB Output is correct
18 Correct 959 ms 8240 KB Output is correct
19 Correct 1029 ms 8316 KB Output is correct
20 Correct 960 ms 8484 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 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 0 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 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 216 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 1 ms 468 KB Output is correct
62 Correct 1 ms 596 KB Output is correct
63 Correct 1 ms 468 KB Output is correct
64 Correct 1 ms 468 KB Output is correct
65 Correct 3 ms 468 KB Output is correct
66 Correct 3 ms 468 KB Output is correct
67 Correct 4 ms 468 KB Output is correct
68 Correct 4 ms 468 KB Output is correct
69 Correct 8 ms 612 KB Output is correct
70 Correct 6 ms 596 KB Output is correct
71 Correct 9 ms 596 KB Output is correct
72 Correct 9 ms 592 KB Output is correct
73 Correct 4 ms 468 KB Output is correct
74 Correct 4 ms 468 KB Output is correct
75 Correct 5 ms 596 KB Output is correct
76 Correct 5 ms 572 KB Output is correct
77 Correct 4 ms 596 KB Output is correct
78 Correct 4 ms 468 KB Output is correct
79 Correct 4 ms 468 KB Output is correct
80 Correct 5 ms 468 KB Output is correct
81 Correct 974 ms 8184 KB Output is correct
82 Correct 984 ms 8192 KB Output is correct
83 Correct 999 ms 8252 KB Output is correct
84 Correct 968 ms 8224 KB Output is correct
85 Correct 963 ms 8212 KB Output is correct
86 Correct 994 ms 8356 KB Output is correct
87 Correct 978 ms 8140 KB Output is correct
88 Correct 14 ms 4692 KB Output is correct
89 Correct 15 ms 4692 KB Output is correct
90 Correct 69 ms 5268 KB Output is correct
91 Correct 67 ms 5248 KB Output is correct
92 Correct 269 ms 6196 KB Output is correct
93 Correct 243 ms 6236 KB Output is correct
94 Correct 566 ms 7464 KB Output is correct
95 Correct 571 ms 7216 KB Output is correct
96 Correct 781 ms 7860 KB Output is correct
97 Correct 806 ms 7956 KB Output is correct
98 Correct 488 ms 7012 KB Output is correct
99 Correct 472 ms 6988 KB Output is correct
100 Correct 477 ms 7084 KB Output is correct
101 Correct 484 ms 6988 KB Output is correct
102 Correct 474 ms 7048 KB Output is correct
103 Correct 477 ms 7028 KB Output is correct
104 Correct 475 ms 6992 KB Output is correct
105 Correct 474 ms 7016 KB Output is correct