Submission #713944

#	Time	Username	Problem	Language	Result	Execution time	Memory
713944		epicci23	Let's Win the Election (JOI22_ho_t3)	C++17	10 / 100	3 ms	340 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 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<int,3>> v,v2;
  for(int i=0;i<n;i++)
  {
    int a=in(),b=in();
    if(b==-1) b=INF;
    v.pb({a,b,i});
    v2.pb({b,a,i});
  }
  sort(all(v));
  sort(all(v2));


  double ans=INF*1.0;
  for(int i=0;i<=n;i++)
  {
    double cur=1;
    double tm=0;
    int kac=0;
    vector<int> vis(n+2,0);

    for(int j=0;j<i;j++)
    {
      tm+=(v2[j][0]*1.0)/cur;
      vis[v2[j][2]]=1;
      cur++;
      kac++;
      if(kac==k) ans=min(ans,tm);
    }

    for(int j=0;j<n;j++)
    {
      if(vis[v[j][2]]) continue;
      tm+=v[j][0]/cur;
      kac++;
      if(kac==k) ans=min(ans,tm);
      if(v[j][0]==v[j][1]) cur++;
    }
    //cout <<"i: " << i << " " << ans << endl;
  }

  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: 5 / 5
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 33
• Subtask 6: 0 / 11
• Subtask 7: 0 / 23